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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:49:01,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:49:01,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:49:01,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:49:01,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:49:01,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:49:01,205 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:49:01,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:49:01,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:49:01,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:49:01,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:49:01,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:49:01,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:49:01,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:49:01,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:49:01,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:49:01,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:49:01,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:49:01,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:49:01,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:49:01,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:49:01,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:49:01,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:49:01,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:49:01,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:49:01,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:49:01,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:49:01,223 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:49:01,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:49:01,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:49:01,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:49:01,224 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:49:01,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:49:01,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:49:01,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:49:01,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:49:01,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:49:01,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:49:01,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:49:01,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:49:01,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:49:01,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:49:01,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:49:01,237 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:49:01,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:49:01,237 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:49:01,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:49:01,277 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:49:01,280 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:49:01,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:49:01,282 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:49:01,282 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 18:49:01,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:49:01,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:49:01,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:49:01,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:49:01,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:49:01,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,384 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 06:49:01, skipping insertion in model container [2018-02-04 18:49:01,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,393 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:49:01,402 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:49:01,480 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:49:01,492 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:49:01,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01 WrapperNode [2018-02-04 18:49:01,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:49:01,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:49:01,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:49:01,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:49:01,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (1/1) ... [2018-02-04 18:49:01,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:49:01,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:49:01,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:49:01,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:49:01,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (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 18:49:01,561 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:49:01,561 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:49:01,561 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 18:49:01,561 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:49:01,561 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:49:01,561 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:49:01,561 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:49:01,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:49:01,675 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:49:01,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:49:01 BoogieIcfgContainer [2018-02-04 18:49:01,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:49:01,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:49:01,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:49:01,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:49:01,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:49:01" (1/3) ... [2018-02-04 18:49:01,678 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 06:49:01, skipping insertion in model container [2018-02-04 18:49:01,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:49:01" (2/3) ... [2018-02-04 18:49:01,679 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 06:49:01, skipping insertion in model container [2018-02-04 18:49:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:49:01" (3/3) ... [2018-02-04 18:49:01,680 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-04 18:49:01,685 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:49:01,689 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 18:49:01,719 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:49:01,719 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:49:01,719 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:49:01,720 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:49:01,720 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:49:01,720 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:49:01,720 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:49:01,720 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:49:01,721 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:49:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 18:49:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:49:01,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:01,743 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:01,743 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 18:49:01,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:01,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:01,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:01,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:01,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:01,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:01,891 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 18:49:01,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:01,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:49:01,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:49:01,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:49:01,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:49:01,909 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 18:49:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:01,973 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 18:49:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:49:01,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 18:49:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:01,980 INFO L225 Difference]: With dead ends: 63 [2018-02-04 18:49:01,980 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 18:49:01,982 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 18:49:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 18:49:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 18:49:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 18:49:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 18:49:02,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 18:49:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:02,048 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 18:49:02,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:49:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 18:49:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:49:02,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:02,049 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:02,049 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 18:49:02,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:02,049 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:02,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:02,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:02,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:02,195 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 18:49:02,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:02,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:49:02,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:49:02,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:49:02,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:49:02,198 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-04 18:49:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:02,401 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 18:49:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:49:02,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 18:49:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:02,403 INFO L225 Difference]: With dead ends: 91 [2018-02-04 18:49:02,403 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 18:49:02,404 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 18:49:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 18:49:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-02-04 18:49:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 18:49:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-02-04 18:49:02,411 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-02-04 18:49:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:02,412 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-02-04 18:49:02,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:49:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-02-04 18:49:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:49:02,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:02,413 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 18:49:02,413 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 18:49:02,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:02,413 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:02,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:02,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:02,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:02,536 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 18:49:02,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:02,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:49:02,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:49:02,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:49:02,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:49:02,537 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 8 states. [2018-02-04 18:49:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:02,690 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 18:49:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:49:02,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 18:49:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:02,692 INFO L225 Difference]: With dead ends: 75 [2018-02-04 18:49:02,692 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 18:49:02,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:49:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 18:49:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 18:49:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 18:49:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 18:49:02,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-02-04 18:49:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:02,698 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 18:49:02,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:49:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 18:49:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:49:02,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:02,699 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 18:49:02,699 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 18:49:02,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:02,700 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:02,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:02,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:02,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:02,733 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 18:49:02,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:02,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:49:02,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:02,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:02,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:02,734 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-02-04 18:49:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:02,782 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 18:49:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:49:02,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 18:49:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:02,788 INFO L225 Difference]: With dead ends: 65 [2018-02-04 18:49:02,788 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 18:49:02,788 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 18:49:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 18:49:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 18:49:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 18:49:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-04 18:49:02,793 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-02-04 18:49:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:02,794 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-04 18:49:02,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-04 18:49:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 18:49:02,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:02,795 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 18:49:02,795 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 18:49:02,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:02,795 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:02,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,796 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:02,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:02,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:02,914 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 18:49:02,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:02,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:02,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:02,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:02,951 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 18:49:02,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:02,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-04 18:49:02,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:49:02,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:49:02,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:49:02,952 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-02-04 18:49:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:03,131 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 18:49:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:49:03,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 18:49:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:03,133 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:49:03,133 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:49:03,133 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 18:49:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:49:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-02-04 18:49:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 18:49:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 18:49:03,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-02-04 18:49:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:03,139 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 18:49:03,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:49:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 18:49:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 18:49:03,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:03,140 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 18:49:03,140 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-02-04 18:49:03,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:03,140 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:03,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:03,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:03,178 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 18:49:03,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:03,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:49:03,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:03,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:03,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:03,179 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-02-04 18:49:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:03,215 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 18:49:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:49:03,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 18:49:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:03,217 INFO L225 Difference]: With dead ends: 85 [2018-02-04 18:49:03,217 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 18:49:03,217 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 18:49:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 18:49:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-04 18:49:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 18:49:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 18:49:03,222 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-02-04 18:49:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:03,223 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 18:49:03,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 18:49:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 18:49:03,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:03,224 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 18:49:03,224 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 18:49:03,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:03,224 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:03,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:03,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:03,261 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 18:49:03,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:03,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:03,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:03,287 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 18:49:03,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:03,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 18:49:03,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:49:03,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:49:03,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:49:03,289 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 5 states. [2018-02-04 18:49:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:03,323 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-04 18:49:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:49:03,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 18:49:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:03,325 INFO L225 Difference]: With dead ends: 99 [2018-02-04 18:49:03,325 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 18:49:03,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 18:49:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 18:49:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2018-02-04 18:49:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 18:49:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 18:49:03,330 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2018-02-04 18:49:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:03,330 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 18:49:03,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:49:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 18:49:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 18:49:03,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:03,331 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-02-04 18:49:03,331 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-02-04 18:49:03,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:03,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:03,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:03,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:49:03,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:03,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:03,418 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:03,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 18:49:03,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:03,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:03,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:49:03,472 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 18:49:03,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:03,474 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 18:49:03,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:49:03,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:49:03,496 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 18:49:03,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:03,497 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 18:49:03,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 18:49:03,520 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 18:49:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 18:49:03,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:49:03,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-02-04 18:49:03,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:49:03,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:49:03,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-02-04 18:49:03,531 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 10 states. [2018-02-04 18:49:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:03,699 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-04 18:49:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:49:03,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-02-04 18:49:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:03,699 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:49:03,699 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 18:49:03,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=206, Unknown=1, NotChecked=30, Total=306 [2018-02-04 18:49:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 18:49:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-02-04 18:49:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 18:49:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 18:49:03,703 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-02-04 18:49:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:03,703 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 18:49:03,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:49:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 18:49:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 18:49:03,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:03,704 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 18:49:03,704 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-02-04 18:49:03,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:03,705 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:03,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,705 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:03,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:03,836 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 18:49:03,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:03,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:03,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:03,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:03,918 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 18:49:03,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:03,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-02-04 18:49:03,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:49:03,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:49:03,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:49:03,920 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 16 states. [2018-02-04 18:49:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:04,239 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 18:49:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:49:04,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-04 18:49:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:04,240 INFO L225 Difference]: With dead ends: 133 [2018-02-04 18:49:04,240 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 18:49:04,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-02-04 18:49:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 18:49:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2018-02-04 18:49:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:49:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-02-04 18:49:04,244 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 59 [2018-02-04 18:49:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:04,245 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-02-04 18:49:04,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:49:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-02-04 18:49:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 18:49:04,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:04,246 INFO L351 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:04,246 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash -480231808, now seen corresponding path program 2 times [2018-02-04 18:49:04,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:04,246 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:04,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:04,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:04,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 18:49:04,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:49:04,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:49:04,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:49:04,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:49:04,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:49:04,307 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2018-02-04 18:49:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:04,341 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-04 18:49:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:49:04,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-02-04 18:49:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:04,344 INFO L225 Difference]: With dead ends: 111 [2018-02-04 18:49:04,344 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:49:04,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:49:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:49:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 18:49:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 18:49:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-04 18:49:04,348 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 77 [2018-02-04 18:49:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:04,349 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-04 18:49:04,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:49:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-04 18:49:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 18:49:04,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:04,350 INFO L351 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:04,350 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash 49530632, now seen corresponding path program 3 times [2018-02-04 18:49:04,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:04,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:04,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,351 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:04,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:04,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 18:49:04,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:04,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:04,414 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:04,430 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 18:49:04,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:04,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:04,437 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 18:49:04,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:04,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:04,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 106 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 18:49:04,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:04,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-02-04 18:49:04,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:49:04,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:49:04,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:49:04,616 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 16 states. [2018-02-04 18:49:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:04,953 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 18:49:04,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 18:49:04,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-02-04 18:49:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:04,955 INFO L225 Difference]: With dead ends: 154 [2018-02-04 18:49:04,955 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 18:49:04,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2018-02-04 18:49:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 18:49:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-04 18:49:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 18:49:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-04 18:49:04,966 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 83 [2018-02-04 18:49:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:04,966 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-04 18:49:04,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:49:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-04 18:49:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 18:49:04,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:04,969 INFO L351 BasicCegarLoop]: trace histogram [14, 11, 11, 10, 10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:04,970 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 519451937, now seen corresponding path program 4 times [2018-02-04 18:49:04,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:04,970 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:04,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,971 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:04,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:04,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 262 proven. 47 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 18:49:05,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:05,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:05,068 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:05,083 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:05,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:05,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 305 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 18:49:05,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:05,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 18:49:05,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 18:49:05,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 18:49:05,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:49:05,137 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 12 states. [2018-02-04 18:49:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:05,217 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-02-04 18:49:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:49:05,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-02-04 18:49:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:05,219 INFO L225 Difference]: With dead ends: 151 [2018-02-04 18:49:05,219 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 18:49:05,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:49:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 18:49:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-02-04 18:49:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 18:49:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-04 18:49:05,223 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 113 [2018-02-04 18:49:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:05,223 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-04 18:49:05,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 18:49:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-04 18:49:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 18:49:05,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:05,225 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 18:49:05,225 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 5 times [2018-02-04 18:49:05,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:05,225 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:05,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:05,226 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:05,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:05,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:05,435 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 18:49:05,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:05,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:05,436 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:05,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 18:49:05,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:05,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:05,578 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 18:49:05,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:05,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-02-04 18:49:05,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:49:05,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:49:05,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:49:05,580 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-04 18:49:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:05,817 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-02-04 18:49:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:49:05,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-02-04 18:49:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:05,819 INFO L225 Difference]: With dead ends: 174 [2018-02-04 18:49:05,819 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 18:49:05,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:49:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 18:49:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2018-02-04 18:49:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 18:49:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-04 18:49:05,823 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 125 [2018-02-04 18:49:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:05,823 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-04 18:49:05,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:49:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-04 18:49:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 18:49:05,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:05,824 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 18:49:05,824 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 6 times [2018-02-04 18:49:05,825 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:05,825 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:05,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:05,825 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:05,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:05,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:06,003 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 18:49:06,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:06,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:06,003 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:06,023 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 18:49:06,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:06,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 388 proven. 229 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 18:49:06,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:06,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2018-02-04 18:49:06,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:49:06,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:49:06,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:49:06,182 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 26 states. [2018-02-04 18:49:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:06,822 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2018-02-04 18:49:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 18:49:06,822 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-02-04 18:49:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:06,823 INFO L225 Difference]: With dead ends: 220 [2018-02-04 18:49:06,823 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 18:49:06,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 18:49:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 18:49:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2018-02-04 18:49:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 18:49:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 207 transitions. [2018-02-04 18:49:06,828 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 207 transitions. Word has length 137 [2018-02-04 18:49:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:06,828 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 207 transitions. [2018-02-04 18:49:06,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:49:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 207 transitions. [2018-02-04 18:49:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 18:49:06,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:06,830 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 18:49:06,830 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 7 times [2018-02-04 18:49:06,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:06,830 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:06,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:06,831 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:06,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:06,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:06,994 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 18:49:06,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:06,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:06,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:07,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 694 proven. 52 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-02-04 18:49:07,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:07,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-04 18:49:07,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:49:07,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:49:07,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:49:07,198 INFO L87 Difference]: Start difference. First operand 201 states and 207 transitions. Second operand 25 states. [2018-02-04 18:49:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:07,678 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-02-04 18:49:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 18:49:07,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-02-04 18:49:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:07,679 INFO L225 Difference]: With dead ends: 269 [2018-02-04 18:49:07,680 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 18:49:07,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 18:49:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 18:49:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 249. [2018-02-04 18:49:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-04 18:49:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2018-02-04 18:49:07,684 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 254 transitions. Word has length 179 [2018-02-04 18:49:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:07,684 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 254 transitions. [2018-02-04 18:49:07,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:49:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 254 transitions. [2018-02-04 18:49:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 18:49:07,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:07,687 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 18:49:07,687 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 8 times [2018-02-04 18:49:07,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:07,688 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:07,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:07,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:07,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:07,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:07,893 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 18:49:07,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:07,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:07,894 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:07,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:07,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:07,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:08,031 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 18:49:08,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:08,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-02-04 18:49:08,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:49:08,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:49:08,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:49:08,032 INFO L87 Difference]: Start difference. First operand 249 states and 254 transitions. Second operand 20 states. [2018-02-04 18:49:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:08,185 INFO L93 Difference]: Finished difference Result 263 states and 266 transitions. [2018-02-04 18:49:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:49:08,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-02-04 18:49:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:08,186 INFO L225 Difference]: With dead ends: 263 [2018-02-04 18:49:08,186 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 18:49:08,186 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 18:49:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 18:49:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2018-02-04 18:49:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-04 18:49:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-02-04 18:49:08,191 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 227 [2018-02-04 18:49:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:08,191 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-02-04 18:49:08,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:49:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-02-04 18:49:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 18:49:08,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:08,193 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 18:49:08,194 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 9 times [2018-02-04 18:49:08,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:08,194 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:08,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:08,195 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:08,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:08,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:08,487 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 18:49:08,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:08,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:08,488 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:08,517 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 18:49:08,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:08,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:08,528 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 18:49:08,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:08,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:08,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:08,863 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 18:49:08,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:08,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 18:49:08,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:49:08,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:49:08,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:49:08,864 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 21 states. [2018-02-04 18:49:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:09,217 INFO L93 Difference]: Finished difference Result 326 states and 332 transitions. [2018-02-04 18:49:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 18:49:09,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-02-04 18:49:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:09,219 INFO L225 Difference]: With dead ends: 326 [2018-02-04 18:49:09,219 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 18:49:09,219 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 18:49:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 18:49:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 303. [2018-02-04 18:49:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 18:49:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 308 transitions. [2018-02-04 18:49:09,224 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 308 transitions. Word has length 233 [2018-02-04 18:49:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:09,224 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 308 transitions. [2018-02-04 18:49:09,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:49:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 308 transitions. [2018-02-04 18:49:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 18:49:09,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:09,225 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 18:49:09,225 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 10 times [2018-02-04 18:49:09,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:09,225 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:09,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:09,226 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:09,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:09,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:09,419 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 18:49:09,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:09,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:09,419 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:09,442 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:09,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:09,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:09,647 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 18:49:09,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:09,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-02-04 18:49:09,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 18:49:09,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 18:49:09,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:49:09,648 INFO L87 Difference]: Start difference. First operand 303 states and 308 transitions. Second operand 34 states. [2018-02-04 18:49:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:10,129 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-02-04 18:49:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 18:49:10,129 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-02-04 18:49:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:10,130 INFO L225 Difference]: With dead ends: 325 [2018-02-04 18:49:10,130 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 18:49:10,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 18:49:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 18:49:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 309. [2018-02-04 18:49:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-04 18:49:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-02-04 18:49:10,135 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 287 [2018-02-04 18:49:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:10,136 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-02-04 18:49:10,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 18:49:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-02-04 18:49:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 18:49:10,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:10,137 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 18:49:10,137 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 11 times [2018-02-04 18:49:10,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:10,137 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:10,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:10,137 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:10,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:10,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:10,512 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 18:49:10,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:10,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:10,514 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:10,754 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-02-04 18:49:10,754 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:10,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:10,829 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 18:49:10,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:10,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:10,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:11,172 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 18:49:11,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:11,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-04 18:49:11,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:49:11,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:49:11,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:49:11,174 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 24 states. [2018-02-04 18:49:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:11,546 INFO L93 Difference]: Finished difference Result 326 states and 330 transitions. [2018-02-04 18:49:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:49:11,547 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 293 [2018-02-04 18:49:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:11,548 INFO L225 Difference]: With dead ends: 326 [2018-02-04 18:49:11,548 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 18:49:11,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2018-02-04 18:49:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 18:49:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2018-02-04 18:49:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 18:49:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 319 transitions. [2018-02-04 18:49:11,554 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 319 transitions. Word has length 293 [2018-02-04 18:49:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:11,554 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 319 transitions. [2018-02-04 18:49:11,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:49:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 319 transitions. [2018-02-04 18:49:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-02-04 18:49:11,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:11,556 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 18:49:11,556 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 12 times [2018-02-04 18:49:11,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:11,556 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:11,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:11,557 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:11,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:11,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:11,823 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 18:49:11,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:11,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:11,824 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:11,867 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-04 18:49:11,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:11,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:11,876 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 18:49:11,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:11,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:11,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1518 proven. 200 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-02-04 18:49:12,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:12,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-02-04 18:49:12,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 18:49:12,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 18:49:12,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 18:49:12,316 INFO L87 Difference]: Start difference. First operand 315 states and 319 transitions. Second operand 33 states. [2018-02-04 18:49:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:13,364 INFO L93 Difference]: Finished difference Result 400 states and 406 transitions. [2018-02-04 18:49:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 18:49:13,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 299 [2018-02-04 18:49:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:13,366 INFO L225 Difference]: With dead ends: 400 [2018-02-04 18:49:13,366 INFO L226 Difference]: Without dead ends: 400 [2018-02-04 18:49:13,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 277 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=854, Invalid=3702, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 18:49:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-04 18:49:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 381. [2018-02-04 18:49:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 18:49:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 387 transitions. [2018-02-04 18:49:13,373 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 387 transitions. Word has length 299 [2018-02-04 18:49:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:13,373 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 387 transitions. [2018-02-04 18:49:13,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 18:49:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 387 transitions. [2018-02-04 18:49:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-04 18:49:13,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:13,376 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 44, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:13,376 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1422188691, now seen corresponding path program 13 times [2018-02-04 18:49:13,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:13,376 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:13,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:13,377 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:13,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:13,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 3575 proven. 140 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2018-02-04 18:49:13,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:13,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:13,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:13,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 2371 proven. 154 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2018-02-04 18:49:14,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:14,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2018-02-04 18:49:14,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:49:14,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:49:14,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 18:49:14,135 INFO L87 Difference]: Start difference. First operand 381 states and 387 transitions. Second operand 37 states. [2018-02-04 18:49:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:14,752 INFO L93 Difference]: Finished difference Result 467 states and 472 transitions. [2018-02-04 18:49:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 18:49:14,752 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 359 [2018-02-04 18:49:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:14,753 INFO L225 Difference]: With dead ends: 467 [2018-02-04 18:49:14,753 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 18:49:14,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=529, Invalid=3503, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 18:49:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 18:49:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2018-02-04 18:49:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 18:49:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 452 transitions. [2018-02-04 18:49:14,760 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 452 transitions. Word has length 359 [2018-02-04 18:49:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:14,760 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 452 transitions. [2018-02-04 18:49:14,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:49:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 452 transitions. [2018-02-04 18:49:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-04 18:49:14,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:14,761 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 18:49:14,762 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1961864906, now seen corresponding path program 14 times [2018-02-04 18:49:14,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:14,762 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:14,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:14,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:14,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:14,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 4759 proven. 184 refuted. 0 times theorem prover too weak. 4445 trivial. 0 not checked. [2018-02-04 18:49:15,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:15,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:15,169 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:15,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:15,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:15,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:15,201 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 18:49:15,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:15,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:15,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2662 proven. 218 refuted. 0 times theorem prover too weak. 6508 trivial. 0 not checked. [2018-02-04 18:49:15,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:15,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2018-02-04 18:49:15,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 18:49:15,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 18:49:15,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:49:15,835 INFO L87 Difference]: Start difference. First operand 447 states and 452 transitions. Second operand 35 states. [2018-02-04 18:49:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:17,330 INFO L93 Difference]: Finished difference Result 536 states and 540 transitions. [2018-02-04 18:49:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 18:49:17,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 425 [2018-02-04 18:49:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:17,332 INFO L225 Difference]: With dead ends: 536 [2018-02-04 18:49:17,332 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 18:49:17,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 406 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1855, Invalid=8651, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 18:49:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 18:49:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 513. [2018-02-04 18:49:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-02-04 18:49:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 517 transitions. [2018-02-04 18:49:17,342 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 517 transitions. Word has length 425 [2018-02-04 18:49:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:17,342 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 517 transitions. [2018-02-04 18:49:17,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 18:49:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 517 transitions. [2018-02-04 18:49:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-02-04 18:49:17,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:17,345 INFO L351 BasicCegarLoop]: trace histogram [72, 63, 63, 62, 62, 62, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:17,346 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:17,346 INFO L82 PathProgramCache]: Analyzing trace with hash 439171591, now seen corresponding path program 15 times [2018-02-04 18:49:17,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:17,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:17,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:17,347 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:17,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:17,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13205 backedges. 3263 proven. 252 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 18:49:18,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:18,097 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:18,097 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:18,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 18:49:18,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:18,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:18,170 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 18:49:18,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:18,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:18,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13205 backedges. 3263 proven. 252 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-04 18:49:18,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:18,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-02-04 18:49:18,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:49:18,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:49:18,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-04 18:49:18,687 INFO L87 Difference]: Start difference. First operand 513 states and 517 transitions. Second operand 17 states. [2018-02-04 18:49:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:18,945 INFO L93 Difference]: Finished difference Result 543 states and 549 transitions. [2018-02-04 18:49:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:49:18,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 497 [2018-02-04 18:49:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:18,947 INFO L225 Difference]: With dead ends: 543 [2018-02-04 18:49:18,947 INFO L226 Difference]: Without dead ends: 543 [2018-02-04 18:49:18,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 475 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-02-04 18:49:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-04 18:49:18,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 519. [2018-02-04 18:49:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 18:49:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 524 transitions. [2018-02-04 18:49:18,952 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 524 transitions. Word has length 497 [2018-02-04 18:49:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:18,952 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 524 transitions. [2018-02-04 18:49:18,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 18:49:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 524 transitions. [2018-02-04 18:49:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-04 18:49:18,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:18,955 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 18:49:18,956 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 16 times [2018-02-04 18:49:18,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:18,956 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:18,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:18,957 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:18,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:18,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:19,669 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 18:49:19,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:19,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:19,670 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:19,710 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:19,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:19,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6029 proven. 814 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-02-04 18:49:20,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:20,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 41 [2018-02-04 18:49:20,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:49:20,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:49:20,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 18:49:20,219 INFO L87 Difference]: Start difference. First operand 519 states and 524 transitions. Second operand 41 states. [2018-02-04 18:49:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:21,476 INFO L93 Difference]: Finished difference Result 625 states and 632 transitions. [2018-02-04 18:49:21,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 18:49:21,476 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 503 [2018-02-04 18:49:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:21,478 INFO L225 Difference]: With dead ends: 625 [2018-02-04 18:49:21,478 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 18:49:21,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1180, Invalid=4982, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 18:49:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 18:49:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 537. [2018-02-04 18:49:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-04 18:49:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 543 transitions. [2018-02-04 18:49:21,483 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 543 transitions. Word has length 503 [2018-02-04 18:49:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:21,483 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 543 transitions. [2018-02-04 18:49:21,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:49:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 543 transitions. [2018-02-04 18:49:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-02-04 18:49:21,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:21,487 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 18:49:21,487 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:21,487 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 17 times [2018-02-04 18:49:21,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:21,487 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:21,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:21,488 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:21,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:21,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:22,179 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 18:49:22,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:22,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:22,180 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:22,805 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-04 18:49:22,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:22,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4351 proven. 1714 refuted. 0 times theorem prover too weak. 8340 trivial. 0 not checked. [2018-02-04 18:49:23,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:23,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 45 [2018-02-04 18:49:23,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 18:49:23,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 18:49:23,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 18:49:23,456 INFO L87 Difference]: Start difference. First operand 537 states and 543 transitions. Second operand 45 states. [2018-02-04 18:49:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:24,760 INFO L93 Difference]: Finished difference Result 756 states and 773 transitions. [2018-02-04 18:49:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 18:49:24,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 515 [2018-02-04 18:49:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:24,762 INFO L225 Difference]: With dead ends: 756 [2018-02-04 18:49:24,762 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 18:49:24,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1171, Invalid=6311, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 18:49:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 18:49:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 738. [2018-02-04 18:49:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-02-04 18:49:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 755 transitions. [2018-02-04 18:49:24,769 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 755 transitions. Word has length 515 [2018-02-04 18:49:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:24,769 INFO L432 AbstractCegarLoop]: Abstraction has 738 states and 755 transitions. [2018-02-04 18:49:24,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 18:49:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 755 transitions. [2018-02-04 18:49:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-02-04 18:49:24,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:24,772 INFO L351 BasicCegarLoop]: trace histogram [77, 68, 68, 67, 67, 67, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:24,772 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash -19559249, now seen corresponding path program 18 times [2018-02-04 18:49:24,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:24,773 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:24,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:24,773 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:24,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:24,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4758 proven. 1581 refuted. 0 times theorem prover too weak. 8896 trivial. 0 not checked. [2018-02-04 18:49:25,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:25,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:25,109 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:25,149 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-04 18:49:25,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:25,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15235 backedges. 4385 proven. 40 refuted. 0 times theorem prover too weak. 10810 trivial. 0 not checked. [2018-02-04 18:49:25,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:25,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-04 18:49:25,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:49:25,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:49:25,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-02-04 18:49:25,388 INFO L87 Difference]: Start difference. First operand 738 states and 755 transitions. Second operand 18 states. [2018-02-04 18:49:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:25,521 INFO L93 Difference]: Finished difference Result 711 states and 722 transitions. [2018-02-04 18:49:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:49:25,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 527 [2018-02-04 18:49:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:25,523 INFO L225 Difference]: With dead ends: 711 [2018-02-04 18:49:25,523 INFO L226 Difference]: Without dead ends: 702 [2018-02-04 18:49:25,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:49:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-02-04 18:49:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2018-02-04 18:49:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 18:49:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 710 transitions. [2018-02-04 18:49:25,533 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 710 transitions. Word has length 527 [2018-02-04 18:49:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:25,534 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 710 transitions. [2018-02-04 18:49:25,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:49:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 710 transitions. [2018-02-04 18:49:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-02-04 18:49:25,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:25,537 INFO L351 BasicCegarLoop]: trace histogram [86, 76, 76, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:25,538 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 660674672, now seen corresponding path program 19 times [2018-02-04 18:49:25,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:25,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:25,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:25,539 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:25,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:25,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19060 backedges. 8010 proven. 817 refuted. 0 times theorem prover too weak. 10233 trivial. 0 not checked. [2018-02-04 18:49:26,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:26,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:26,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:26,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 19060 backedges. 10743 proven. 234 refuted. 0 times theorem prover too weak. 8083 trivial. 0 not checked. [2018-02-04 18:49:26,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:26,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-04 18:49:26,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:49:26,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:49:26,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-04 18:49:26,455 INFO L87 Difference]: Start difference. First operand 699 states and 710 transitions. Second operand 32 states. [2018-02-04 18:49:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:26,854 INFO L93 Difference]: Finished difference Result 621 states and 626 transitions. [2018-02-04 18:49:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 18:49:26,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 587 [2018-02-04 18:49:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:26,857 INFO L225 Difference]: With dead ends: 621 [2018-02-04 18:49:26,857 INFO L226 Difference]: Without dead ends: 612 [2018-02-04 18:49:26,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 18:49:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-02-04 18:49:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2018-02-04 18:49:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-04 18:49:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 614 transitions. [2018-02-04 18:49:26,863 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 614 transitions. Word has length 587 [2018-02-04 18:49:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:26,863 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 614 transitions. [2018-02-04 18:49:26,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:49:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 614 transitions. [2018-02-04 18:49:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-04 18:49:26,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:26,866 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 18:49:26,866 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 20 times [2018-02-04 18:49:26,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:26,866 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:26,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:26,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:26,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:26,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:27,573 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 18:49:27,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:27,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:27,574 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:27,613 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:27,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:27,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:27,663 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 18:49:27,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:27,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:27,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 5134 proven. 334 refuted. 0 times theorem prover too weak. 14066 trivial. 0 not checked. [2018-02-04 18:49:28,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:28,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 41 [2018-02-04 18:49:28,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 18:49:28,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 18:49:28,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 18:49:28,883 INFO L87 Difference]: Start difference. First operand 609 states and 614 transitions. Second operand 41 states. [2018-02-04 18:49:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:30,762 INFO L93 Difference]: Finished difference Result 709 states and 714 transitions. [2018-02-04 18:49:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 18:49:30,763 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 593 [2018-02-04 18:49:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:30,765 INFO L225 Difference]: With dead ends: 709 [2018-02-04 18:49:30,765 INFO L226 Difference]: Without dead ends: 700 [2018-02-04 18:49:30,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 570 SyntacticMatches, 19 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2682, Invalid=12818, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 18:49:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-02-04 18:49:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 687. [2018-02-04 18:49:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-02-04 18:49:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 691 transitions. [2018-02-04 18:49:30,777 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 691 transitions. Word has length 593 [2018-02-04 18:49:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:30,777 INFO L432 AbstractCegarLoop]: Abstraction has 687 states and 691 transitions. [2018-02-04 18:49:30,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 18:49:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 691 transitions. [2018-02-04 18:49:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-02-04 18:49:30,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:30,782 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 18:49:30,782 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-02-04 18:49:30,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:30,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:30,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,783 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:30,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:30,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:31,672 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 18:49:31,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:31,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:31,673 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:31,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 18:49:31,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:31,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:31,754 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 18:49:31,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:31,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:31,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 6073 proven. 444 refuted. 0 times theorem prover too weak. 19476 trivial. 0 not checked. [2018-02-04 18:49:32,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:32,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 47 [2018-02-04 18:49:32,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 18:49:32,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 18:49:32,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 18:49:32,852 INFO L87 Difference]: Start difference. First operand 687 states and 691 transitions. Second operand 47 states. [2018-02-04 18:49:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:34,392 INFO L93 Difference]: Finished difference Result 726 states and 731 transitions. [2018-02-04 18:49:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 18:49:34,392 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 677 [2018-02-04 18:49:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:34,395 INFO L225 Difference]: With dead ends: 726 [2018-02-04 18:49:34,395 INFO L226 Difference]: Without dead ends: 720 [2018-02-04 18:49:34,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 641 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1296, Invalid=5844, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 18:49:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-02-04 18:49:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 699. [2018-02-04 18:49:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-04 18:49:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 703 transitions. [2018-02-04 18:49:34,404 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 703 transitions. Word has length 677 [2018-02-04 18:49:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:34,405 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 703 transitions. [2018-02-04 18:49:34,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 18:49:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 703 transitions. [2018-02-04 18:49:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-02-04 18:49:34,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:34,410 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 18:49:34,410 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 22 times [2018-02-04 18:49:34,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:34,410 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:34,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:34,411 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:34,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:34,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:35,355 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 18:49:35,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:35,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:35,356 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:35,387 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:35,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:35,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 10276 proven. 2109 refuted. 0 times theorem prover too weak. 14722 trivial. 0 not checked. [2018-02-04 18:49:36,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:36,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 57 [2018-02-04 18:49:36,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 18:49:36,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 18:49:36,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 18:49:36,041 INFO L87 Difference]: Start difference. First operand 699 states and 703 transitions. Second operand 57 states. [2018-02-04 18:49:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:37,262 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-02-04 18:49:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 18:49:37,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 689 [2018-02-04 18:49:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:37,264 INFO L225 Difference]: With dead ends: 806 [2018-02-04 18:49:37,264 INFO L226 Difference]: Without dead ends: 806 [2018-02-04 18:49:37,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1559, Invalid=6997, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 18:49:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-02-04 18:49:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-02-04 18:49:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-04 18:49:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-02-04 18:49:37,280 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-02-04 18:49:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:37,280 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-02-04 18:49:37,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 18:49:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-02-04 18:49:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-02-04 18:49:37,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:37,287 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 18:49:37,287 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 23 times [2018-02-04 18:49:37,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:37,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:37,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:37,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:37,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:37,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:38,573 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 18:49:38,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:38,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:38,573 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:49:39,071 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-02-04 18:49:39,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:39,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 14263 proven. 5159 refuted. 0 times theorem prover too weak. 15216 trivial. 0 not checked. [2018-02-04 18:49:39,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:39,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 59 [2018-02-04 18:49:39,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 18:49:39,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 18:49:39,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2914, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 18:49:39,765 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 59 states. [2018-02-04 18:49:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:41,514 INFO L93 Difference]: Finished difference Result 809 states and 812 transitions. [2018-02-04 18:49:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 18:49:41,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 773 [2018-02-04 18:49:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:41,515 INFO L225 Difference]: With dead ends: 809 [2018-02-04 18:49:41,516 INFO L226 Difference]: Without dead ends: 803 [2018-02-04 18:49:41,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3847 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2257, Invalid=11315, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 18:49:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-04 18:49:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 795. [2018-02-04 18:49:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-04 18:49:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 798 transitions. [2018-02-04 18:49:41,524 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 798 transitions. Word has length 773 [2018-02-04 18:49:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:41,525 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 798 transitions. [2018-02-04 18:49:41,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 18:49:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 798 transitions. [2018-02-04 18:49:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-02-04 18:49:41,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:41,531 INFO L351 BasicCegarLoop]: trace histogram [116, 104, 104, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:49:41,531 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 861490130, now seen corresponding path program 24 times [2018-02-04 18:49:41,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:41,532 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:41,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:41,532 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:41,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:41,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 520 refuted. 0 times theorem prover too weak. 27030 trivial. 0 not checked. [2018-02-04 18:49:42,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:42,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:42,708 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:49:42,929 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-04 18:49:42,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:42,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:42,955 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 18:49:42,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:42,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:42,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 35278 backedges. 7728 proven. 470 refuted. 0 times theorem prover too weak. 27080 trivial. 0 not checked. [2018-02-04 18:49:44,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:44,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2018-02-04 18:49:44,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 18:49:44,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 18:49:44,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:49:44,253 INFO L87 Difference]: Start difference. First operand 795 states and 798 transitions. Second operand 35 states. [2018-02-04 18:49:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:45,155 INFO L93 Difference]: Finished difference Result 914 states and 920 transitions. [2018-02-04 18:49:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 18:49:45,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 779 [2018-02-04 18:49:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:45,157 INFO L225 Difference]: With dead ends: 914 [2018-02-04 18:49:45,157 INFO L226 Difference]: Without dead ends: 914 [2018-02-04 18:49:45,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 738 SyntacticMatches, 25 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1013, Invalid=3277, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 18:49:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-04 18:49:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 891. [2018-02-04 18:49:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-02-04 18:49:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 896 transitions. [2018-02-04 18:49:45,164 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 896 transitions. Word has length 779 [2018-02-04 18:49:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:45,165 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 896 transitions. [2018-02-04 18:49:45,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 18:49:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 896 transitions. [2018-02-04 18:49:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-02-04 18:49:45,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:45,169 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 18:49:45,169 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1790043837, now seen corresponding path program 25 times [2018-02-04 18:49:45,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:45,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:45,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:45,170 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:45,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:45,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 20572 proven. 3250 refuted. 0 times theorem prover too weak. 21431 trivial. 0 not checked. [2018-02-04 18:49:46,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:46,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:46,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:46,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 20601 proven. 3221 refuted. 0 times theorem prover too weak. 21431 trivial. 0 not checked. [2018-02-04 18:49:47,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:47,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 59 [2018-02-04 18:49:47,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 18:49:47,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 18:49:47,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2814, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 18:49:47,288 INFO L87 Difference]: Start difference. First operand 891 states and 896 transitions. Second operand 59 states. [2018-02-04 18:49:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:48,252 INFO L93 Difference]: Finished difference Result 915 states and 919 transitions. [2018-02-04 18:49:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 18:49:48,253 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 875 [2018-02-04 18:49:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:48,255 INFO L225 Difference]: With dead ends: 915 [2018-02-04 18:49:48,255 INFO L226 Difference]: Without dead ends: 909 [2018-02-04 18:49:48,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1902, Invalid=7410, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 18:49:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-02-04 18:49:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-02-04 18:49:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-02-04 18:49:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-02-04 18:49:48,262 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-02-04 18:49:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:48,262 INFO L432 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-02-04 18:49:48,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 18:49:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-02-04 18:49:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-02-04 18:49:48,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:48,269 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 18:49:48,269 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 26 times [2018-02-04 18:49:48,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:48,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:48,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:48,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:49:48,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:48,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:49,643 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 18:49:49,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:49,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:49,643 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:49:49,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:49:49,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:49,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:49,724 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 18:49:49,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:49,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:49,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:50,739 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 18:49:50,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:50,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-02-04 18:49:50,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:49:50,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:49:50,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:49:50,740 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-02-04 18:49:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:51,070 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-02-04 18:49:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:49:51,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-02-04 18:49:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:51,072 INFO L225 Difference]: With dead ends: 927 [2018-02-04 18:49:51,072 INFO L226 Difference]: Without dead ends: 927 [2018-02-04 18:49:51,072 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 18:49:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-02-04 18:49:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-02-04 18:49:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-02-04 18:49:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-02-04 18:49:51,078 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-02-04 18:49:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:51,078 INFO L432 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-02-04 18:49:51,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:49:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-02-04 18:49:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-02-04 18:49:51,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:51,083 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 18:49:51,083 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 27 times [2018-02-04 18:49:51,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:51,083 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:51,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:51,084 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:51,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:51,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:52,419 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 18:49:52,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:52,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:52,420 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:49:52,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 18:49:52,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:52,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 17787 proven. 1894 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-02-04 18:49:53,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:53,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 70 [2018-02-04 18:49:53,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 18:49:53,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 18:49:53,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=4097, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 18:49:53,453 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 70 states. [2018-02-04 18:49:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:49:55,277 INFO L93 Difference]: Finished difference Result 1021 states and 1026 transitions. [2018-02-04 18:49:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 18:49:55,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 887 [2018-02-04 18:49:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:49:55,280 INFO L225 Difference]: With dead ends: 1021 [2018-02-04 18:49:55,280 INFO L226 Difference]: Without dead ends: 1021 [2018-02-04 18:49:55,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2460, Invalid=13542, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 18:49:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-02-04 18:49:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1011. [2018-02-04 18:49:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-02-04 18:49:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1016 transitions. [2018-02-04 18:49:55,290 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1016 transitions. Word has length 887 [2018-02-04 18:49:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:49:55,291 INFO L432 AbstractCegarLoop]: Abstraction has 1011 states and 1016 transitions. [2018-02-04 18:49:55,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 18:49:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1016 transitions. [2018-02-04 18:49:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-02-04 18:49:55,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:49:55,296 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 18:49:55,296 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:49:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 28 times [2018-02-04 18:49:55,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:49:55,296 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:49:55,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:55,297 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:49:55,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:49:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:49:55,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:49:56,994 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 18:49:56,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:49:56,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:49:56,995 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:49:57,467 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:49:57,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:49:57,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:49:57,489 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 18:49:57,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:57,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:49:57,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:49:57,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-04 18:49:57,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:49:57,540 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 18:49:57,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-04 18:49:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 25212 proven. 7364 refuted. 0 times theorem prover too weak. 26368 trivial. 0 not checked. [2018-02-04 18:49:59,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:49:59,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 47] total 65 [2018-02-04 18:49:59,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 18:49:59,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 18:49:59,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3812, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 18:49:59,815 INFO L87 Difference]: Start difference. First operand 1011 states and 1016 transitions. Second operand 66 states. [2018-02-04 18:50:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:03,812 INFO L93 Difference]: Finished difference Result 1030 states and 1035 transitions. [2018-02-04 18:50:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 18:50:03,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 989 [2018-02-04 18:50:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:03,814 INFO L225 Difference]: With dead ends: 1030 [2018-02-04 18:50:03,815 INFO L226 Difference]: Without dead ends: 1027 [2018-02-04 18:50:03,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 917 SyntacticMatches, 28 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1997, Invalid=15559, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 18:50:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-02-04 18:50:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1014. [2018-02-04 18:50:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 18:50:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1019 transitions. [2018-02-04 18:50:03,824 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1019 transitions. Word has length 989 [2018-02-04 18:50:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:03,824 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1019 transitions. [2018-02-04 18:50:03,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 18:50:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1019 transitions. [2018-02-04 18:50:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-02-04 18:50:03,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:03,833 INFO L351 BasicCegarLoop]: trace histogram [150, 136, 136, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:50:03,833 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1007592468, now seen corresponding path program 29 times [2018-02-04 18:50:03,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:03,834 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:03,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:03,834 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:03,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50: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 18:50:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 12390 proven. 784 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-02-04 18:50:05,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:05,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:05,519 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:50:06,308 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-04 18:50:06,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:06,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 59780 backedges. 15400 proven. 5549 refuted. 0 times theorem prover too weak. 38831 trivial. 0 not checked. [2018-02-04 18:50:07,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:07,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 40] total 60 [2018-02-04 18:50:07,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 18:50:07,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 18:50:07,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=3055, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 18:50:07,426 INFO L87 Difference]: Start difference. First operand 1014 states and 1019 transitions. Second operand 60 states. [2018-02-04 18:50:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:09,399 INFO L93 Difference]: Finished difference Result 1254 states and 1262 transitions. [2018-02-04 18:50:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 18:50:09,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 995 [2018-02-04 18:50:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:09,401 INFO L225 Difference]: With dead ends: 1254 [2018-02-04 18:50:09,401 INFO L226 Difference]: Without dead ends: 1254 [2018-02-04 18:50:09,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 957 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2252, Invalid=11320, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 18:50:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-02-04 18:50:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1233. [2018-02-04 18:50:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-02-04 18:50:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1241 transitions. [2018-02-04 18:50:09,408 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1241 transitions. Word has length 995 [2018-02-04 18:50:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:09,408 INFO L432 AbstractCegarLoop]: Abstraction has 1233 states and 1241 transitions. [2018-02-04 18:50:09,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 18:50:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1241 transitions. [2018-02-04 18:50:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-02-04 18:50:09,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:09,414 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 18:50:09,414 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1753664213, now seen corresponding path program 30 times [2018-02-04 18:50:09,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:09,414 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:09,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:09,415 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:09,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:09,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 29764 proven. 5578 refuted. 0 times theorem prover too weak. 39107 trivial. 0 not checked. [2018-02-04 18:50:11,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:11,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:11,707 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:50:12,156 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-04 18:50:12,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:12,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:12,215 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 18:50:12,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:50:12,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:50:12,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:50:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 16955 proven. 6656 refuted. 0 times theorem prover too weak. 50838 trivial. 0 not checked. [2018-02-04 18:50:14,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:14,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 27] total 64 [2018-02-04 18:50:14,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 18:50:14,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 18:50:14,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=3479, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 18:50:14,385 INFO L87 Difference]: Start difference. First operand 1233 states and 1241 transitions. Second operand 64 states. [2018-02-04 18:50:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:17,448 INFO L93 Difference]: Finished difference Result 1270 states and 1276 transitions. [2018-02-04 18:50:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 18:50:17,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1103 [2018-02-04 18:50:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:17,450 INFO L225 Difference]: With dead ends: 1270 [2018-02-04 18:50:17,450 INFO L226 Difference]: Without dead ends: 1252 [2018-02-04 18:50:17,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1051 SyntacticMatches, 28 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3249, Invalid=20007, Unknown=0, NotChecked=0, Total=23256 [2018-02-04 18:50:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-02-04 18:50:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1233. [2018-02-04 18:50:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-02-04 18:50:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1238 transitions. [2018-02-04 18:50:17,457 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1238 transitions. Word has length 1103 [2018-02-04 18:50:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:17,458 INFO L432 AbstractCegarLoop]: Abstraction has 1233 states and 1238 transitions. [2018-02-04 18:50:17,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 18:50:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1238 transitions. [2018-02-04 18:50:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-02-04 18:50:17,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:17,469 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 18:50:17,469 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 31 times [2018-02-04 18:50:17,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:17,469 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:17,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:17,470 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:17,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:17,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:20,170 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 18:50:20,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:20,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:20,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:20,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 34005 proven. 6824 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-02-04 18:50:21,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:21,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 68 [2018-02-04 18:50:21,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 18:50:21,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 18:50:21,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=3774, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 18:50:21,217 INFO L87 Difference]: Start difference. First operand 1233 states and 1238 transitions. Second operand 68 states. [2018-02-04 18:50:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:22,326 INFO L93 Difference]: Finished difference Result 1257 states and 1261 transitions. [2018-02-04 18:50:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 18:50:22,327 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1217 [2018-02-04 18:50:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:22,329 INFO L225 Difference]: With dead ends: 1257 [2018-02-04 18:50:22,329 INFO L226 Difference]: Without dead ends: 1251 [2018-02-04 18:50:22,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1301 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2529, Invalid=9903, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 18:50:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-04 18:50:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1239. [2018-02-04 18:50:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-02-04 18:50:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1243 transitions. [2018-02-04 18:50:22,336 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1243 transitions. Word has length 1217 [2018-02-04 18:50:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:22,337 INFO L432 AbstractCegarLoop]: Abstraction has 1239 states and 1243 transitions. [2018-02-04 18:50:22,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 18:50:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1243 transitions. [2018-02-04 18:50:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-02-04 18:50:22,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:22,344 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 18:50:22,344 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 32 times [2018-02-04 18:50:22,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:22,345 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:22,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:22,345 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:50:22,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:22,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:24,858 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 18:50:24,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:24,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:24,858 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:50:24,915 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:50:24,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:24,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:24,929 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 18:50:24,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:50:24,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:50:24,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:50:26,715 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 18:50:26,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:26,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 24 [2018-02-04 18:50:26,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 18:50:26,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 18:50:26,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=358, Unknown=0, NotChecked=0, Total=600 [2018-02-04 18:50:26,716 INFO L87 Difference]: Start difference. First operand 1239 states and 1243 transitions. Second operand 25 states. [2018-02-04 18:50:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:27,135 INFO L93 Difference]: Finished difference Result 1269 states and 1275 transitions. [2018-02-04 18:50:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:50:27,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1223 [2018-02-04 18:50:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:27,138 INFO L225 Difference]: With dead ends: 1269 [2018-02-04 18:50:27,138 INFO L226 Difference]: Without dead ends: 1269 [2018-02-04 18:50:27,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1187 SyntacticMatches, 34 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=657, Invalid=1149, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 18:50:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-02-04 18:50:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1245. [2018-02-04 18:50:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-02-04 18:50:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1250 transitions. [2018-02-04 18:50:27,145 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1250 transitions. Word has length 1223 [2018-02-04 18:50:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:27,146 INFO L432 AbstractCegarLoop]: Abstraction has 1245 states and 1250 transitions. [2018-02-04 18:50:27,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 18:50:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1250 transitions. [2018-02-04 18:50:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-02-04 18:50:27,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:27,153 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 18:50:27,153 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 33 times [2018-02-04 18:50:27,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:27,154 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:27,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:27,154 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:27,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:27,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:29,855 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 18:50:29,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:29,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:29,856 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:50:29,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-02-04 18:50:29,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:30,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:30,012 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 18:50:30,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:50:30,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:50:30,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:50:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 28174 proven. 4327 refuted. 0 times theorem prover too weak. 61361 trivial. 0 not checked. [2018-02-04 18:50:32,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:32,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 28] total 67 [2018-02-04 18:50:32,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 18:50:32,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 18:50:32,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3806, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 18:50:32,592 INFO L87 Difference]: Start difference. First operand 1245 states and 1250 transitions. Second operand 67 states. [2018-02-04 18:50:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:35,680 INFO L93 Difference]: Finished difference Result 1385 states and 1391 transitions. [2018-02-04 18:50:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-02-04 18:50:35,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1229 [2018-02-04 18:50:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:35,683 INFO L225 Difference]: With dead ends: 1385 [2018-02-04 18:50:35,683 INFO L226 Difference]: Without dead ends: 1385 [2018-02-04 18:50:35,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1173 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5497 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3028, Invalid=14794, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 18:50:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-02-04 18:50:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1371. [2018-02-04 18:50:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-02-04 18:50:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1377 transitions. [2018-02-04 18:50:35,691 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1377 transitions. Word has length 1229 [2018-02-04 18:50:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:35,692 INFO L432 AbstractCegarLoop]: Abstraction has 1371 states and 1377 transitions. [2018-02-04 18:50:35,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 18:50:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1377 transitions. [2018-02-04 18:50:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2018-02-04 18:50:35,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:35,700 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 18:50:35,700 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -710434185, now seen corresponding path program 34 times [2018-02-04 18:50:35,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:35,701 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:35,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:35,701 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:35,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:35,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:39,075 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 18:50:39,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:39,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:39,075 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:50:39,137 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:50:39,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:39,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 35205 proven. 2758 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-02-04 18:50:40,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:40,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 82 [2018-02-04 18:50:40,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 18:50:40,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 18:50:40,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=5731, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 18:50:40,330 INFO L87 Difference]: Start difference. First operand 1371 states and 1377 transitions. Second operand 82 states. [2018-02-04 18:50:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:42,595 INFO L93 Difference]: Finished difference Result 1513 states and 1517 transitions. [2018-02-04 18:50:42,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 18:50:42,595 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1343 [2018-02-04 18:50:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:42,599 INFO L225 Difference]: With dead ends: 1513 [2018-02-04 18:50:42,599 INFO L226 Difference]: Without dead ends: 1504 [2018-02-04 18:50:42,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1468 GetRequests, 1305 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8972 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3880, Invalid=23180, Unknown=0, NotChecked=0, Total=27060 [2018-02-04 18:50:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-02-04 18:50:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1371. [2018-02-04 18:50:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-02-04 18:50:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1375 transitions. [2018-02-04 18:50:42,610 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1375 transitions. Word has length 1343 [2018-02-04 18:50:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:42,610 INFO L432 AbstractCegarLoop]: Abstraction has 1371 states and 1375 transitions. [2018-02-04 18:50:42,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 18:50:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1375 transitions. [2018-02-04 18:50:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2018-02-04 18:50:42,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:42,619 INFO L351 BasicCegarLoop]: trace histogram [206, 189, 189, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:50:42,619 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash -616680001, now seen corresponding path program 35 times [2018-02-04 18:50:42,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:42,619 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:42,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:42,620 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:42,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:42,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-02-04 18:50:45,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:45,599 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:45,600 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:50:49,480 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-04 18:50:49,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:50,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:50,066 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 18:50:50,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:50:50,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:50:50,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:50:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 114363 backedges. 19703 proven. 990 refuted. 0 times theorem prover too weak. 93670 trivial. 0 not checked. [2018-02-04 18:50:52,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:50:52,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2018-02-04 18:50:52,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 18:50:52,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 18:50:52,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1573, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 18:50:52,345 INFO L87 Difference]: Start difference. First operand 1371 states and 1375 transitions. Second operand 46 states. [2018-02-04 18:50:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:50:53,430 INFO L93 Difference]: Finished difference Result 1391 states and 1396 transitions. [2018-02-04 18:50:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:50:53,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1349 [2018-02-04 18:50:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:50:53,433 INFO L225 Difference]: With dead ends: 1391 [2018-02-04 18:50:53,433 INFO L226 Difference]: Without dead ends: 1391 [2018-02-04 18:50:53,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1293 SyntacticMatches, 34 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=3340, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 18:50:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-02-04 18:50:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1377. [2018-02-04 18:50:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-02-04 18:50:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1382 transitions. [2018-02-04 18:50:53,440 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1382 transitions. Word has length 1349 [2018-02-04 18:50:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:50:53,440 INFO L432 AbstractCegarLoop]: Abstraction has 1377 states and 1382 transitions. [2018-02-04 18:50:53,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 18:50:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1382 transitions. [2018-02-04 18:50:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2018-02-04 18:50:53,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:50:53,448 INFO L351 BasicCegarLoop]: trace histogram [207, 190, 190, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:50:53,448 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:50:53,448 INFO L82 PathProgramCache]: Analyzing trace with hash -888325561, now seen corresponding path program 36 times [2018-02-04 18:50:53,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:50:53,448 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:50:53,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:53,449 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:50:53,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:50:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:50:53,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:50:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 21803 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-02-04 18:50:56,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:50:56,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:50:56,816 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 18:50:59,013 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-02-04 18:50:59,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:50:59,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:50:59,106 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 18:50:59,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:50:59,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:50:59,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:51:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 115529 backedges. 20641 proven. 5592 refuted. 0 times theorem prover too weak. 89296 trivial. 0 not checked. [2018-02-04 18:51:01,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:01,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 70 [2018-02-04 18:51:01,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 18:51:01,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 18:51:01,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=4037, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 18:51:01,912 INFO L87 Difference]: Start difference. First operand 1377 states and 1382 transitions. Second operand 70 states. [2018-02-04 18:51:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:04,020 INFO L93 Difference]: Finished difference Result 1508 states and 1514 transitions. [2018-02-04 18:51:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-02-04 18:51:04,021 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 1355 [2018-02-04 18:51:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:04,023 INFO L225 Difference]: With dead ends: 1508 [2018-02-04 18:51:04,023 INFO L226 Difference]: Without dead ends: 1508 [2018-02-04 18:51:04,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1296 SyntacticMatches, 32 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2963, Invalid=13293, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 18:51:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2018-02-04 18:51:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1503. [2018-02-04 18:51:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-02-04 18:51:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1509 transitions. [2018-02-04 18:51:04,032 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1509 transitions. Word has length 1355 [2018-02-04 18:51:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:04,032 INFO L432 AbstractCegarLoop]: Abstraction has 1503 states and 1509 transitions. [2018-02-04 18:51:04,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 18:51:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1509 transitions. [2018-02-04 18:51:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2018-02-04 18:51:04,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:04,041 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 18:51:04,041 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1787536920, now seen corresponding path program 37 times [2018-02-04 18:51:04,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:04,042 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:04,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:04,042 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:04,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:04,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 45982 proven. 9625 refuted. 0 times theorem prover too weak. 82561 trivial. 0 not checked. [2018-02-04 18:51:08,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:08,210 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:08,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:51:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:08,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 46011 proven. 9596 refuted. 0 times theorem prover too weak. 82561 trivial. 0 not checked. [2018-02-04 18:51:09,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:09,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 74 [2018-02-04 18:51:09,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 18:51:09,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 18:51:09,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=918, Invalid=4484, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 18:51:09,506 INFO L87 Difference]: Start difference. First operand 1503 states and 1509 transitions. Second operand 74 states. [2018-02-04 18:51:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:10,553 INFO L93 Difference]: Finished difference Result 1520 states and 1524 transitions. [2018-02-04 18:51:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 18:51:10,553 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1475 [2018-02-04 18:51:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:10,556 INFO L225 Difference]: With dead ends: 1520 [2018-02-04 18:51:10,556 INFO L226 Difference]: Without dead ends: 1514 [2018-02-04 18:51:10,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1567 GetRequests, 1447 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3002, Invalid=11760, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 18:51:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-02-04 18:51:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1503. [2018-02-04 18:51:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-02-04 18:51:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1507 transitions. [2018-02-04 18:51:10,563 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1507 transitions. Word has length 1475 [2018-02-04 18:51:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:10,564 INFO L432 AbstractCegarLoop]: Abstraction has 1503 states and 1507 transitions. [2018-02-04 18:51:10,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 18:51:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1507 transitions. [2018-02-04 18:51:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-02-04 18:51:10,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:10,573 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 18:51:10,573 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:10,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1693559968, now seen corresponding path program 38 times [2018-02-04 18:51:10,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:10,573 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:10,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:10,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:51:10,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:10,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:14,269 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 18:51:14,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:14,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:14,270 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:51:14,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:51:14,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:14,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:14,358 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 18:51:14,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:51:14,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:51:14,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:51:16,644 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 18:51:16,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:16,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-02-04 18:51:16,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 18:51:16,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 18:51:16,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=415, Unknown=0, NotChecked=0, Total=702 [2018-02-04 18:51:16,646 INFO L87 Difference]: Start difference. First operand 1503 states and 1507 transitions. Second operand 27 states. [2018-02-04 18:51:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:17,100 INFO L93 Difference]: Finished difference Result 1523 states and 1528 transitions. [2018-02-04 18:51:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:51:17,100 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1481 [2018-02-04 18:51:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:17,103 INFO L225 Difference]: With dead ends: 1523 [2018-02-04 18:51:17,103 INFO L226 Difference]: Without dead ends: 1523 [2018-02-04 18:51:17,104 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 18:51:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-02-04 18:51:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1509. [2018-02-04 18:51:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2018-02-04 18:51:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1514 transitions. [2018-02-04 18:51:17,113 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1514 transitions. Word has length 1481 [2018-02-04 18:51:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:17,114 INFO L432 AbstractCegarLoop]: Abstraction has 1509 states and 1514 transitions. [2018-02-04 18:51:17,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 18:51:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1514 transitions. [2018-02-04 18:51:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-02-04 18:51:17,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:17,124 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 18:51:17,124 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 39 times [2018-02-04 18:51:17,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:17,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:17,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:17,125 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:17,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:17,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:21,326 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 18:51:21,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:21,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:21,327 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:51:21,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-02-04 18:51:21,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:21,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:21,484 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 18:51:21,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:51:21,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:51:21,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:51:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 24210 proven. 1220 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-02-04 18:51:24,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:24,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 26] total 69 [2018-02-04 18:51:24,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 18:51:24,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 18:51:24,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 18:51:24,633 INFO L87 Difference]: Start difference. First operand 1509 states and 1514 transitions. Second operand 69 states. [2018-02-04 18:51:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:27,606 INFO L93 Difference]: Finished difference Result 1669 states and 1676 transitions. [2018-02-04 18:51:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 18:51:27,606 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1487 [2018-02-04 18:51:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:27,609 INFO L225 Difference]: With dead ends: 1669 [2018-02-04 18:51:27,609 INFO L226 Difference]: Without dead ends: 1669 [2018-02-04 18:51:27,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1614 GetRequests, 1429 SyntacticMatches, 35 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3986, Invalid=18966, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 18:51:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-02-04 18:51:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1647. [2018-02-04 18:51:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2018-02-04 18:51:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 1654 transitions. [2018-02-04 18:51:27,626 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 1654 transitions. Word has length 1487 [2018-02-04 18:51:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:27,627 INFO L432 AbstractCegarLoop]: Abstraction has 1647 states and 1654 transitions. [2018-02-04 18:51:27,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 18:51:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1654 transitions. [2018-02-04 18:51:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-02-04 18:51:27,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:27,638 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 18:51:27,638 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1063873865, now seen corresponding path program 40 times [2018-02-04 18:51:27,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:27,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:27,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:27,639 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:27,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:27,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 69916 proven. 3474 refuted. 0 times theorem prover too weak. 95049 trivial. 0 not checked. [2018-02-04 18:51:32,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:32,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:32,720 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 18:51:32,799 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 18:51:32,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:32,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 47426 proven. 5793 refuted. 0 times theorem prover too weak. 115220 trivial. 0 not checked. [2018-02-04 18:51:34,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:34,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49] total 92 [2018-02-04 18:51:34,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-02-04 18:51:34,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-02-04 18:51:34,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1197, Invalid=7175, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 18:51:34,431 INFO L87 Difference]: Start difference. First operand 1647 states and 1654 transitions. Second operand 92 states. [2018-02-04 18:51:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:37,266 INFO L93 Difference]: Finished difference Result 1805 states and 1812 transitions. [2018-02-04 18:51:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 18:51:37,266 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1619 [2018-02-04 18:51:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:37,270 INFO L225 Difference]: With dead ends: 1805 [2018-02-04 18:51:37,270 INFO L226 Difference]: Without dead ends: 1799 [2018-02-04 18:51:37,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1751 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4888, Invalid=26618, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 18:51:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-02-04 18:51:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1785. [2018-02-04 18:51:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-02-04 18:51:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1791 transitions. [2018-02-04 18:51:37,282 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1791 transitions. Word has length 1619 [2018-02-04 18:51:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:37,282 INFO L432 AbstractCegarLoop]: Abstraction has 1785 states and 1791 transitions. [2018-02-04 18:51:37,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-02-04 18:51:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1791 transitions. [2018-02-04 18:51:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-02-04 18:51:37,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:37,295 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 18:51:37,295 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 41 times [2018-02-04 18:51:37,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:37,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:37,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:37,296 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:37,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:37,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:51:43,623 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 18:51:43,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:51:43,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:51:43,624 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 18:51:48,475 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 18:51:48,476 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:51:48,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:51:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 59559 proven. 11698 refuted. 0 times theorem prover too weak. 128913 trivial. 0 not checked. [2018-02-04 18:51:50,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:51:50,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 55] total 96 [2018-02-04 18:51:50,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-02-04 18:51:50,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-02-04 18:51:50,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1214, Invalid=7906, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 18:51:50,520 INFO L87 Difference]: Start difference. First operand 1785 states and 1791 transitions. Second operand 96 states. [2018-02-04 18:51:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:51:53,294 INFO L93 Difference]: Finished difference Result 1802 states and 1806 transitions. [2018-02-04 18:51:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-02-04 18:51:53,295 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1757 [2018-02-04 18:51:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:51:53,298 INFO L225 Difference]: With dead ends: 1802 [2018-02-04 18:51:53,298 INFO L226 Difference]: Without dead ends: 1796 [2018-02-04 18:51:53,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1868 GetRequests, 1711 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7938 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3956, Invalid=21166, Unknown=0, NotChecked=0, Total=25122 [2018-02-04 18:51:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-02-04 18:51:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1785. [2018-02-04 18:51:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-02-04 18:51:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1789 transitions. [2018-02-04 18:51:53,307 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1789 transitions. Word has length 1757 [2018-02-04 18:51:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:51:53,308 INFO L432 AbstractCegarLoop]: Abstraction has 1785 states and 1789 transitions. [2018-02-04 18:51:53,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-02-04 18:51:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1789 transitions. [2018-02-04 18:51:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-02-04 18:51:53,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:51:53,320 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 18:51:53,320 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 18:51:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -840334726, now seen corresponding path program 42 times [2018-02-04 18:51:53,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:51:53,321 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:51:53,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:53,321 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:51:53,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:51:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:51:53,396 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 18:51:56,734 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.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) 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 18:51:56,736 INFO L168 Benchmark]: Toolchain (without parser) took 175359.71 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 362.2 MB in the beginning and 1.2 GB in the end (delta: -794.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 18:51:56,737 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:51:56,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 118.54 ms. Allocated memory is still 404.2 MB. Free memory was 362.2 MB in the beginning and 354.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 18:51:56,738 INFO L168 Benchmark]: Boogie Preprocessor took 20.71 ms. Allocated memory is still 404.2 MB. Free memory was 354.1 MB in the beginning and 351.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:51:56,738 INFO L168 Benchmark]: RCFGBuilder took 157.69 ms. Allocated memory is still 404.2 MB. Free memory was 351.5 MB in the beginning and 335.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-02-04 18:51:56,738 INFO L168 Benchmark]: TraceAbstraction took 175060.49 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.1 MB in the beginning and 1.2 GB in the end (delta: -822.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 18:51:56,739 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 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 118.54 ms. Allocated memory is still 404.2 MB. Free memory was 362.2 MB in the beginning and 354.1 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.71 ms. Allocated memory is still 404.2 MB. Free memory was 354.1 MB in the beginning and 351.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 157.69 ms. Allocated memory is still 404.2 MB. Free memory was 351.5 MB in the beginning and 335.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175060.49 ms. Allocated memory was 404.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.1 MB in the beginning and 1.2 GB in the end (delta: -822.9 MB). Peak memory consumption was 2.1 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.walkResolutionNode(Interpolator.java:235) 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_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-51-56-744.csv Completed graceful shutdown