java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:33:07,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:33:07,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:33:07,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:33:07,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:33:07,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:33:07,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:33:07,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:33:07,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:33:07,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:33:07,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:33:07,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:33:07,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:33:07,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:33:07,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:33:07,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:33:07,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:33:07,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:33:07,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:33:07,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:33:07,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:33:07,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:33:07,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:33:07,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:33:07,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:33:07,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:33:07,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:33:07,484 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:33:07,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:33:07,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:33:07,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:33:07,485 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:33:07,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:33:07,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:33:07,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:33:07,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:33:07,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:33:07,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:33:07,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:33:07,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:33:07,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:33:07,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:33:07,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:33:07,498 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:33:07,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:33:07,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:33:07,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:33:07,536 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:33:07,539 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:33:07,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:33:07,541 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:33:07,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-04 13:33:07,637 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:33:07,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:33:07,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:33:07,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:33:07,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:33:07,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fffaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07, skipping insertion in model container [2018-02-04 13:33:07,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,664 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:33:07,678 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:33:07,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:33:07,786 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:33:07,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07 WrapperNode [2018-02-04 13:33:07,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:33:07,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:33:07,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:33:07,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:33:07,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... [2018-02-04 13:33:07,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:33:07,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:33:07,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:33:07,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:33:07,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:33:07,848 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:33:07,848 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:33:07,848 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 13:33:07,848 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:33:07,848 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:33:07,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:33:08,000 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:33:08,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:33:08 BoogieIcfgContainer [2018-02-04 13:33:08,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:33:08,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:33:08,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:33:08,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:33:08,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:33:07" (1/3) ... [2018-02-04 13:33:08,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:33:08, skipping insertion in model container [2018-02-04 13:33:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:33:07" (2/3) ... [2018-02-04 13:33:08,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60413bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:33:08, skipping insertion in model container [2018-02-04 13:33:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:33:08" (3/3) ... [2018-02-04 13:33:08,006 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-04 13:33:08,013 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:33:08,021 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 13:33:08,053 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:33:08,053 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:33:08,053 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:33:08,053 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:33:08,053 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:33:08,053 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:33:08,053 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:33:08,053 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:33:08,054 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:33:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 13:33:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 13:33:08,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:08,068 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:08,068 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 13:33:08,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:08,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:08,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:08,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:08,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:08,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:33:08,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:33:08,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:33:08,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:33:08,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:33:08,198 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 13:33:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:08,248 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 13:33:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:33:08,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 13:33:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:08,254 INFO L225 Difference]: With dead ends: 63 [2018-02-04 13:33:08,255 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:33:08,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:33:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:33:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 13:33:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 13:33:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 13:33:08,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 13:33:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:08,321 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 13:33:08,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:33:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 13:33:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 13:33:08,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:08,322 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:08,322 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 13:33:08,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:08,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:08,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:08,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:08,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:08,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:33:08,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:33:08,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:33:08,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:33:08,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:33:08,420 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-04 13:33:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:08,556 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 13:33:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:33:08,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 13:33:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:08,560 INFO L225 Difference]: With dead ends: 91 [2018-02-04 13:33:08,560 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 13:33:08,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:33:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 13:33:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-02-04 13:33:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 13:33:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-02-04 13:33:08,568 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-02-04 13:33:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:08,569 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-02-04 13:33:08,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:33:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-02-04 13:33:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:33:08,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:08,569 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:08,570 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 13:33:08,570 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:08,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:08,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:08,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:08,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:08,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:33:08,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:33:08,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:33:08,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:33:08,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:33:08,708 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 8 states. [2018-02-04 13:33:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:08,868 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 13:33:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:33:08,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 13:33:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:08,869 INFO L225 Difference]: With dead ends: 75 [2018-02-04 13:33:08,869 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 13:33:08,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:33:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 13:33:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 13:33:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 13:33:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 13:33:08,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-02-04 13:33:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:08,875 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 13:33:08,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:33:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 13:33:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:33:08,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:08,876 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:08,876 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 13:33:08,877 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:08,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:08,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,878 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:08,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:08,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:08,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:33:08,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:33:08,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:33:08,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:33:08,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:33:08,921 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-02-04 13:33:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:08,955 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 13:33:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:33:08,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 13:33:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:08,957 INFO L225 Difference]: With dead ends: 65 [2018-02-04 13:33:08,957 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 13:33:08,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:33:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 13:33:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 13:33:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 13:33:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-04 13:33:08,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-02-04 13:33:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:08,962 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-04 13:33:08,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:33:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-04 13:33:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 13:33:08,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:08,963 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:08,963 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 13:33:08,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:08,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:08,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:08,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:08,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:09,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:09,064 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:09,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:09,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:09,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-04 13:33:09,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:33:09,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:33:09,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:33:09,139 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-02-04 13:33:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:09,293 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 13:33:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:33:09,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 13:33:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:09,294 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:33:09,294 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:33:09,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:33:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:33:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-02-04 13:33:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 13:33:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 13:33:09,300 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-02-04 13:33:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:09,300 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 13:33:09,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:33:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 13:33:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:33:09,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:09,302 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:09,302 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-02-04 13:33:09,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:09,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:09,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:33:09,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:33:09,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:33:09,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:33:09,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:33:09,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:33:09,351 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-02-04 13:33:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:09,389 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 13:33:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:33:09,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 13:33:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:09,391 INFO L225 Difference]: With dead ends: 85 [2018-02-04 13:33:09,391 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 13:33:09,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:33:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 13:33:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-04 13:33:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 13:33:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 13:33:09,396 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-02-04 13:33:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:09,397 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 13:33:09,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:33:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 13:33:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:33:09,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:09,398 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:09,398 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 13:33:09,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:09,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:09,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:33:09,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:09,435 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:09,444 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:33:09,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:09,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-02-04 13:33:09,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:33:09,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:33:09,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:33:09,529 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 8 states. [2018-02-04 13:33:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:09,633 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-02-04 13:33:09,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:33:09,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-04 13:33:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:09,634 INFO L225 Difference]: With dead ends: 118 [2018-02-04 13:33:09,634 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 13:33:09,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:33:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 13:33:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2018-02-04 13:33:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 13:33:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-04 13:33:09,640 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 37 [2018-02-04 13:33:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:09,640 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-04 13:33:09,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:33:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-04 13:33:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 13:33:09,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:09,642 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:09,642 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:09,642 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-02-04 13:33:09,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:09,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:09,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 13:33:09,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:09,811 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:09,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:09,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 13:33:09,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:09,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-02-04 13:33:09,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:33:09,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:33:09,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:33:09,905 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 16 states. [2018-02-04 13:33:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:10,219 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-02-04 13:33:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:33:10,219 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-04 13:33:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:10,220 INFO L225 Difference]: With dead ends: 155 [2018-02-04 13:33:10,220 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 13:33:10,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:33:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 13:33:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-02-04 13:33:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 13:33:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-04 13:33:10,224 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 59 [2018-02-04 13:33:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:10,225 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-04 13:33:10,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:33:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-04 13:33:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 13:33:10,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:10,225 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:10,225 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 2 times [2018-02-04 13:33:10,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:10,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:10,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:10,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:10,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:10,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 13:33:10,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:10,475 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:10,501 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:10,512 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:33:10,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:10,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:10,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:33:10,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 13:33:10,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:10,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:33:10,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 13:33:10,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:33:10,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 13:33:10,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:10,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:33:10,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 13:33:10,680 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-02-04 13:33:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-02-04 13:33:10,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:33:10,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2018-02-04 13:33:10,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:33:10,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:33:10,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-02-04 13:33:10,713 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 14 states. [2018-02-04 13:33:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:11,003 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 13:33:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:33:11,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-02-04 13:33:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:11,004 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:33:11,004 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:33:11,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=362, Unknown=1, NotChecked=40, Total=506 [2018-02-04 13:33:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:33:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 13:33:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:33:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 13:33:11,008 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 67 [2018-02-04 13:33:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:11,008 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 13:33:11,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:33:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 13:33:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 13:33:11,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:11,009 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:11,009 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1376831888, now seen corresponding path program 2 times [2018-02-04 13:33:11,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:11,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:11,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:11,010 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:11,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:11,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 185 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 13:33:11,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:11,086 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:11,091 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:11,116 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:33:11,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:11,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 185 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 13:33:11,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:11,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-02-04 13:33:11,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:33:11,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:33:11,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:33:11,199 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 11 states. [2018-02-04 13:33:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:11,270 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-02-04 13:33:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:33:11,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-02-04 13:33:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:11,271 INFO L225 Difference]: With dead ends: 114 [2018-02-04 13:33:11,271 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 13:33:11,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:33:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 13:33:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-02-04 13:33:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:33:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-02-04 13:33:11,276 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 89 [2018-02-04 13:33:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:11,276 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-02-04 13:33:11,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:33:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-02-04 13:33:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 13:33:11,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:11,277 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:11,277 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -30161384, now seen corresponding path program 3 times [2018-02-04 13:33:11,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:11,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:11,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:11,278 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:11,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:11,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 203 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 13:33:11,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:11,385 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:11,391 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:33:11,408 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 13:33:11,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:11,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:11,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:11,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:11,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 162 proven. 22 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-02-04 13:33:11,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:11,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-04 13:33:11,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:33:11,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:33:11,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:33:11,626 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 21 states. [2018-02-04 13:33:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:12,023 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-02-04 13:33:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:33:12,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-02-04 13:33:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:12,024 INFO L225 Difference]: With dead ends: 143 [2018-02-04 13:33:12,024 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 13:33:12,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:33:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 13:33:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-02-04 13:33:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 13:33:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-02-04 13:33:12,029 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 95 [2018-02-04 13:33:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:12,030 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-02-04 13:33:12,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:33:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-02-04 13:33:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 13:33:12,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:12,032 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:12,032 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 4 times [2018-02-04 13:33:12,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:12,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:12,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:12,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:12,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:12,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 257 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-04 13:33:12,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:12,264 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:12,272 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:33:12,304 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:33:12,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:12,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 409 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-04 13:33:12,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:12,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-02-04 13:33:12,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:33:12,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:33:12,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:33:12,447 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 18 states. [2018-02-04 13:33:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:12,750 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2018-02-04 13:33:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:33:12,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-02-04 13:33:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:12,751 INFO L225 Difference]: With dead ends: 161 [2018-02-04 13:33:12,751 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 13:33:12,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:33:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 13:33:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-02-04 13:33:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 13:33:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2018-02-04 13:33:12,756 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 125 [2018-02-04 13:33:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:12,756 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2018-02-04 13:33:12,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:33:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2018-02-04 13:33:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 13:33:12,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:12,758 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:12,758 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 5 times [2018-02-04 13:33:12,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:12,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:12,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:12,759 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:12,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:12,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 345 proven. 80 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-02-04 13:33:12,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:12,976 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:12,982 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:33:13,022 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 13:33:13,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:13,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 425 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 13:33:13,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:13,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2018-02-04 13:33:13,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:33:13,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:33:13,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:33:13,198 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 23 states. [2018-02-04 13:33:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:13,843 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2018-02-04 13:33:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:33:13,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2018-02-04 13:33:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:13,844 INFO L225 Difference]: With dead ends: 211 [2018-02-04 13:33:13,844 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 13:33:13,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 13:33:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 13:33:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2018-02-04 13:33:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 13:33:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-02-04 13:33:13,849 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 137 [2018-02-04 13:33:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:13,849 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-02-04 13:33:13,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:33:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-02-04 13:33:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 13:33:13,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:13,852 INFO L351 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:13,852 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 6 times [2018-02-04 13:33:13,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:13,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:13,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:13,859 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:13,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:13,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 905 proven. 44 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-02-04 13:33:13,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:13,983 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:13,987 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:33:14,023 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 13:33:14,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:14,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 716 proven. 333 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-02-04 13:33:14,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:14,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-02-04 13:33:14,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 13:33:14,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 13:33:14,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:33:14,220 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 28 states. [2018-02-04 13:33:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:14,631 INFO L93 Difference]: Finished difference Result 260 states and 264 transitions. [2018-02-04 13:33:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 13:33:14,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 179 [2018-02-04 13:33:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:14,633 INFO L225 Difference]: With dead ends: 260 [2018-02-04 13:33:14,633 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 13:33:14,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 13:33:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 13:33:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2018-02-04 13:33:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 13:33:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-02-04 13:33:14,638 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 179 [2018-02-04 13:33:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:14,638 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-02-04 13:33:14,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 13:33:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-02-04 13:33:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 13:33:14,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:14,641 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:14,641 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 7 times [2018-02-04 13:33:14,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:14,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:14,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:14,642 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:14,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:14,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-02-04 13:33:14,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:14,840 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:14,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:14,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-02-04 13:33:14,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:14,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-02-04 13:33:14,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:33:14,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:33:14,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:33:14,975 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand 20 states. [2018-02-04 13:33:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:15,111 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-02-04 13:33:15,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 13:33:15,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-02-04 13:33:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:15,112 INFO L225 Difference]: With dead ends: 254 [2018-02-04 13:33:15,113 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 13:33:15,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:33:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 13:33:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 243. [2018-02-04 13:33:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 13:33:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2018-02-04 13:33:15,118 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 227 [2018-02-04 13:33:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:15,118 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 245 transitions. [2018-02-04 13:33:15,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:33:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 245 transitions. [2018-02-04 13:33:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 13:33:15,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:15,121 INFO L351 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:15,121 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 8 times [2018-02-04 13:33:15,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:15,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:15,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:15,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:15,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:15,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 114 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-02-04 13:33:15,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:15,411 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:15,415 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:15,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:33:15,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:15,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:15,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:15,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:15,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:15,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 92 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2018-02-04 13:33:15,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:15,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 13:33:15,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:33:15,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:33:15,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:33:15,750 INFO L87 Difference]: Start difference. First operand 243 states and 245 transitions. Second operand 21 states. [2018-02-04 13:33:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:16,137 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2018-02-04 13:33:16,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 13:33:16,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-02-04 13:33:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:16,138 INFO L225 Difference]: With dead ends: 317 [2018-02-04 13:33:16,138 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 13:33:16,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 13:33:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 13:33:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2018-02-04 13:33:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 13:33:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2018-02-04 13:33:16,142 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 233 [2018-02-04 13:33:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:16,142 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2018-02-04 13:33:16,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:33:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2018-02-04 13:33:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 13:33:16,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:16,143 INFO L351 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:16,143 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 9 times [2018-02-04 13:33:16,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:16,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:16,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:16,144 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:16,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:16,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2257 proven. 102 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-02-04 13:33:16,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:16,432 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:16,440 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:33:16,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 13:33:16,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:16,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2051 proven. 382 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-02-04 13:33:16,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:16,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-02-04 13:33:16,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:33:16,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:33:16,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:33:16,764 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 34 states. [2018-02-04 13:33:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:17,310 INFO L93 Difference]: Finished difference Result 316 states and 318 transitions. [2018-02-04 13:33:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 13:33:17,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-02-04 13:33:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:17,311 INFO L225 Difference]: With dead ends: 316 [2018-02-04 13:33:17,311 INFO L226 Difference]: Without dead ends: 310 [2018-02-04 13:33:17,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 13:33:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-04 13:33:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2018-02-04 13:33:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 13:33:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 305 transitions. [2018-02-04 13:33:17,315 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 305 transitions. Word has length 287 [2018-02-04 13:33:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:17,316 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 305 transitions. [2018-02-04 13:33:17,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:33:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 305 transitions. [2018-02-04 13:33:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 13:33:17,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:17,317 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:17,317 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 10 times [2018-02-04 13:33:17,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:17,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:17,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:17,318 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:17,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:17,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 13:33:17,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:17,701 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:17,707 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:33:17,767 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:33:17,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:17,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:17,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:17,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:17,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:17,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 13:33:18,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:18,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 13:33:18,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:33:18,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:33:18,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:33:18,048 INFO L87 Difference]: Start difference. First operand 303 states and 305 transitions. Second operand 21 states. [2018-02-04 13:33:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:18,383 INFO L93 Difference]: Finished difference Result 317 states and 320 transitions. [2018-02-04 13:33:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:33:18,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-02-04 13:33:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:18,385 INFO L225 Difference]: With dead ends: 317 [2018-02-04 13:33:18,385 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 13:33:18,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 271 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:33:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 13:33:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 309. [2018-02-04 13:33:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-04 13:33:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-02-04 13:33:18,391 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 293 [2018-02-04 13:33:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:18,391 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-02-04 13:33:18,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:33:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-02-04 13:33:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-02-04 13:33:18,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:18,393 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:18,393 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 11 times [2018-02-04 13:33:18,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:18,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:18,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:18,395 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:18,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:18,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1695 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-04 13:33:18,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:18,723 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:18,731 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:33:18,833 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-02-04 13:33:18,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:18,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1624 proven. 613 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-02-04 13:33:19,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:19,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 34 [2018-02-04 13:33:19,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:33:19,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:33:19,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:33:19,132 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 34 states. [2018-02-04 13:33:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:19,721 INFO L93 Difference]: Finished difference Result 368 states and 371 transitions. [2018-02-04 13:33:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 13:33:19,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 299 [2018-02-04 13:33:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:19,723 INFO L225 Difference]: With dead ends: 368 [2018-02-04 13:33:19,723 INFO L226 Difference]: Without dead ends: 368 [2018-02-04 13:33:19,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:33:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-04 13:33:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 363. [2018-02-04 13:33:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 13:33:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 366 transitions. [2018-02-04 13:33:19,731 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 366 transitions. Word has length 299 [2018-02-04 13:33:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:19,731 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 366 transitions. [2018-02-04 13:33:19,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:33:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 366 transitions. [2018-02-04 13:33:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 13:33:19,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:19,733 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 43, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:19,733 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1483763557, now seen corresponding path program 12 times [2018-02-04 13:33:19,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:19,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:19,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:19,734 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:19,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:19,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 3357 proven. 140 refuted. 0 times theorem prover too weak. 2726 trivial. 0 not checked. [2018-02-04 13:33:20,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:20,075 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:20,080 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:33:20,180 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-04 13:33:20,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:20,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:20,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:20,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:20,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:20,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 1901 proven. 170 refuted. 0 times theorem prover too weak. 4152 trivial. 0 not checked. [2018-02-04 13:33:20,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:20,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-02-04 13:33:20,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 13:33:20,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 13:33:20,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-02-04 13:33:20,847 INFO L87 Difference]: Start difference. First operand 363 states and 366 transitions. Second operand 32 states. [2018-02-04 13:33:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:22,450 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2018-02-04 13:33:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 13:33:22,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 353 [2018-02-04 13:33:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:22,452 INFO L225 Difference]: With dead ends: 440 [2018-02-04 13:33:22,452 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 13:33:22,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 336 SyntacticMatches, 13 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1497, Invalid=6875, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 13:33:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 13:33:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2018-02-04 13:33:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 13:33:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 425 transitions. [2018-02-04 13:33:22,459 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 425 transitions. Word has length 353 [2018-02-04 13:33:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:22,459 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 425 transitions. [2018-02-04 13:33:22,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 13:33:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 425 transitions. [2018-02-04 13:33:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-02-04 13:33:22,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:22,461 INFO L351 BasicCegarLoop]: trace histogram [60, 52, 52, 51, 51, 51, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:22,461 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -983766034, now seen corresponding path program 13 times [2018-02-04 13:33:22,462 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:22,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:22,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:22,462 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:22,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:22,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-02-04 13:33:22,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:22,859 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:22,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:22,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-02-04 13:33:23,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:23,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-02-04 13:33:23,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 13:33:23,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 13:33:23,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:33:23,175 INFO L87 Difference]: Start difference. First operand 423 states and 425 transitions. Second operand 29 states. [2018-02-04 13:33:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:23,511 INFO L93 Difference]: Finished difference Result 448 states and 450 transitions. [2018-02-04 13:33:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:33:23,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 419 [2018-02-04 13:33:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:23,513 INFO L225 Difference]: With dead ends: 448 [2018-02-04 13:33:23,513 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 13:33:23,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:33:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 13:33:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 433. [2018-02-04 13:33:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-04 13:33:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 435 transitions. [2018-02-04 13:33:23,520 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 435 transitions. Word has length 419 [2018-02-04 13:33:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:23,521 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 435 transitions. [2018-02-04 13:33:23,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 13:33:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 435 transitions. [2018-02-04 13:33:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-04 13:33:23,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:23,524 INFO L351 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:23,524 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1494870518, now seen corresponding path program 14 times [2018-02-04 13:33:23,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:23,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:23,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:23,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:23,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:23,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 200 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-02-04 13:33:24,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:24,145 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:24,152 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:24,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:33:24,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:24,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:24,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:24,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:24,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:24,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 200 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-02-04 13:33:24,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:24,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-02-04 13:33:24,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 13:33:24,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 13:33:24,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:33:24,762 INFO L87 Difference]: Start difference. First operand 433 states and 435 transitions. Second operand 23 states. [2018-02-04 13:33:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:25,113 INFO L93 Difference]: Finished difference Result 441 states and 443 transitions. [2018-02-04 13:33:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:33:25,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 425 [2018-02-04 13:33:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:25,115 INFO L225 Difference]: With dead ends: 441 [2018-02-04 13:33:25,115 INFO L226 Difference]: Without dead ends: 441 [2018-02-04 13:33:25,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 398 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-02-04 13:33:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-04 13:33:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2018-02-04 13:33:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 13:33:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 437 transitions. [2018-02-04 13:33:25,122 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 437 transitions. Word has length 425 [2018-02-04 13:33:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:25,122 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 437 transitions. [2018-02-04 13:33:25,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 13:33:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 437 transitions. [2018-02-04 13:33:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-02-04 13:33:25,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:25,125 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 54, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:25,125 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2009639230, now seen corresponding path program 15 times [2018-02-04 13:33:25,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:25,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:25,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:25,126 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:25,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:25,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-02-04 13:33:25,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:25,731 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:25,737 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:33:25,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 13:33:25,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:25,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:25,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:25,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:25,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:25,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-02-04 13:33:26,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:26,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-02-04 13:33:26,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:33:26,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:33:26,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:33:26,305 INFO L87 Difference]: Start difference. First operand 435 states and 437 transitions. Second operand 17 states. [2018-02-04 13:33:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:26,526 INFO L93 Difference]: Finished difference Result 459 states and 463 transitions. [2018-02-04 13:33:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:33:26,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 431 [2018-02-04 13:33:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:26,527 INFO L225 Difference]: With dead ends: 459 [2018-02-04 13:33:26,527 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 13:33:26,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 411 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-02-04 13:33:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 13:33:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 441. [2018-02-04 13:33:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-02-04 13:33:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 444 transitions. [2018-02-04 13:33:26,531 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 444 transitions. Word has length 431 [2018-02-04 13:33:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:26,531 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 444 transitions. [2018-02-04 13:33:26,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:33:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 444 transitions. [2018-02-04 13:33:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-02-04 13:33:26,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:26,533 INFO L351 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:26,533 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash 49074822, now seen corresponding path program 16 times [2018-02-04 13:33:26,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:26,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:26,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:26,534 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:26,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:26,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3281 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 13:33:26,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:26,999 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:27,005 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:33:27,082 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:33:27,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:27,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3310 proven. 200 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-02-04 13:33:27,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:27,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 36 [2018-02-04 13:33:27,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:33:27,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:33:27,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:33:27,346 INFO L87 Difference]: Start difference. First operand 441 states and 444 transitions. Second operand 36 states. [2018-02-04 13:33:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:27,866 INFO L93 Difference]: Finished difference Result 527 states and 531 transitions. [2018-02-04 13:33:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 13:33:27,866 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 437 [2018-02-04 13:33:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:27,867 INFO L225 Difference]: With dead ends: 527 [2018-02-04 13:33:27,867 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 13:33:27,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=792, Invalid=2178, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 13:33:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 13:33:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2018-02-04 13:33:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 13:33:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 523 transitions. [2018-02-04 13:33:27,875 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 523 transitions. Word has length 437 [2018-02-04 13:33:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:27,875 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 523 transitions. [2018-02-04 13:33:27,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:33:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 523 transitions. [2018-02-04 13:33:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-04 13:33:27,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:27,879 INFO L351 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:27,879 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 17 times [2018-02-04 13:33:27,879 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:27,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:27,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:27,880 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:27,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:27,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 3599 proven. 310 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 13:33:28,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:28,561 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:28,566 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:33:28,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 13:33:28,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:28,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6365 proven. 1285 refuted. 0 times theorem prover too weak. 5949 trivial. 0 not checked. [2018-02-04 13:33:29,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:29,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 40 [2018-02-04 13:33:29,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 13:33:29,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 13:33:29,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 13:33:29,100 INFO L87 Difference]: Start difference. First operand 519 states and 523 transitions. Second operand 40 states. [2018-02-04 13:33:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:30,256 INFO L93 Difference]: Finished difference Result 539 states and 542 transitions. [2018-02-04 13:33:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 13:33:30,256 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 503 [2018-02-04 13:33:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:30,258 INFO L225 Difference]: With dead ends: 539 [2018-02-04 13:33:30,258 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 13:33:30,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=898, Invalid=4214, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 13:33:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 13:33:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 525. [2018-02-04 13:33:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-02-04 13:33:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 528 transitions. [2018-02-04 13:33:30,266 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 528 transitions. Word has length 503 [2018-02-04 13:33:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:30,266 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 528 transitions. [2018-02-04 13:33:30,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 13:33:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 528 transitions. [2018-02-04 13:33:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-02-04 13:33:30,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:30,269 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 66, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:30,269 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 18 times [2018-02-04 13:33:30,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:30,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:30,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:30,271 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:30,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:30,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 374 refuted. 0 times theorem prover too weak. 10026 trivial. 0 not checked. [2018-02-04 13:33:30,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:30,954 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:30,961 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:33:31,114 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 13:33:31,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:31,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:31,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:31,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:31,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:31,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 274 refuted. 0 times theorem prover too weak. 10126 trivial. 0 not checked. [2018-02-04 13:33:31,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:31,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-02-04 13:33:31,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:33:31,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:33:31,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:33:31,930 INFO L87 Difference]: Start difference. First operand 525 states and 528 transitions. Second operand 31 states. [2018-02-04 13:33:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:32,644 INFO L93 Difference]: Finished difference Result 627 states and 633 transitions. [2018-02-04 13:33:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 13:33:32,644 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 515 [2018-02-04 13:33:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:32,646 INFO L225 Difference]: With dead ends: 627 [2018-02-04 13:33:32,646 INFO L226 Difference]: Without dead ends: 627 [2018-02-04 13:33:32,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 482 SyntacticMatches, 19 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=790, Invalid=2402, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 13:33:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-02-04 13:33:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 603. [2018-02-04 13:33:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-02-04 13:33:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 608 transitions. [2018-02-04 13:33:32,654 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 608 transitions. Word has length 515 [2018-02-04 13:33:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:32,655 INFO L432 AbstractCegarLoop]: Abstraction has 603 states and 608 transitions. [2018-02-04 13:33:32,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:33:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 608 transitions. [2018-02-04 13:33:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-04 13:33:32,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:32,659 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 77, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:32,659 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 19 times [2018-02-04 13:33:32,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:32,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:32,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:32,660 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:32,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:32,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-02-04 13:33:33,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:33,321 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:33,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:33,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-02-04 13:33:33,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:33,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-02-04 13:33:33,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 13:33:33,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 13:33:33,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 13:33:33,732 INFO L87 Difference]: Start difference. First operand 603 states and 608 transitions. Second operand 35 states. [2018-02-04 13:33:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:34,174 INFO L93 Difference]: Finished difference Result 622 states and 626 transitions. [2018-02-04 13:33:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 13:33:34,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 593 [2018-02-04 13:33:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:34,177 INFO L225 Difference]: With dead ends: 622 [2018-02-04 13:33:34,177 INFO L226 Difference]: Without dead ends: 616 [2018-02-04 13:33:34,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 13:33:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-04 13:33:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 609. [2018-02-04 13:33:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-04 13:33:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 613 transitions. [2018-02-04 13:33:34,192 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 613 transitions. Word has length 593 [2018-02-04 13:33:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:34,192 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 613 transitions. [2018-02-04 13:33:34,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 13:33:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 613 transitions. [2018-02-04 13:33:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-02-04 13:33:34,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:34,195 INFO L351 BasicCegarLoop]: trace histogram [88, 78, 78, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:34,195 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash -46382016, now seen corresponding path program 20 times [2018-02-04 13:33:34,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:34,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:34,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:34,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:34,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:34,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5619 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-04 13:33:34,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:34,928 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:34,934 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:35,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:33:35,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:35,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5654 proven. 310 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-02-04 13:33:35,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:35,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 42 [2018-02-04 13:33:35,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:33:35,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:33:35,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 13:33:35,323 INFO L87 Difference]: Start difference. First operand 609 states and 613 transitions. Second operand 42 states. [2018-02-04 13:33:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:35,918 INFO L93 Difference]: Finished difference Result 710 states and 715 transitions. [2018-02-04 13:33:35,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 13:33:35,918 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 599 [2018-02-04 13:33:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:35,919 INFO L225 Difference]: With dead ends: 710 [2018-02-04 13:33:35,919 INFO L226 Difference]: Without dead ends: 710 [2018-02-04 13:33:35,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1094, Invalid=3066, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 13:33:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-02-04 13:33:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 699. [2018-02-04 13:33:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 13:33:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 704 transitions. [2018-02-04 13:33:35,927 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 704 transitions. Word has length 599 [2018-02-04 13:33:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:35,927 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 704 transitions. [2018-02-04 13:33:35,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:33:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 704 transitions. [2018-02-04 13:33:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-02-04 13:33:35,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:35,930 INFO L351 BasicCegarLoop]: trace histogram [100, 89, 89, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:35,930 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-02-04 13:33:35,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:35,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:35,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:35,931 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:35,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:35,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 14286 proven. 1218 refuted. 0 times theorem prover too weak. 10489 trivial. 0 not checked. [2018-02-04 13:33:36,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:36,789 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:36,793 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:33:36,915 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 13:33:36,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:36,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 10431 proven. 1192 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-02-04 13:33:37,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:37,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2018-02-04 13:33:37,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 13:33:37,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 13:33:37,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 13:33:37,445 INFO L87 Difference]: Start difference. First operand 699 states and 704 transitions. Second operand 58 states. [2018-02-04 13:33:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:38,966 INFO L93 Difference]: Finished difference Result 799 states and 803 transitions. [2018-02-04 13:33:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 13:33:38,966 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 677 [2018-02-04 13:33:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:38,967 INFO L225 Difference]: With dead ends: 799 [2018-02-04 13:33:38,967 INFO L226 Difference]: Without dead ends: 793 [2018-02-04 13:33:38,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1946, Invalid=10264, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 13:33:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-02-04 13:33:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 699. [2018-02-04 13:33:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 13:33:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 702 transitions. [2018-02-04 13:33:38,975 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 702 transitions. Word has length 677 [2018-02-04 13:33:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:38,976 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 702 transitions. [2018-02-04 13:33:38,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 13:33:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 702 transitions. [2018-02-04 13:33:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-02-04 13:33:38,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:38,981 INFO L351 BasicCegarLoop]: trace histogram [101, 90, 90, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:38,981 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash -661149279, now seen corresponding path program 22 times [2018-02-04 13:33:38,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:38,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:38,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:38,982 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:38,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:39,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6149 proven. 444 refuted. 0 times theorem prover too weak. 19954 trivial. 0 not checked. [2018-02-04 13:33:39,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:39,961 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:39,965 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:33:40,079 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:33:40,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:40,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:40,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:40,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:40,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:40,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6149 proven. 444 refuted. 0 times theorem prover too weak. 19954 trivial. 0 not checked. [2018-02-04 13:33:40,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:40,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-02-04 13:33:40,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:33:40,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:33:40,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:33:40,898 INFO L87 Difference]: Start difference. First operand 699 states and 702 transitions. Second operand 31 states. [2018-02-04 13:33:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:41,509 INFO L93 Difference]: Finished difference Result 716 states and 720 transitions. [2018-02-04 13:33:41,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 13:33:41,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 683 [2018-02-04 13:33:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:41,511 INFO L225 Difference]: With dead ends: 716 [2018-02-04 13:33:41,511 INFO L226 Difference]: Without dead ends: 716 [2018-02-04 13:33:41,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 646 SyntacticMatches, 24 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=1467, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 13:33:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-02-04 13:33:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 705. [2018-02-04 13:33:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-02-04 13:33:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 709 transitions. [2018-02-04 13:33:41,516 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 709 transitions. Word has length 683 [2018-02-04 13:33:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:41,517 INFO L432 AbstractCegarLoop]: Abstraction has 705 states and 709 transitions. [2018-02-04 13:33:41,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:33:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 709 transitions. [2018-02-04 13:33:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-02-04 13:33:41,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:41,520 INFO L351 BasicCegarLoop]: trace histogram [102, 91, 91, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:41,520 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 23 times [2018-02-04 13:33:41,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:41,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:41,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:41,520 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:41,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:41,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7115 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 13:33:42,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:42,323 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:42,328 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:33:42,629 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-02-04 13:33:42,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:42,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7153 proven. 374 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-02-04 13:33:43,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:43,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2018-02-04 13:33:43,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 13:33:43,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 13:33:43,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 13:33:43,134 INFO L87 Difference]: Start difference. First operand 705 states and 709 transitions. Second operand 45 states. [2018-02-04 13:33:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:43,821 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-02-04 13:33:43,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 13:33:43,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 689 [2018-02-04 13:33:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:43,822 INFO L225 Difference]: With dead ends: 806 [2018-02-04 13:33:43,823 INFO L226 Difference]: Without dead ends: 806 [2018-02-04 13:33:43,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1263, Invalid=3567, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 13:33:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-02-04 13:33:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-02-04 13:33:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-04 13:33:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-02-04 13:33:43,829 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-02-04 13:33:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:43,829 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-02-04 13:33:43,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 13:33:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-02-04 13:33:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-02-04 13:33:43,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:43,835 INFO L351 BasicCegarLoop]: trace histogram [115, 103, 103, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:43,835 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 24 times [2018-02-04 13:33:43,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:43,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:43,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:43,836 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:43,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:43,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 17188 proven. 2197 refuted. 0 times theorem prover too weak. 15253 trivial. 0 not checked. [2018-02-04 13:33:45,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:45,045 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:45,050 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:33:45,318 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 13:33:45,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:45,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:45,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:45,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:45,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:45,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 7646 proven. 470 refuted. 0 times theorem prover too weak. 26522 trivial. 0 not checked. [2018-02-04 13:33:46,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:46,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 51 [2018-02-04 13:33:46,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 13:33:46,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 13:33:46,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2205, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:33:46,760 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 51 states. [2018-02-04 13:33:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:48,859 INFO L93 Difference]: Finished difference Result 914 states and 919 transitions. [2018-02-04 13:33:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 13:33:48,859 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 773 [2018-02-04 13:33:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:48,861 INFO L225 Difference]: With dead ends: 914 [2018-02-04 13:33:48,861 INFO L226 Difference]: Without dead ends: 905 [2018-02-04 13:33:48,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 733 SyntacticMatches, 23 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1823, Invalid=11287, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 13:33:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-02-04 13:33:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 885. [2018-02-04 13:33:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-02-04 13:33:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 889 transitions. [2018-02-04 13:33:48,869 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 889 transitions. Word has length 773 [2018-02-04 13:33:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:48,869 INFO L432 AbstractCegarLoop]: Abstraction has 885 states and 889 transitions. [2018-02-04 13:33:48,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 13:33:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 889 transitions. [2018-02-04 13:33:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2018-02-04 13:33:48,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:48,876 INFO L351 BasicCegarLoop]: trace histogram [130, 117, 117, 116, 116, 116, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:48,876 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 593559995, now seen corresponding path program 25 times [2018-02-04 13:33:48,876 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:48,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:48,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:48,877 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:48,877 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:48,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 19928 proven. 3250 refuted. 0 times theorem prover too weak. 21349 trivial. 0 not checked. [2018-02-04 13:33:50,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:50,329 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:50,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:50,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 16915 proven. 494 refuted. 0 times theorem prover too weak. 27118 trivial. 0 not checked. [2018-02-04 13:33:50,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:50,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 57 [2018-02-04 13:33:50,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 13:33:50,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 13:33:50,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2648, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 13:33:50,969 INFO L87 Difference]: Start difference. First operand 885 states and 889 transitions. Second operand 57 states. [2018-02-04 13:33:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:52,337 INFO L93 Difference]: Finished difference Result 916 states and 920 transitions. [2018-02-04 13:33:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 13:33:52,338 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 869 [2018-02-04 13:33:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:52,339 INFO L225 Difference]: With dead ends: 916 [2018-02-04 13:33:52,339 INFO L226 Difference]: Without dead ends: 910 [2018-02-04 13:33:52,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1566, Invalid=7364, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 13:33:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-02-04 13:33:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 895. [2018-02-04 13:33:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-02-04 13:33:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 899 transitions. [2018-02-04 13:33:52,346 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 899 transitions. Word has length 869 [2018-02-04 13:33:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:52,346 INFO L432 AbstractCegarLoop]: Abstraction has 895 states and 899 transitions. [2018-02-04 13:33:52,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 13:33:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 899 transitions. [2018-02-04 13:33:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-02-04 13:33:52,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:52,350 INFO L351 BasicCegarLoop]: trace histogram [131, 118, 118, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:52,350 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -753671677, now seen corresponding path program 26 times [2018-02-04 13:33:52,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:52,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:52,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:52,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:33:52,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:52,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 13:33:53,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:53,635 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:53,640 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:33:53,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:33:53,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:53,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:53,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:53,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:53,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:53,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 13:33:54,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:54,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-02-04 13:33:54,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 13:33:54,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 13:33:54,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:33:54,821 INFO L87 Difference]: Start difference. First operand 895 states and 899 transitions. Second operand 33 states. [2018-02-04 13:33:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:55,564 INFO L93 Difference]: Finished difference Result 909 states and 913 transitions. [2018-02-04 13:33:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:33:55,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 875 [2018-02-04 13:33:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:55,566 INFO L225 Difference]: With dead ends: 909 [2018-02-04 13:33:55,566 INFO L226 Difference]: Without dead ends: 909 [2018-02-04 13:33:55,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 833 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 13:33:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-02-04 13:33:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-02-04 13:33:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-02-04 13:33:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-02-04 13:33:55,571 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-02-04 13:33:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:55,571 INFO L432 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-02-04 13:33:55,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 13:33:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-02-04 13:33:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-02-04 13:33:55,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:55,575 INFO L351 BasicCegarLoop]: trace histogram [132, 119, 119, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:55,575 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 27 times [2018-02-04 13:33:55,575 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:55,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:55,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:55,576 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:55,576 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:55,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 13:33:56,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:56,922 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:56,936 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:33:57,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-02-04 13:33:57,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:57,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:33:57,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:33:57,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:33:57,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:33:57,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:33:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-02-04 13:33:58,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:33:58,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-02-04 13:33:58,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:33:58,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:33:58,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:33:58,105 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-02-04 13:33:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:33:58,417 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-02-04 13:33:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:33:58,417 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-02-04 13:33:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:33:58,419 INFO L225 Difference]: With dead ends: 927 [2018-02-04 13:33:58,419 INFO L226 Difference]: Without dead ends: 927 [2018-02-04 13:33:58,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 851 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 13:33:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-02-04 13:33:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-02-04 13:33:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-02-04 13:33:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-02-04 13:33:58,425 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-02-04 13:33:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:33:58,425 INFO L432 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-02-04 13:33:58,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:33:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-02-04 13:33:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-02-04 13:33:58,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:33:58,430 INFO L351 BasicCegarLoop]: trace histogram [133, 120, 120, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:33:58,430 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:33:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 28 times [2018-02-04 13:33:58,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:33:58,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:33:58,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:58,431 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:33:58,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:33:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:33:58,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:33:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10851 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 13:33:59,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:33:59,730 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:33:59,741 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:33:59,839 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:33:59,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:33:59,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10895 proven. 520 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-02-04 13:34:00,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:00,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 51 [2018-02-04 13:34:00,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 13:34:00,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 13:34:00,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=1954, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:34:00,344 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 51 states. [2018-02-04 13:34:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:01,328 INFO L93 Difference]: Finished difference Result 1025 states and 1031 transitions. [2018-02-04 13:34:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 13:34:01,328 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 887 [2018-02-04 13:34:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:01,330 INFO L225 Difference]: With dead ends: 1025 [2018-02-04 13:34:01,330 INFO L226 Difference]: Without dead ends: 1025 [2018-02-04 13:34:01,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1637, Invalid=4683, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 13:34:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-02-04 13:34:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1011. [2018-02-04 13:34:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-02-04 13:34:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1017 transitions. [2018-02-04 13:34:01,337 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1017 transitions. Word has length 887 [2018-02-04 13:34:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:01,337 INFO L432 AbstractCegarLoop]: Abstraction has 1011 states and 1017 transitions. [2018-02-04 13:34:01,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 13:34:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1017 transitions. [2018-02-04 13:34:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-02-04 13:34:01,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:01,344 INFO L351 BasicCegarLoop]: trace histogram [148, 134, 134, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:01,344 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:01,345 INFO L82 PathProgramCache]: Analyzing trace with hash 951248836, now seen corresponding path program 29 times [2018-02-04 13:34:01,345 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:01,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:01,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:01,345 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:01,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:01,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 24474 proven. 4377 refuted. 0 times theorem prover too weak. 29263 trivial. 0 not checked. [2018-02-04 13:34:03,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:03,080 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:03,099 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:34:03,574 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 13:34:03,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:03,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 21295 proven. 2980 refuted. 0 times theorem prover too weak. 33839 trivial. 0 not checked. [2018-02-04 13:34:04,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:04,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 63 [2018-02-04 13:34:04,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 13:34:04,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 13:34:04,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=3293, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 13:34:04,226 INFO L87 Difference]: Start difference. First operand 1011 states and 1017 transitions. Second operand 63 states. [2018-02-04 13:34:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:05,621 INFO L93 Difference]: Finished difference Result 1028 states and 1032 transitions. [2018-02-04 13:34:05,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 13:34:05,621 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 983 [2018-02-04 13:34:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:05,623 INFO L225 Difference]: With dead ends: 1028 [2018-02-04 13:34:05,623 INFO L226 Difference]: Without dead ends: 1022 [2018-02-04 13:34:05,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2021, Invalid=9109, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 13:34:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-02-04 13:34:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1011. [2018-02-04 13:34:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-02-04 13:34:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1015 transitions. [2018-02-04 13:34:05,629 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1015 transitions. Word has length 983 [2018-02-04 13:34:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:05,629 INFO L432 AbstractCegarLoop]: Abstraction has 1011 states and 1015 transitions. [2018-02-04 13:34:05,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 13:34:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1015 transitions. [2018-02-04 13:34:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-02-04 13:34:05,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:05,634 INFO L351 BasicCegarLoop]: trace histogram [149, 135, 135, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:05,634 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 30 times [2018-02-04 13:34:05,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:05,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:05,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:05,635 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:05,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:05,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 690 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-04 13:34:07,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:07,238 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:07,243 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:34:07,635 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-02-04 13:34:07,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:07,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:07,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:34:07,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:34:07,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:34:07,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:34:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 20276 proven. 2074 refuted. 0 times theorem prover too weak. 36594 trivial. 0 not checked. [2018-02-04 13:34:09,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:09,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 41 [2018-02-04 13:34:09,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:34:09,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:34:09,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 13:34:09,269 INFO L87 Difference]: Start difference. First operand 1011 states and 1015 transitions. Second operand 42 states. [2018-02-04 13:34:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:11,325 INFO L93 Difference]: Finished difference Result 1142 states and 1150 transitions. [2018-02-04 13:34:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-04 13:34:11,325 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 989 [2018-02-04 13:34:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:11,328 INFO L225 Difference]: With dead ends: 1142 [2018-02-04 13:34:11,328 INFO L226 Difference]: Without dead ends: 1142 [2018-02-04 13:34:11,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 940 SyntacticMatches, 29 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2744, Invalid=9246, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 13:34:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-02-04 13:34:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1128. [2018-02-04 13:34:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-02-04 13:34:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1136 transitions. [2018-02-04 13:34:11,334 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1136 transitions. Word has length 989 [2018-02-04 13:34:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:11,335 INFO L432 AbstractCegarLoop]: Abstraction has 1128 states and 1136 transitions. [2018-02-04 13:34:11,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:34:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1136 transitions. [2018-02-04 13:34:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2018-02-04 13:34:11,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:11,341 INFO L351 BasicCegarLoop]: trace histogram [166, 151, 151, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:11,341 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 890947789, now seen corresponding path program 31 times [2018-02-04 13:34:11,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:11,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:11,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:11,342 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:11,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:11,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 28930 proven. 5578 refuted. 0 times theorem prover too weak. 39007 trivial. 0 not checked. [2018-02-04 13:34:13,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:13,507 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:13,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:34:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:13,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 26053 proven. 660 refuted. 0 times theorem prover too weak. 46802 trivial. 0 not checked. [2018-02-04 13:34:14,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:14,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 63 [2018-02-04 13:34:14,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 13:34:14,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 13:34:14,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3232, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 13:34:14,347 INFO L87 Difference]: Start difference. First operand 1128 states and 1136 transitions. Second operand 63 states. [2018-02-04 13:34:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:15,696 INFO L93 Difference]: Finished difference Result 1143 states and 1149 transitions. [2018-02-04 13:34:15,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 13:34:15,696 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1097 [2018-02-04 13:34:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:15,698 INFO L225 Difference]: With dead ends: 1143 [2018-02-04 13:34:15,698 INFO L226 Difference]: Without dead ends: 1140 [2018-02-04 13:34:15,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1947, Invalid=8973, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 13:34:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-02-04 13:34:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1125. [2018-02-04 13:34:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-02-04 13:34:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1130 transitions. [2018-02-04 13:34:15,705 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1130 transitions. Word has length 1097 [2018-02-04 13:34:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:15,705 INFO L432 AbstractCegarLoop]: Abstraction has 1125 states and 1130 transitions. [2018-02-04 13:34:15,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 13:34:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1130 transitions. [2018-02-04 13:34:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-02-04 13:34:15,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:15,712 INFO L351 BasicCegarLoop]: trace histogram [167, 152, 152, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:15,712 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash -80485483, now seen corresponding path program 32 times [2018-02-04 13:34:15,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:15,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:15,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:15,713 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:34:15,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:15,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 784 refuted. 0 times theorem prover too weak. 59640 trivial. 0 not checked. [2018-02-04 13:34:17,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:17,770 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:17,775 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:34:17,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:34:17,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:17,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:17,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:34:17,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:34:17,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:34:17,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:34:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 722 refuted. 0 times theorem prover too weak. 59702 trivial. 0 not checked. [2018-02-04 13:34:19,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:19,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2018-02-04 13:34:19,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 13:34:19,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 13:34:19,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 13:34:19,791 INFO L87 Difference]: Start difference. First operand 1125 states and 1130 transitions. Second operand 41 states. [2018-02-04 13:34:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:20,829 INFO L93 Difference]: Finished difference Result 1275 states and 1284 transitions. [2018-02-04 13:34:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 13:34:20,829 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1103 [2018-02-04 13:34:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:20,832 INFO L225 Difference]: With dead ends: 1275 [2018-02-04 13:34:20,832 INFO L226 Difference]: Without dead ends: 1275 [2018-02-04 13:34:20,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1053 SyntacticMatches, 31 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1400, Invalid=4606, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 13:34:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-02-04 13:34:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1239. [2018-02-04 13:34:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-02-04 13:34:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1246 transitions. [2018-02-04 13:34:20,840 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1246 transitions. Word has length 1103 [2018-02-04 13:34:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:20,840 INFO L432 AbstractCegarLoop]: Abstraction has 1239 states and 1246 transitions. [2018-02-04 13:34:20,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 13:34:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1246 transitions. [2018-02-04 13:34:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-02-04 13:34:20,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:20,848 INFO L351 BasicCegarLoop]: trace histogram [185, 169, 169, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:20,848 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 33 times [2018-02-04 13:34:20,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:20,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:20,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:20,849 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:20,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:20,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 33976 proven. 6853 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-02-04 13:34:23,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:23,581 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:23,586 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:34:23,876 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-02-04 13:34:23,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:23,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 29661 proven. 2452 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-02-04 13:34:24,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:24,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 78 [2018-02-04 13:34:24,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 13:34:24,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 13:34:24,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5181, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 13:34:24,951 INFO L87 Difference]: Start difference. First operand 1239 states and 1246 transitions. Second operand 78 states. [2018-02-04 13:34:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:27,012 INFO L93 Difference]: Finished difference Result 1394 states and 1400 transitions. [2018-02-04 13:34:27,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 13:34:27,012 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1217 [2018-02-04 13:34:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:27,015 INFO L225 Difference]: With dead ends: 1394 [2018-02-04 13:34:27,015 INFO L226 Difference]: Without dead ends: 1385 [2018-02-04 13:34:27,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3510, Invalid=20670, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 13:34:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-02-04 13:34:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1368. [2018-02-04 13:34:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-02-04 13:34:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1374 transitions. [2018-02-04 13:34:27,030 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1374 transitions. Word has length 1217 [2018-02-04 13:34:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:27,031 INFO L432 AbstractCegarLoop]: Abstraction has 1368 states and 1374 transitions. [2018-02-04 13:34:27,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 13:34:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1374 transitions. [2018-02-04 13:34:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-02-04 13:34:27,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:27,043 INFO L351 BasicCegarLoop]: trace histogram [186, 170, 170, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:27,043 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 34 times [2018-02-04 13:34:27,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:27,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:27,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:27,044 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:27,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:27,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-02-04 13:34:29,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:29,572 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:29,577 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:34:29,829 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:34:29,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:29,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:29,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:34:29,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:34:29,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:34:29,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:34:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-02-04 13:34:31,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:31,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2018-02-04 13:34:31,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 13:34:31,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 13:34:31,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1198, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 13:34:31,677 INFO L87 Difference]: Start difference. First operand 1368 states and 1374 transitions. Second operand 41 states. [2018-02-04 13:34:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:32,430 INFO L93 Difference]: Finished difference Result 1401 states and 1409 transitions. [2018-02-04 13:34:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:34:32,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1223 [2018-02-04 13:34:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:32,433 INFO L225 Difference]: With dead ends: 1401 [2018-02-04 13:34:32,433 INFO L226 Difference]: Without dead ends: 1401 [2018-02-04 13:34:32,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1171 SyntacticMatches, 34 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=2702, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 13:34:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-02-04 13:34:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1374. [2018-02-04 13:34:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-02-04 13:34:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1381 transitions. [2018-02-04 13:34:32,441 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1381 transitions. Word has length 1223 [2018-02-04 13:34:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:32,441 INFO L432 AbstractCegarLoop]: Abstraction has 1374 states and 1381 transitions. [2018-02-04 13:34:32,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 13:34:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1381 transitions. [2018-02-04 13:34:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-02-04 13:34:32,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:32,448 INFO L351 BasicCegarLoop]: trace histogram [187, 171, 171, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:32,448 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 35 times [2018-02-04 13:34:32,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:32,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:32,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:32,449 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:32,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:32,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18585 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-02-04 13:34:35,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:35,116 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:35,121 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:34:35,925 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-02-04 13:34:35,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:35,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18471 proven. 4116 refuted. 0 times theorem prover too weak. 71275 trivial. 0 not checked. [2018-02-04 13:34:36,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:36,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 44] total 64 [2018-02-04 13:34:36,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 13:34:36,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 13:34:36,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3213, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 13:34:36,796 INFO L87 Difference]: Start difference. First operand 1374 states and 1381 transitions. Second operand 64 states. [2018-02-04 13:34:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:38,026 INFO L93 Difference]: Finished difference Result 1517 states and 1525 transitions. [2018-02-04 13:34:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 13:34:38,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1229 [2018-02-04 13:34:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:38,030 INFO L225 Difference]: With dead ends: 1517 [2018-02-04 13:34:38,030 INFO L226 Difference]: Without dead ends: 1517 [2018-02-04 13:34:38,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2228, Invalid=8074, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 13:34:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-02-04 13:34:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1500. [2018-02-04 13:34:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2018-02-04 13:34:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1508 transitions. [2018-02-04 13:34:38,038 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1508 transitions. Word has length 1229 [2018-02-04 13:34:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:38,039 INFO L432 AbstractCegarLoop]: Abstraction has 1500 states and 1508 transitions. [2018-02-04 13:34:38,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 13:34:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1508 transitions. [2018-02-04 13:34:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2018-02-04 13:34:38,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:38,052 INFO L351 BasicCegarLoop]: trace histogram [205, 188, 188, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:38,052 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -710434185, now seen corresponding path program 36 times [2018-02-04 13:34:38,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:38,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:38,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:38,053 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:38,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:38,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 39648 proven. 8202 refuted. 0 times theorem prover too weak. 65353 trivial. 0 not checked. [2018-02-04 13:34:41,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:41,441 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:41,446 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:34:42,567 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-02-04 13:34:42,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:34:42,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:42,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:34:42,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:34:42,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:34:42,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:34:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 34131 proven. 2862 refuted. 0 times theorem prover too weak. 76210 trivial. 0 not checked. [2018-02-04 13:34:45,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:45,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 69 [2018-02-04 13:34:45,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 13:34:45,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 13:34:45,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=4117, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 13:34:45,595 INFO L87 Difference]: Start difference. First operand 1500 states and 1508 transitions. Second operand 69 states. [2018-02-04 13:34:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:49,518 INFO L93 Difference]: Finished difference Result 1651 states and 1658 transitions. [2018-02-04 13:34:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-02-04 13:34:49,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1343 [2018-02-04 13:34:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:49,521 INFO L225 Difference]: With dead ends: 1651 [2018-02-04 13:34:49,521 INFO L226 Difference]: Without dead ends: 1633 [2018-02-04 13:34:49,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1285 SyntacticMatches, 33 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12860 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4499, Invalid=29173, Unknown=0, NotChecked=0, Total=33672 [2018-02-04 13:34:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-02-04 13:34:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1614. [2018-02-04 13:34:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2018-02-04 13:34:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1620 transitions. [2018-02-04 13:34:49,531 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1620 transitions. Word has length 1343 [2018-02-04 13:34:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:49,531 INFO L432 AbstractCegarLoop]: Abstraction has 1614 states and 1620 transitions. [2018-02-04 13:34:49,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 13:34:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1620 transitions. [2018-02-04 13:34:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1470 [2018-02-04 13:34:49,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:49,554 INFO L351 BasicCegarLoop]: trace histogram [225, 207, 207, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:49,554 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1705644624, now seen corresponding path program 37 times [2018-02-04 13:34:49,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:49,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:49,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:49,556 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:34:49,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:49,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:34:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 44818 proven. 9625 refuted. 0 times theorem prover too weak. 82449 trivial. 0 not checked. [2018-02-04 13:34:53,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:34:53,728 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:34:53,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:34:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:53,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:34:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 42145 proven. 954 refuted. 0 times theorem prover too weak. 93793 trivial. 0 not checked. [2018-02-04 13:34:54,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:34:54,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 72 [2018-02-04 13:34:54,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 13:34:54,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 13:34:54,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=4213, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 13:34:54,926 INFO L87 Difference]: Start difference. First operand 1614 states and 1620 transitions. Second operand 72 states. [2018-02-04 13:34:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:34:56,499 INFO L93 Difference]: Finished difference Result 1648 states and 1654 transitions. [2018-02-04 13:34:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 13:34:56,499 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1469 [2018-02-04 13:34:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:34:56,501 INFO L225 Difference]: With dead ends: 1648 [2018-02-04 13:34:56,502 INFO L226 Difference]: Without dead ends: 1642 [2018-02-04 13:34:56,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1562 GetRequests, 1444 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4637 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2601, Invalid=11679, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 13:34:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2018-02-04 13:34:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1624. [2018-02-04 13:34:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2018-02-04 13:34:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1630 transitions. [2018-02-04 13:34:56,510 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1630 transitions. Word has length 1469 [2018-02-04 13:34:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:34:56,510 INFO L432 AbstractCegarLoop]: Abstraction has 1624 states and 1630 transitions. [2018-02-04 13:34:56,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 13:34:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1630 transitions. [2018-02-04 13:34:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2018-02-04 13:34:56,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:34:56,519 INFO L351 BasicCegarLoop]: trace histogram [226, 208, 208, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:34:56,519 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:34:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1936089384, now seen corresponding path program 38 times [2018-02-04 13:34:56,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:34:56,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:34:56,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:56,520 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:34:56,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:34:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:34:56,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 13:35:00,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:00,083 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:00,088 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:35:00,291 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:35:00,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:00,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:00,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:35:00,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:35:00,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:35:00,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:35:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 13:35:02,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:02,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-02-04 13:35:02,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 13:35:02,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 13:35:02,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 13:35:02,886 INFO L87 Difference]: Start difference. First operand 1624 states and 1630 transitions. Second operand 43 states. [2018-02-04 13:35:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:03,768 INFO L93 Difference]: Finished difference Result 1641 states and 1647 transitions. [2018-02-04 13:35:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:35:03,768 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1475 [2018-02-04 13:35:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:03,771 INFO L225 Difference]: With dead ends: 1641 [2018-02-04 13:35:03,771 INFO L226 Difference]: Without dead ends: 1641 [2018-02-04 13:35:03,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 1418 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=788, Invalid=2994, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 13:35:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2018-02-04 13:35:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1626. [2018-02-04 13:35:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2018-02-04 13:35:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 1632 transitions. [2018-02-04 13:35:03,779 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 1632 transitions. Word has length 1475 [2018-02-04 13:35:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:03,780 INFO L432 AbstractCegarLoop]: Abstraction has 1626 states and 1632 transitions. [2018-02-04 13:35:03,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 13:35:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1632 transitions. [2018-02-04 13:35:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-02-04 13:35:03,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:03,789 INFO L351 BasicCegarLoop]: trace histogram [227, 209, 209, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:03,790 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1693559968, now seen corresponding path program 39 times [2018-02-04 13:35:03,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:03,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:03,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:03,791 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:03,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:03,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 13:35:07,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:07,558 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:07,564 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:35:07,896 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-02-04 13:35:07,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:07,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:07,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:35:07,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:35:07,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:35:07,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:35:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 13:35:10,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:10,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-02-04 13:35:10,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 13:35:10,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 13:35:10,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=415, Unknown=0, NotChecked=0, Total=702 [2018-02-04 13:35:10,264 INFO L87 Difference]: Start difference. First operand 1626 states and 1632 transitions. Second operand 27 states. [2018-02-04 13:35:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:10,708 INFO L93 Difference]: Finished difference Result 1659 states and 1667 transitions. [2018-02-04 13:35:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:35:10,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1481 [2018-02-04 13:35:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:10,712 INFO L225 Difference]: With dead ends: 1659 [2018-02-04 13:35:10,712 INFO L226 Difference]: Without dead ends: 1659 [2018-02-04 13:35:10,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1524 GetRequests, 1441 SyntacticMatches, 38 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=788, Invalid=1374, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 13:35:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-02-04 13:35:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1632. [2018-02-04 13:35:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2018-02-04 13:35:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1639 transitions. [2018-02-04 13:35:10,720 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1639 transitions. Word has length 1481 [2018-02-04 13:35:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:10,721 INFO L432 AbstractCegarLoop]: Abstraction has 1632 states and 1639 transitions. [2018-02-04 13:35:10,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 13:35:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1639 transitions. [2018-02-04 13:35:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-02-04 13:35:10,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:10,730 INFO L351 BasicCegarLoop]: trace histogram [228, 210, 210, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:10,730 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 40 times [2018-02-04 13:35:10,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:10,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:10,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:10,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:10,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:10,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25371 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 13:35:14,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:14,897 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:14,903 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:35:15,074 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:35:15,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:15,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25430 proven. 990 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-02-04 13:35:16,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:16,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 66 [2018-02-04 13:35:16,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 13:35:16,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 13:35:16,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=3299, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 13:35:16,127 INFO L87 Difference]: Start difference. First operand 1632 states and 1639 transitions. Second operand 66 states. [2018-02-04 13:35:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:17,276 INFO L93 Difference]: Finished difference Result 1787 states and 1795 transitions. [2018-02-04 13:35:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 13:35:17,277 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1487 [2018-02-04 13:35:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:17,280 INFO L225 Difference]: With dead ends: 1787 [2018-02-04 13:35:17,280 INFO L226 Difference]: Without dead ends: 1787 [2018-02-04 13:35:17,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1569 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2782, Invalid=8138, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 13:35:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-02-04 13:35:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1770. [2018-02-04 13:35:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2018-02-04 13:35:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 1778 transitions. [2018-02-04 13:35:17,289 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 1778 transitions. Word has length 1487 [2018-02-04 13:35:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:17,290 INFO L432 AbstractCegarLoop]: Abstraction has 1770 states and 1778 transitions. [2018-02-04 13:35:17,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 13:35:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 1778 transitions. [2018-02-04 13:35:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1614 [2018-02-04 13:35:17,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:17,301 INFO L351 BasicCegarLoop]: trace histogram [248, 229, 229, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:17,301 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 158683713, now seen corresponding path program 41 times [2018-02-04 13:35:17,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:17,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:17,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:17,302 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:17,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:17,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 68630 proven. 3474 refuted. 0 times theorem prover too weak. 94925 trivial. 0 not checked. [2018-02-04 13:35:22,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:22,497 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:22,503 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:35:23,861 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 13:35:23,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:23,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 50068 proven. 6466 refuted. 0 times theorem prover too weak. 110495 trivial. 0 not checked. [2018-02-04 13:35:25,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:25,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 86 [2018-02-04 13:35:25,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 13:35:25,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 13:35:25,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=6204, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 13:35:25,267 INFO L87 Difference]: Start difference. First operand 1770 states and 1778 transitions. Second operand 86 states. [2018-02-04 13:35:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:27,618 INFO L93 Difference]: Finished difference Result 1790 states and 1796 transitions. [2018-02-04 13:35:27,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 13:35:27,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1613 [2018-02-04 13:35:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:27,621 INFO L225 Difference]: With dead ends: 1790 [2018-02-04 13:35:27,621 INFO L226 Difference]: Without dead ends: 1784 [2018-02-04 13:35:27,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6971 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3628, Invalid=18128, Unknown=0, NotChecked=0, Total=21756 [2018-02-04 13:35:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-02-04 13:35:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1770. [2018-02-04 13:35:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2018-02-04 13:35:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 1776 transitions. [2018-02-04 13:35:27,630 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 1776 transitions. Word has length 1613 [2018-02-04 13:35:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:27,631 INFO L432 AbstractCegarLoop]: Abstraction has 1770 states and 1776 transitions. [2018-02-04 13:35:27,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 13:35:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 1776 transitions. [2018-02-04 13:35:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-02-04 13:35:27,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:27,643 INFO L351 BasicCegarLoop]: trace histogram [249, 230, 230, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:27,643 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2037889527, now seen corresponding path program 42 times [2018-02-04 13:35:27,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:27,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:27,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:27,644 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:27,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:27,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-02-04 13:35:32,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:32,128 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:32,133 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:35:33,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-02-04 13:35:33,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:33,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:33,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:35:33,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:35:33,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:35:33,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:35:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-02-04 13:35:36,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:36,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2018-02-04 13:35:36,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 13:35:36,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 13:35:36,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=445, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:35:36,005 INFO L87 Difference]: Start difference. First operand 1770 states and 1776 transitions. Second operand 28 states. [2018-02-04 13:35:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:36,448 INFO L93 Difference]: Finished difference Result 1793 states and 1800 transitions. [2018-02-04 13:35:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:35:36,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1619 [2018-02-04 13:35:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:36,451 INFO L225 Difference]: With dead ends: 1793 [2018-02-04 13:35:36,451 INFO L226 Difference]: Without dead ends: 1793 [2018-02-04 13:35:36,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1664 GetRequests, 1577 SyntacticMatches, 40 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=858, Invalid=1494, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 13:35:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-02-04 13:35:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1776. [2018-02-04 13:35:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-02-04 13:35:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1783 transitions. [2018-02-04 13:35:36,459 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1783 transitions. Word has length 1619 [2018-02-04 13:35:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:36,460 INFO L432 AbstractCegarLoop]: Abstraction has 1776 states and 1783 transitions. [2018-02-04 13:35:36,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 13:35:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1783 transitions. [2018-02-04 13:35:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2018-02-04 13:35:36,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:36,471 INFO L351 BasicCegarLoop]: trace histogram [250, 231, 231, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:36,471 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 85486353, now seen corresponding path program 43 times [2018-02-04 13:35:36,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:36,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:36,472 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:36,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29307 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 13:35:41,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:41,383 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:41,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:35:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:41,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29369 proven. 1102 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-02-04 13:35:42,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:42,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 69 [2018-02-04 13:35:42,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 13:35:42,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 13:35:42,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=3610, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 13:35:42,823 INFO L87 Difference]: Start difference. First operand 1776 states and 1783 transitions. Second operand 69 states. [2018-02-04 13:35:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:43,990 INFO L93 Difference]: Finished difference Result 1931 states and 1939 transitions. [2018-02-04 13:35:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 13:35:43,990 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1625 [2018-02-04 13:35:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:43,993 INFO L225 Difference]: With dead ends: 1931 [2018-02-04 13:35:43,993 INFO L226 Difference]: Without dead ends: 1931 [2018-02-04 13:35:43,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1711 GetRequests, 1603 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3047, Invalid=8943, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 13:35:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-02-04 13:35:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1914. [2018-02-04 13:35:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2018-02-04 13:35:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 1922 transitions. [2018-02-04 13:35:44,005 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 1922 transitions. Word has length 1625 [2018-02-04 13:35:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:44,006 INFO L432 AbstractCegarLoop]: Abstraction has 1914 states and 1922 transitions. [2018-02-04 13:35:44,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 13:35:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 1922 transitions. [2018-02-04 13:35:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-02-04 13:35:44,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:44,020 INFO L351 BasicCegarLoop]: trace histogram [271, 251, 251, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:44,020 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 44 times [2018-02-04 13:35:44,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:44,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:44,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:44,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:35:44,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:44,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 76348 proven. 6069 refuted. 0 times theorem prover too weak. 117753 trivial. 0 not checked. [2018-02-04 13:35:50,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:50,420 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:50,426 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:35:50,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:35:50,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:35:50,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:35:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 58243 proven. 1180 refuted. 0 times theorem prover too weak. 140747 trivial. 0 not checked. [2018-02-04 13:35:52,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:35:52,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44] total 86 [2018-02-04 13:35:52,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 13:35:52,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 13:35:52,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=6109, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 13:35:52,246 INFO L87 Difference]: Start difference. First operand 1914 states and 1922 transitions. Second operand 86 states. [2018-02-04 13:35:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:35:54,603 INFO L93 Difference]: Finished difference Result 1934 states and 1940 transitions. [2018-02-04 13:35:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 13:35:54,604 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1757 [2018-02-04 13:35:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:35:54,606 INFO L225 Difference]: With dead ends: 1934 [2018-02-04 13:35:54,606 INFO L226 Difference]: Without dead ends: 1928 [2018-02-04 13:35:54,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1865 GetRequests, 1721 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3432, Invalid=17738, Unknown=0, NotChecked=0, Total=21170 [2018-02-04 13:35:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-02-04 13:35:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1914. [2018-02-04 13:35:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2018-02-04 13:35:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 1920 transitions. [2018-02-04 13:35:54,616 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 1920 transitions. Word has length 1757 [2018-02-04 13:35:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:35:54,616 INFO L432 AbstractCegarLoop]: Abstraction has 1914 states and 1920 transitions. [2018-02-04 13:35:54,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 13:35:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 1920 transitions. [2018-02-04 13:35:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-02-04 13:35:54,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:35:54,629 INFO L351 BasicCegarLoop]: trace histogram [272, 252, 252, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:35:54,629 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:35:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash -840334726, now seen corresponding path program 45 times [2018-02-04 13:35:54,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:35:54,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:35:54,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:54,630 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:35:54,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:35:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:35:54,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:35:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-02-04 13:35:59,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:35:59,925 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:35:59,931 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:36:00,423 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 13:36:00,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:36:00,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:00,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:36:00,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:36:00,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:36:00,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:36:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-02-04 13:36:03,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:36:03,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 28 [2018-02-04 13:36:03,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 13:36:03,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 13:36:03,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=476, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:36:03,681 INFO L87 Difference]: Start difference. First operand 1914 states and 1920 transitions. Second operand 29 states. [2018-02-04 13:36:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:04,173 INFO L93 Difference]: Finished difference Result 1937 states and 1944 transitions. [2018-02-04 13:36:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:36:04,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1763 [2018-02-04 13:36:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:04,176 INFO L225 Difference]: With dead ends: 1937 [2018-02-04 13:36:04,176 INFO L226 Difference]: Without dead ends: 1937 [2018-02-04 13:36:04,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1810 GetRequests, 1719 SyntacticMatches, 42 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=931, Invalid=1619, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 13:36:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-02-04 13:36:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1920. [2018-02-04 13:36:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-02-04 13:36:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 1927 transitions. [2018-02-04 13:36:04,185 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 1927 transitions. Word has length 1763 [2018-02-04 13:36:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:04,186 INFO L432 AbstractCegarLoop]: Abstraction has 1920 states and 1927 transitions. [2018-02-04 13:36:04,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 13:36:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 1927 transitions. [2018-02-04 13:36:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1770 [2018-02-04 13:36:04,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:04,198 INFO L351 BasicCegarLoop]: trace histogram [273, 253, 253, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:04,198 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 13:36:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash -818098494, now seen corresponding path program 46 times [2018-02-04 13:36:04,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:04,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:04,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:04,199 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:36:04,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:04,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 13:36:08,662 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 13:36:08,665 INFO L168 Benchmark]: Toolchain (without parser) took 181027.22 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 361.8 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 13:36:08,665 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:36:08,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.27 ms. Allocated memory is still 403.7 MB. Free memory was 361.8 MB in the beginning and 353.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:08,666 INFO L168 Benchmark]: Boogie Preprocessor took 20.36 ms. Allocated memory is still 403.7 MB. Free memory was 353.8 MB in the beginning and 351.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:08,666 INFO L168 Benchmark]: RCFGBuilder took 188.97 ms. Allocated memory is still 403.7 MB. Free memory was 351.2 MB in the beginning and 335.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:08,666 INFO L168 Benchmark]: TraceAbstraction took 180662.87 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.3 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-04 13:36:08,667 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.27 ms. Allocated memory is still 403.7 MB. Free memory was 361.8 MB in the beginning and 353.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.36 ms. Allocated memory is still 403.7 MB. Free memory was 353.8 MB in the beginning and 351.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 188.97 ms. Allocated memory is still 403.7 MB. Free memory was 351.2 MB in the beginning and 335.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180662.87 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.3 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-36-08-671.csv Completed graceful shutdown