/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:49:52,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:49:52,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:49:52,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:49:52,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:49:52,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:49:52,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:49:52,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:49:52,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:49:52,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:49:52,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:49:52,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:49:52,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:49:52,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:49:52,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:49:52,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:49:52,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:49:52,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:49:52,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:49:52,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:49:52,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:49:52,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:49:52,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:49:52,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:49:52,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:49:52,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:49:52,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:49:52,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:49:52,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:49:52,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:49:52,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:49:52,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:49:52,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:49:52,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:49:52,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:49:52,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:49:52,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:49:52,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:49:52,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:49:52,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:49:52,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:49:52,428 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:49:52,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:49:52,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:49:52,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:49:52,443 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:49:52,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:49:52,444 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:49:52,444 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:49:52,444 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:49:52,444 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:49:52,444 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:49:52,444 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:49:52,445 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:49:52,445 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:49:52,445 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:49:52,445 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:49:52,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:49:52,445 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:49:52,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:49:52,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:49:52,446 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:49:52,446 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:49:52,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:49:52,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:49:52,447 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:49:52,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:49:52,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:49:52,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:49:52,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:49:52,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:49:52,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:49:52,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:49:52,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:49:52,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:49:52,635 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:49:52,636 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:49:52,741 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_8DIg_z/tmp/ad288a966d854061a72b65aff0431ee2/FLAG572a534a9 [2020-07-01 12:49:53,105 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:49:53,106 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:49:53,106 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:49:53,113 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_8DIg_z/tmp/ad288a966d854061a72b65aff0431ee2/FLAG572a534a9 [2020-07-01 12:49:53,493 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_8DIg_z/tmp/ad288a966d854061a72b65aff0431ee2 [2020-07-01 12:49:53,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:49:53,506 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:49:53,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:49:53,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:49:53,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:49:53,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dd641b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53, skipping insertion in model container [2020-07-01 12:49:53,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:49:53,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:49:53,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:49:53,775 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:49:53,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:49:53,808 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:49:53,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53 WrapperNode [2020-07-01 12:49:53,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:49:53,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:49:53,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:49:53,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:49:53,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:49:53,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:49:53,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:49:53,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:49:53,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... [2020-07-01 12:49:53,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:49:53,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:49:53,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:49:53,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:49:53,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:49:53,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:49:53,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:49:53,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:49:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:49:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:49:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:49:54,280 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:49:54,280 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:49:54,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54 BoogieIcfgContainer [2020-07-01 12:49:54,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:49:54,286 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:49:54,286 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:49:54,288 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:49:54,288 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (1/1) ... [2020-07-01 12:49:54,306 INFO L313 BlockEncoder]: Initial Icfg 77 locations, 81 edges [2020-07-01 12:49:54,307 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:49:54,308 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:49:54,308 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:49:54,309 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:49:54,311 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:49:54,312 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:49:54,312 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:49:54,340 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:49:54,381 INFO L200 BlockEncoder]: SBE split 41 edges [2020-07-01 12:49:54,386 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:49:54,387 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:49:54,428 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding [2020-07-01 12:49:54,430 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:49:54,432 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:49:54,432 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:49:54,433 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:49:54,433 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:49:54,434 INFO L313 BlockEncoder]: Encoded RCFG 64 locations, 114 edges [2020-07-01 12:49:54,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54 BasicIcfg [2020-07-01 12:49:54,434 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:49:54,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:49:54,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:49:54,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:49:54,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:49:53" (1/4) ... [2020-07-01 12:49:54,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be4f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (2/4) ... [2020-07-01 12:49:54,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be4f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (3/4) ... [2020-07-01 12:49:54,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be4f4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:54, skipping insertion in model container [2020-07-01 12:49:54,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54" (4/4) ... [2020-07-01 12:49:54,443 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:49:54,453 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:49:54,461 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2020-07-01 12:49:54,474 INFO L251 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2020-07-01 12:49:54,497 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:49:54,497 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:49:54,498 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:49:54,498 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:49:54,498 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:49:54,498 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:49:54,498 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:49:54,498 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:49:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-07-01 12:49:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:54,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:54,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:54,521 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash 176376, now seen corresponding path program 1 times [2020-07-01 12:49:54,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:54,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841407350] [2020-07-01 12:49:54,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:54,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841407350] [2020-07-01 12:49:54,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:54,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:54,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505301763] [2020-07-01 12:49:54,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:54,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:54,715 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-07-01 12:49:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:54,909 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2020-07-01 12:49:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:54,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:54,924 INFO L225 Difference]: With dead ends: 126 [2020-07-01 12:49:54,925 INFO L226 Difference]: Without dead ends: 64 [2020-07-01 12:49:54,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-01 12:49:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-01 12:49:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-01 12:49:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 107 transitions. [2020-07-01 12:49:54,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 107 transitions. Word has length 3 [2020-07-01 12:49:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:54,986 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 107 transitions. [2020-07-01 12:49:54,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 107 transitions. [2020-07-01 12:49:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:54,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:54,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:54,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:49:54,989 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 176500, now seen corresponding path program 1 times [2020-07-01 12:49:54,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:54,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408736873] [2020-07-01 12:49:54,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408736873] [2020-07-01 12:49:55,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230321375] [2020-07-01 12:49:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,053 INFO L87 Difference]: Start difference. First operand 64 states and 107 transitions. Second operand 3 states. [2020-07-01 12:49:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,236 INFO L93 Difference]: Finished difference Result 64 states and 107 transitions. [2020-07-01 12:49:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,238 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:49:55,238 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:49:55,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:49:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-01 12:49:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 12:49:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 93 transitions. [2020-07-01 12:49:55,246 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 93 transitions. Word has length 3 [2020-07-01 12:49:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,246 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 93 transitions. [2020-07-01 12:49:55,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 93 transitions. [2020-07-01 12:49:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:55,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:55,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:49:55,247 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 176502, now seen corresponding path program 1 times [2020-07-01 12:49:55,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056063379] [2020-07-01 12:49:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056063379] [2020-07-01 12:49:55,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424137894] [2020-07-01 12:49:55,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,276 INFO L87 Difference]: Start difference. First operand 57 states and 93 transitions. Second operand 3 states. [2020-07-01 12:49:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,404 INFO L93 Difference]: Finished difference Result 64 states and 93 transitions. [2020-07-01 12:49:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,406 INFO L225 Difference]: With dead ends: 64 [2020-07-01 12:49:55,406 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:49:55,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:49:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-01 12:49:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 12:49:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2020-07-01 12:49:55,413 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 3 [2020-07-01 12:49:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,413 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2020-07-01 12:49:55,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2020-07-01 12:49:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:49:55,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:49:55,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:49:55,414 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 176503, now seen corresponding path program 1 times [2020-07-01 12:49:55,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786497937] [2020-07-01 12:49:55,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786497937] [2020-07-01 12:49:55,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142134887] [2020-07-01 12:49:55,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,460 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand 3 states. [2020-07-01 12:49:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,580 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2020-07-01 12:49:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:49:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,581 INFO L225 Difference]: With dead ends: 57 [2020-07-01 12:49:55,581 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:49:55,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:49:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 12:49:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:49:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2020-07-01 12:49:55,588 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 3 [2020-07-01 12:49:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,588 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2020-07-01 12:49:55,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2020-07-01 12:49:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:49:55,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:49:55,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:49:55,589 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 5474220, now seen corresponding path program 1 times [2020-07-01 12:49:55,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075719753] [2020-07-01 12:49:55,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075719753] [2020-07-01 12:49:55,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695371797] [2020-07-01 12:49:55,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,634 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand 3 states. [2020-07-01 12:49:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,754 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2020-07-01 12:49:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:49:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,755 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:49:55,755 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:49:55,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:49:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 12:49:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:49:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2020-07-01 12:49:55,761 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 4 [2020-07-01 12:49:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,761 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 69 transitions. [2020-07-01 12:49:55,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2020-07-01 12:49:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:49:55,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:49:55,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:49:55,762 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,762 INFO L82 PathProgramCache]: Analyzing trace with hash 5474218, now seen corresponding path program 1 times [2020-07-01 12:49:55,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46011312] [2020-07-01 12:49:55,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46011312] [2020-07-01 12:49:55,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612996528] [2020-07-01 12:49:55,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,796 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 3 states. [2020-07-01 12:49:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,881 INFO L93 Difference]: Finished difference Result 45 states and 69 transitions. [2020-07-01 12:49:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:49:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,883 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:49:55,883 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:49:55,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:49:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:49:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:49:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-07-01 12:49:55,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 4 [2020-07-01 12:49:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,888 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-07-01 12:49:55,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-07-01 12:49:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:55,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:55,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:49:55,889 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 169703387, now seen corresponding path program 1 times [2020-07-01 12:49:55,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079571919] [2020-07-01 12:49:55,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:55,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079571919] [2020-07-01 12:49:55,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:55,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004441358] [2020-07-01 12:49:55,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:55,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,919 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 3 states. [2020-07-01 12:49:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:55,988 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2020-07-01 12:49:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:55,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:55,989 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:49:55,989 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:49:55,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:49:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:49:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:49:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2020-07-01 12:49:55,993 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 5 [2020-07-01 12:49:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:55,993 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-07-01 12:49:55,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-07-01 12:49:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:55,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:55,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:55,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:49:55,995 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash 169703389, now seen corresponding path program 1 times [2020-07-01 12:49:55,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:55,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750469185] [2020-07-01 12:49:55,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750469185] [2020-07-01 12:49:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803625224] [2020-07-01 12:49:56,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,023 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2020-07-01 12:49:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,056 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-07-01 12:49:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,057 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:49:56,057 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:49:56,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:49:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:49:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:49:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-07-01 12:49:56,061 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 5 [2020-07-01 12:49:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,061 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-07-01 12:49:56,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2020-07-01 12:49:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:49:56,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:49:56,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:49:56,062 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:49:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash 169703390, now seen corresponding path program 1 times [2020-07-01 12:49:56,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153008120] [2020-07-01 12:49:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153008120] [2020-07-01 12:49:56,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056775035] [2020-07-01 12:49:56,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:49:56,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,097 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 3 states. [2020-07-01 12:49:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,141 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-01 12:49:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:49:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:49:56,142 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:49:56,143 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:49:56,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:49:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:49:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:49:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:49:56,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:49:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:49:56,145 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:49:56,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:49:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:49:56,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:49:56,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:49:56,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:49:56,181 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,181 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,181 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-4(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-6(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-7(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,182 INFO L268 CegarLoopResult]: For program point L23-8(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point L23-9(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point L23-11(lines 23 33) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:49:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 32) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,184 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:49:56,185 INFO L264 CegarLoopResult]: At program point L24-4(lines 23 33) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:49:56,195 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:56,196 INFO L268 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,197 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:49:56,198 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:49:56,199 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:49:56,202 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:49:56,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:56,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:56 BasicIcfg [2020-07-01 12:49:56,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:49:56,223 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:49:56,223 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:49:56,226 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:49:56,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:56,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:49:53" (1/5) ... [2020-07-01 12:49:56,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b607a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:49:56, skipping insertion in model container [2020-07-01 12:49:56,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:56,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:49:53" (2/5) ... [2020-07-01 12:49:56,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b607a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:49:56, skipping insertion in model container [2020-07-01 12:49:56,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:56,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:49:54" (3/5) ... [2020-07-01 12:49:56,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b607a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:49:56, skipping insertion in model container [2020-07-01 12:49:56,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:56,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:49:54" (4/5) ... [2020-07-01 12:49:56,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b607a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:49:56, skipping insertion in model container [2020-07-01 12:49:56,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:49:56,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:49:56" (5/5) ... [2020-07-01 12:49:56,231 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:49:56,252 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:49:56,252 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:49:56,252 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:49:56,252 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:49:56,253 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:49:56,253 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:49:56,253 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:49:56,253 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:49:56,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2020-07-01 12:49:56,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 12:49:56,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:49:56,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:49:56,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,269 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:56,270 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:49:56,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2020-07-01 12:49:56,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 12:49:56,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:49:56,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:49:56,273 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:49:56,273 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:49:56,279 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [233] L-1-->L19: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 27#L19true [314] L19-->L20: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_25)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18) (= 1 (select |v_#valid_47| v_ULTIMATE.start_main_~x~0.base_25))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 45#L20true [315] L20-->L21: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_30|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14) (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~y~0.base_19))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 11#L21true [316] L21-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_16 4) (select |v_#length_43| v_ULTIMATE.start_main_~z~0.base_22)) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~z~0.base_22)) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~z~0.base_22) v_ULTIMATE.start_main_~z~0.offset_16 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_32|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_16)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_33|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_22, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_16, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_32|, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 47#L24-4true [2020-07-01 12:49:56,280 INFO L796 eck$LassoCheckResult]: Loop: 47#L24-4true [165] L24-4-->L23-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 52#L23-1true [250] L23-1-->L23-2: Formula: (and |v_ULTIMATE.start_main_#t~short8_2| (< 0 |v_ULTIMATE.start_main_#t~mem6_3|)) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 50#L23-2true [169] L23-2-->L23-6: Formula: (not |v_ULTIMATE.start_main_#t~short8_5|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_5|} AuxVars[] AssignedVars[] 24#L23-6true [256] L23-6-->L23-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short10_2|) (not |v_ULTIMATE.start_main_#t~short8_6|)) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 22#L23-7true [130] L23-7-->L23-11: Formula: (not |v_ULTIMATE.start_main_#t~short10_5|) InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_5|} AuxVars[] AssignedVars[] 34#L23-11true [147] L23-11-->L24: Formula: |v_ULTIMATE.start_main_#t~short10_9| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 65#L24true [182] L24-->L24-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~y~0.base_10)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_17| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 64#L24-1true [179] L24-1-->L24-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_10)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8) |v_ULTIMATE.start_main_#t~mem12_2|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~x~0.base_10))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 63#L24-2true [177] L24-2-->L25: Formula: (< |v_ULTIMATE.start_main_#t~mem12_4| |v_ULTIMATE.start_main_#t~mem11_4|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_4|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_4|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 17#L25true [120] L25-->L25-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~z~0.base_10))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 16#L25-1true [320] L25-1-->L26: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20)) (= (store |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15 |v_ULTIMATE.start_main_#t~mem13_6|)) |v_#memory_int_34|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, #memory_int] 21#L26true [322] L26-->L27: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_main_~x~0.base_26)) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~x~0.base_26)) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 |v_ULTIMATE.start_main_#t~nondet14_5|))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19)) InVars {ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_4|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_46|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14, #memory_int] 39#L27true [153] L27-->L27-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 38#L27-1true [324] L27-1-->L24-4: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_18 4) (select |v_#length_48| v_ULTIMATE.start_main_~z~0.base_24)) (= (store |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24 (store (select |v_#memory_int_43| v_ULTIMATE.start_main_~z~0.base_24) v_ULTIMATE.start_main_~z~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem15_6| (- 1)))) |v_#memory_int_42|) (= 1 (select |v_#valid_60| v_ULTIMATE.start_main_~z~0.base_24)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_18)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_43|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_24, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_18, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_42|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 47#L24-4true [2020-07-01 12:49:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 169792834, now seen corresponding path program 1 times [2020-07-01 12:49:56,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256277063] [2020-07-01 12:49:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256277063] [2020-07-01 12:49:56,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:49:56,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637823269] [2020-07-01 12:49:56,301 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:49:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:49:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash 262092399, now seen corresponding path program 1 times [2020-07-01 12:49:56,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:49:56,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056122233] [2020-07-01 12:49:56,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:49:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:49:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:49:56,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056122233] [2020-07-01 12:49:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:49:56,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:49:56,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358124606] [2020-07-01 12:49:56,316 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:49:56,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:49:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:49:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:49:56,318 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-07-01 12:49:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:49:56,430 INFO L93 Difference]: Finished difference Result 64 states and 107 transitions. [2020-07-01 12:49:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:49:56,433 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:49:56,438 INFO L168 Benchmark]: Toolchain (without parser) took 2930.48 ms. Allocated memory was 649.6 MB in the beginning and 751.3 MB in the end (delta: 101.7 MB). Free memory was 562.6 MB in the beginning and 671.5 MB in the end (delta: -108.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:49:56,438 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 582.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:49:56,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.98 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 561.5 MB in the beginning and 648.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 684.2 MB. Free memory was 648.0 MB in the beginning and 645.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,440 INFO L168 Benchmark]: Boogie Preprocessor took 23.73 ms. Allocated memory is still 684.2 MB. Free memory was 645.9 MB in the beginning and 643.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,440 INFO L168 Benchmark]: RCFGBuilder took 411.18 ms. Allocated memory is still 684.2 MB. Free memory was 643.7 MB in the beginning and 611.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,441 INFO L168 Benchmark]: BlockEncodingV2 took 148.87 ms. Allocated memory is still 684.2 MB. Free memory was 611.8 MB in the beginning and 597.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,442 INFO L168 Benchmark]: TraceAbstraction took 1787.02 ms. Allocated memory was 684.2 MB in the beginning and 751.3 MB in the end (delta: 67.1 MB). Free memory was 596.7 MB in the beginning and 703.7 MB in the end (delta: -107.0 MB). Peak memory consumption was 220.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,442 INFO L168 Benchmark]: BuchiAutomizer took 212.20 ms. Allocated memory is still 751.3 MB. Free memory was 703.7 MB in the beginning and 671.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:49:56,446 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 77 locations, 81 edges - StatisticsResult: Encoded RCFG 64 locations, 114 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 582.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 301.98 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 561.5 MB in the beginning and 648.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 684.2 MB. Free memory was 648.0 MB in the beginning and 645.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.73 ms. Allocated memory is still 684.2 MB. Free memory was 645.9 MB in the beginning and 643.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 411.18 ms. Allocated memory is still 684.2 MB. Free memory was 643.7 MB in the beginning and 611.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 148.87 ms. Allocated memory is still 684.2 MB. Free memory was 611.8 MB in the beginning and 597.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1787.02 ms. Allocated memory was 684.2 MB in the beginning and 751.3 MB in the end (delta: 67.1 MB). Free memory was 596.7 MB in the beginning and 703.7 MB in the end (delta: -107.0 MB). Peak memory consumption was 220.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 212.20 ms. Allocated memory is still 751.3 MB. Free memory was 703.7 MB in the beginning and 671.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2020-07-01 12:49:56,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:49:56,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:49:56,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 36 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 104 SDtfs, 591 SDslu, 5 SDs, 0 SdLazy, 515 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:49:50.188 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_8DIg_z/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:49:56.683 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check