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-a74eeac-m [2018-02-02 21:04:40,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:04:40,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:04:40,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:04:40,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:04:40,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:04:40,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:04:40,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:04:40,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:04:40,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:04:40,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:04:40,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:04:40,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:04:40,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:04:40,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:04:40,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:04:40,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:04:40,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:04:40,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:04:40,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:04:40,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:04:40,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:04:40,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:04:40,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:04:40,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:04:40,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:04:40,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:04:40,819 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:04:40,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:04:40,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:04:40,820 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:04:40,820 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-02 21:04:40,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:04:40,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:04:40,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:04:40,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:04:40,832 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:04:40,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:04:40,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:04:40,833 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:04:40,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:04:40,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:04:40,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:04:40,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:04:40,835 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:04:40,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:04:40,835 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:04:40,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:04:40,876 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:04:40,880 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:04:40,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:04:40,882 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:04:40,882 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-02 21:04:40,982 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:04:40,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:04:40,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:04:40,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:04:40,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:04:40,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:04:40" (1/1) ... [2018-02-02 21:04:40,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648881c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:40, skipping insertion in model container [2018-02-02 21:04:40,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:04:40" (1/1) ... [2018-02-02 21:04:41,001 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:04:41,012 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:04:41,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:04:41,109 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:04:41,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41 WrapperNode [2018-02-02 21:04:41,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:04:41,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:04:41,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:04:41,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:04:41,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (1/1) ... [2018-02-02 21:04:41,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:04:41,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:04:41,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:04:41,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:04:41,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (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-02 21:04:41,181 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:04:41,181 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:04:41,181 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 21:04:41,182 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:04:41,182 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 21:04:41,183 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:04:41,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:04:41,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:04:41,314 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:04:41,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:04:41 BoogieIcfgContainer [2018-02-02 21:04:41,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:04:41,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:04:41,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:04:41,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:04:41,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:04:40" (1/3) ... [2018-02-02 21:04:41,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:04:41, skipping insertion in model container [2018-02-02 21:04:41,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:04:41" (2/3) ... [2018-02-02 21:04:41,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ec33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:04:41, skipping insertion in model container [2018-02-02 21:04:41,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:04:41" (3/3) ... [2018-02-02 21:04:41,319 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-02-02 21:04:41,324 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:04:41,328 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 21:04:41,364 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:04:41,365 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:04:41,365 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:04:41,365 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:04:41,365 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:04:41,365 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:04:41,365 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:04:41,365 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:04:41,366 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:04:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 21:04:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 21:04:41,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:41,386 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:04:41,386 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 21:04:41,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:41,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:41,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:41,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:41,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:41,553 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-02 21:04:41,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:41,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:04:41,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:04:41,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:04:41,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:04:41,569 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 21:04:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:41,626 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 21:04:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:04:41,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 21:04:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:41,633 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:04:41,633 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:04:41,634 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-02 21:04:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:04:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 21:04:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 21:04:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 21:04:41,701 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 21:04:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:41,701 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 21:04:41,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:04:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 21:04:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:04:41,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:41,702 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:04:41,702 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 21:04:41,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:41,703 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:41,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:41,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:41,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:41,766 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-02 21:04:41,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:41,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:04:41,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:04:41,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:04:41,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:04:41,768 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-02 21:04:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:41,893 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 21:04:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:04:41,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 21:04:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:41,895 INFO L225 Difference]: With dead ends: 91 [2018-02-02 21:04:41,895 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 21:04:41,896 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-02 21:04:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 21:04:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-02-02 21:04:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 21:04:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-02-02 21:04:41,902 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-02-02 21:04:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:41,902 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-02-02 21:04:41,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:04:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-02-02 21:04:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:04:41,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:41,903 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:04:41,903 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:41,903 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-02 21:04:41,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:41,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:41,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:41,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:41,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,060 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-02 21:04:42,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:42,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:04:42,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:04:42,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:04:42,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:04:42,061 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 8 states. [2018-02-02 21:04:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:42,247 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 21:04:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:04:42,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 21:04:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:42,249 INFO L225 Difference]: With dead ends: 75 [2018-02-02 21:04:42,249 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 21:04:42,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:04:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 21:04:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-02 21:04:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 21:04:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 21:04:42,253 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-02-02 21:04:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:42,253 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 21:04:42,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:04:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 21:04:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:04:42,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:42,254 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:04:42,254 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-02 21:04:42,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:42,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:42,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,292 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-02 21:04:42,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:42,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:04:42,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:04:42,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:04:42,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:04:42,293 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-02-02 21:04:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:42,315 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-02 21:04:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:04:42,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:04:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:42,316 INFO L225 Difference]: With dead ends: 65 [2018-02-02 21:04:42,316 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 21:04:42,317 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-02 21:04:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 21:04:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 21:04:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 21:04:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-02 21:04:42,320 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-02-02 21:04:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:42,321 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-02 21:04:42,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:04:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-02 21:04:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 21:04:42,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:42,321 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-02 21:04:42,321 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-02 21:04:42,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:42,322 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:42,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,420 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-02 21:04:42,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:42,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:42,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:42,478 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-02 21:04:42,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:42,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-02-02 21:04:42,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:04:42,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:04:42,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:04:42,479 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-02-02 21:04:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:42,635 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-02 21:04:42,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:04:42,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 21:04:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:42,636 INFO L225 Difference]: With dead ends: 105 [2018-02-02 21:04:42,636 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 21:04:42,636 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-02 21:04:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 21:04:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-02-02 21:04:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 21:04:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-02 21:04:42,641 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-02-02 21:04:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:42,641 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-02 21:04:42,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:04:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-02 21:04:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:04:42,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:42,642 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-02 21:04:42,642 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-02-02 21:04:42,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:42,642 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:42,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,686 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-02 21:04:42,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:42,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:04:42,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:04:42,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:04:42,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:04:42,687 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-02-02 21:04:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:42,730 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 21:04:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:04:42,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 21:04:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:42,735 INFO L225 Difference]: With dead ends: 85 [2018-02-02 21:04:42,735 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 21:04:42,735 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-02 21:04:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 21:04:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-02 21:04:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 21:04:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-02 21:04:42,741 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-02-02 21:04:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:42,741 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-02 21:04:42,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:04:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-02 21:04:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 21:04:42,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:42,742 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-02 21:04:42,742 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-02 21:04:42,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:42,743 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:42,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,779 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-02 21:04:42,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:42,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:42,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:42,808 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-02 21:04:42,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:42,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-02 21:04:42,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:04:42,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:04:42,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:04:42,809 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 5 states. [2018-02-02 21:04:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:42,851 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 21:04:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:04:42,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-02 21:04:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:42,852 INFO L225 Difference]: With dead ends: 99 [2018-02-02 21:04:42,853 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 21:04:42,853 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-02 21:04:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 21:04:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2018-02-02 21:04:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 21:04:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-02 21:04:42,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 37 [2018-02-02 21:04:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:42,859 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-02 21:04:42,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:04:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-02 21:04:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 21:04:42,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:42,860 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-02 21:04:42,861 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-02-02 21:04:42,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:42,861 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:42,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:42,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:42,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:42,964 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-02 21:04:42,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:42,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:42,965 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:04:42,980 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:04:42,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:42,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:43,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:04:43,030 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-02 21:04:43,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:43,033 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-02 21:04:43,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:04:43,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:04:43,056 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-02 21:04:43,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:43,058 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-02 21:04:43,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:04:43,081 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-02 21:04:43,090 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-02 21:04:43,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:04:43,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-02-02 21:04:43,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:04:43,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:04:43,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-02-02 21:04:43,093 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 10 states. [2018-02-02 21:04:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:43,307 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-02 21:04:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:04:43,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-02-02 21:04:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:43,309 INFO L225 Difference]: With dead ends: 105 [2018-02-02 21:04:43,309 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 21:04:43,309 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-02 21:04:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 21:04:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-02-02 21:04:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 21:04:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 21:04:43,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 49 [2018-02-02 21:04:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:43,312 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 21:04:43,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:04:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 21:04:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 21:04:43,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:43,313 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-02 21:04:43,313 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-02-02 21:04:43,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:43,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:43,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:43,314 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:43,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:43,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:43,478 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-02 21:04:43,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:43,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:43,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:43,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:43,565 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-02 21:04:43,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:43,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-02-02 21:04:43,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:04:43,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:04:43,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:04:43,566 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 16 states. [2018-02-02 21:04:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:43,937 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-02 21:04:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:04:43,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 21:04:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:43,938 INFO L225 Difference]: With dead ends: 133 [2018-02-02 21:04:43,938 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 21:04:43,939 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-02 21:04:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 21:04:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2018-02-02 21:04:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 21:04:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-02-02 21:04:43,945 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 59 [2018-02-02 21:04:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:43,945 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-02-02 21:04:43,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:04:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-02-02 21:04:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 21:04:43,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:43,947 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-02 21:04:43,947 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash -480231808, now seen corresponding path program 2 times [2018-02-02 21:04:43,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:43,947 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:43,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:43,948 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:43,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:43,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:44,011 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-02 21:04:44,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:04:44,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:04:44,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:04:44,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:04:44,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:04:44,012 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2018-02-02 21:04:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:44,052 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-02 21:04:44,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:04:44,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-02-02 21:04:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:44,054 INFO L225 Difference]: With dead ends: 111 [2018-02-02 21:04:44,054 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 21:04:44,054 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-02 21:04:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 21:04:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 21:04:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 21:04:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-02 21:04:44,058 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 77 [2018-02-02 21:04:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:44,059 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-02 21:04:44,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:04:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-02 21:04:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 21:04:44,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:44,060 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-02 21:04:44,060 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash 49530632, now seen corresponding path program 3 times [2018-02-02 21:04:44,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:44,061 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:44,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,061 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:44,062 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:44,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:44,127 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-02 21:04:44,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:44,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:44,128 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:04:44,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 21:04:44,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:44,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:44,164 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-02 21:04:44,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:44,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:44,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:44,331 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-02 21:04:44,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:44,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-02-02 21:04:44,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:04:44,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:04:44,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:04:44,332 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 16 states. [2018-02-02 21:04:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:44,592 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-02 21:04:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:04:44,592 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-02-02 21:04:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:44,593 INFO L225 Difference]: With dead ends: 154 [2018-02-02 21:04:44,593 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 21:04:44,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:04:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 21:04:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-02 21:04:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 21:04:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-02 21:04:44,598 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 83 [2018-02-02 21:04:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:44,598 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-02 21:04:44,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:04:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-02 21:04:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 21:04:44,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:44,600 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-02 21:04:44,600 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 519451937, now seen corresponding path program 4 times [2018-02-02 21:04:44,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:44,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:44,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,602 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:44,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:44,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:44,694 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-02 21:04:44,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:44,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:44,695 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:04:44,705 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:04:44,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:44,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:44,760 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-02 21:04:44,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:44,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-02 21:04:44,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:04:44,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:04:44,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:04:44,762 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 12 states. [2018-02-02 21:04:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:44,821 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-02-02 21:04:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:04:44,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-02-02 21:04:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:44,822 INFO L225 Difference]: With dead ends: 151 [2018-02-02 21:04:44,822 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 21:04:44,822 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-02 21:04:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 21:04:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2018-02-02 21:04:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 21:04:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 21:04:44,826 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 113 [2018-02-02 21:04:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:44,826 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 21:04:44,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:04:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 21:04:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-02 21:04:44,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:44,827 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-02 21:04:44,827 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 5 times [2018-02-02 21:04:44,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:44,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:44,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,828 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:44,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:44,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:45,023 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-02 21:04:45,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:45,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:45,024 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:04:45,048 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-02 21:04:45,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:45,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:45,129 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-02 21:04:45,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:45,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-02-02 21:04:45,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:04:45,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:04:45,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:04:45,130 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 18 states. [2018-02-02 21:04:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:45,414 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-02-02 21:04:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:04:45,415 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-02-02 21:04:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:45,416 INFO L225 Difference]: With dead ends: 174 [2018-02-02 21:04:45,416 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 21:04:45,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-02 21:04:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 21:04:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2018-02-02 21:04:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 21:04:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-02 21:04:45,422 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 125 [2018-02-02 21:04:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:45,422 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-02 21:04:45,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:04:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-02 21:04:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 21:04:45,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:45,424 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-02 21:04:45,424 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 6 times [2018-02-02 21:04:45,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:45,425 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:45,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:45,425 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:45,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:45,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:45,686 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-02 21:04:45,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:45,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:45,687 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:04:45,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-02 21:04:45,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:45,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:45,961 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-02 21:04:45,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:45,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2018-02-02 21:04:45,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 21:04:45,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 21:04:45,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 21:04:45,962 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 26 states. [2018-02-02 21:04:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:46,749 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2018-02-02 21:04:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:04:46,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-02-02 21:04:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:46,750 INFO L225 Difference]: With dead ends: 220 [2018-02-02 21:04:46,750 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 21:04:46,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:04:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 21:04:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2018-02-02 21:04:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 21:04:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 207 transitions. [2018-02-02 21:04:46,753 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 207 transitions. Word has length 137 [2018-02-02 21:04:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:46,753 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 207 transitions. [2018-02-02 21:04:46,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 21:04:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 207 transitions. [2018-02-02 21:04:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-02 21:04:46,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:46,755 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-02 21:04:46,755 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 7 times [2018-02-02 21:04:46,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:46,755 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:46,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:46,756 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:46,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:46,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:46,921 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-02 21:04:46,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:46,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:46,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:46,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:47,089 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-02 21:04:47,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:47,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-02 21:04:47,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 21:04:47,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 21:04:47,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:04:47,091 INFO L87 Difference]: Start difference. First operand 201 states and 207 transitions. Second operand 25 states. [2018-02-02 21:04:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:47,604 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-02-02 21:04:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 21:04:47,604 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-02-02 21:04:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:47,606 INFO L225 Difference]: With dead ends: 269 [2018-02-02 21:04:47,606 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 21:04:47,607 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-02 21:04:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 21:04:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 249. [2018-02-02 21:04:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 21:04:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2018-02-02 21:04:47,612 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 254 transitions. Word has length 179 [2018-02-02 21:04:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:47,612 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 254 transitions. [2018-02-02 21:04:47,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 21:04:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 254 transitions. [2018-02-02 21:04:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 21:04:47,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:47,615 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-02 21:04:47,615 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 8 times [2018-02-02 21:04:47,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:47,615 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:47,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:47,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:47,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:47,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:47,826 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-02 21:04:47,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:47,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:47,827 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:04:47,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:04:47,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:47,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:47,938 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-02 21:04:47,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:47,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-02-02 21:04:47,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:04:47,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:04:47,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:04:47,939 INFO L87 Difference]: Start difference. First operand 249 states and 254 transitions. Second operand 20 states. [2018-02-02 21:04:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:48,080 INFO L93 Difference]: Finished difference Result 263 states and 266 transitions. [2018-02-02 21:04:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:04:48,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-02-02 21:04:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:48,081 INFO L225 Difference]: With dead ends: 263 [2018-02-02 21:04:48,081 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 21:04:48,081 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-02 21:04:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 21:04:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2018-02-02 21:04:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 21:04:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-02-02 21:04:48,085 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 227 [2018-02-02 21:04:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:48,086 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-02-02 21:04:48,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:04:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-02-02 21:04:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-02 21:04:48,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:48,089 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-02 21:04:48,089 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 9 times [2018-02-02 21:04:48,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:48,089 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:48,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:48,090 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:48,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:48,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:48,419 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-02 21:04:48,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:48,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:48,420 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:04:48,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-02 21:04:48,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:48,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:48,475 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-02 21:04:48,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:48,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:48,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:48,849 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-02 21:04:48,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:48,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-02 21:04:48,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:04:48,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:04:48,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:04:48,850 INFO L87 Difference]: Start difference. First operand 249 states and 252 transitions. Second operand 21 states. [2018-02-02 21:04:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:49,258 INFO L93 Difference]: Finished difference Result 326 states and 332 transitions. [2018-02-02 21:04:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 21:04:49,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-02-02 21:04:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:49,259 INFO L225 Difference]: With dead ends: 326 [2018-02-02 21:04:49,259 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 21:04:49,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:04:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 21:04:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 303. [2018-02-02 21:04:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 21:04:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 308 transitions. [2018-02-02 21:04:49,264 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 308 transitions. Word has length 233 [2018-02-02 21:04:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:49,264 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 308 transitions. [2018-02-02 21:04:49,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:04:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 308 transitions. [2018-02-02 21:04:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-02 21:04:49,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:49,265 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-02 21:04:49,265 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 10 times [2018-02-02 21:04:49,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:49,266 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:49,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:49,266 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:49,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:49,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:49,536 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-02 21:04:49,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:49,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:49,537 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:04:49,562 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:04:49,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:49,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:49,840 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-02 21:04:49,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:49,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-02-02 21:04:49,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 21:04:49,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 21:04:49,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 21:04:49,842 INFO L87 Difference]: Start difference. First operand 303 states and 308 transitions. Second operand 34 states. [2018-02-02 21:04:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:50,464 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-02-02 21:04:50,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:04:50,464 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-02-02 21:04:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:50,465 INFO L225 Difference]: With dead ends: 325 [2018-02-02 21:04:50,465 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 21:04:50,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 21:04:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 21:04:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 309. [2018-02-02 21:04:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 21:04:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-02-02 21:04:50,469 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 287 [2018-02-02 21:04:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:50,471 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-02-02 21:04:50,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 21:04:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-02-02 21:04:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-02 21:04:50,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:50,472 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-02 21:04:50,473 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 11 times [2018-02-02 21:04:50,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:50,473 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:50,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:50,473 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:50,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:50,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:50,834 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-02 21:04:50,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:50,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:50,835 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:04:51,066 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-02-02 21:04:51,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:51,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:51,149 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-02 21:04:51,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:51,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:51,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:51,600 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-02 21:04:51,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:51,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-02 21:04:51,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:04:51,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:04:51,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:04:51,601 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 24 states. [2018-02-02 21:04:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:51,974 INFO L93 Difference]: Finished difference Result 326 states and 330 transitions. [2018-02-02 21:04:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:04:51,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 293 [2018-02-02 21:04:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:51,976 INFO L225 Difference]: With dead ends: 326 [2018-02-02 21:04:51,976 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 21:04:51,976 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-02 21:04:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 21:04:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2018-02-02 21:04:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 21:04:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 319 transitions. [2018-02-02 21:04:51,982 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 319 transitions. Word has length 293 [2018-02-02 21:04:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:51,982 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 319 transitions. [2018-02-02 21:04:51,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:04:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 319 transitions. [2018-02-02 21:04:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-02-02 21:04:51,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:51,984 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-02 21:04:51,985 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:51,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 12 times [2018-02-02 21:04:51,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:51,985 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:51,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:51,986 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:51,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:52,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:52,296 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-02 21:04:52,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:52,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:52,297 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:04:52,365 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-02 21:04:52,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:52,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:52,377 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-02 21:04:52,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:52,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:52,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:52,960 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-02 21:04:52,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:52,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-02-02 21:04:52,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 21:04:52,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 21:04:52,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:04:52,961 INFO L87 Difference]: Start difference. First operand 315 states and 319 transitions. Second operand 33 states. [2018-02-02 21:04:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:53,979 INFO L93 Difference]: Finished difference Result 400 states and 406 transitions. [2018-02-02 21:04:53,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 21:04:53,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 299 [2018-02-02 21:04:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:53,980 INFO L225 Difference]: With dead ends: 400 [2018-02-02 21:04:53,981 INFO L226 Difference]: Without dead ends: 400 [2018-02-02 21:04:53,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 277 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=854, Invalid=3702, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 21:04:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-02 21:04:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 381. [2018-02-02 21:04:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 21:04:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 387 transitions. [2018-02-02 21:04:53,988 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 387 transitions. Word has length 299 [2018-02-02 21:04:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:53,988 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 387 transitions. [2018-02-02 21:04:53,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 21:04:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 387 transitions. [2018-02-02 21:04:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-02 21:04:53,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:53,991 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-02 21:04:53,991 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1422188691, now seen corresponding path program 13 times [2018-02-02 21:04:53,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:53,992 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:53,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:53,992 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:53,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:54,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:54,371 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-02 21:04:54,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:54,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:54,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:54,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:54,732 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-02 21:04:54,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:54,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2018-02-02 21:04:54,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:04:54,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:04:54,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:04:54,733 INFO L87 Difference]: Start difference. First operand 381 states and 387 transitions. Second operand 37 states. [2018-02-02 21:04:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:55,447 INFO L93 Difference]: Finished difference Result 467 states and 472 transitions. [2018-02-02 21:04:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 21:04:55,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 359 [2018-02-02 21:04:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:55,449 INFO L225 Difference]: With dead ends: 467 [2018-02-02 21:04:55,449 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 21:04:55,449 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-02 21:04:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 21:04:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447. [2018-02-02 21:04:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-02 21:04:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 452 transitions. [2018-02-02 21:04:55,454 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 452 transitions. Word has length 359 [2018-02-02 21:04:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:55,454 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 452 transitions. [2018-02-02 21:04:55,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:04:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 452 transitions. [2018-02-02 21:04:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-02-02 21:04:55,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:55,456 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-02 21:04:55,456 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1961864906, now seen corresponding path program 14 times [2018-02-02 21:04:55,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:55,456 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:55,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:55,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:04:55,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:55,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:55,913 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-02 21:04:55,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:55,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:55,914 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:04:55,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:04:55,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:55,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:55,976 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-02 21:04:55,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:55,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:55,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:56,728 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-02 21:04:56,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:56,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2018-02-02 21:04:56,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:04:56,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:04:56,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:04:56,761 INFO L87 Difference]: Start difference. First operand 447 states and 452 transitions. Second operand 35 states. [2018-02-02 21:04:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:58,335 INFO L93 Difference]: Finished difference Result 536 states and 540 transitions. [2018-02-02 21:04:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-02 21:04:58,335 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 425 [2018-02-02 21:04:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:58,336 INFO L225 Difference]: With dead ends: 536 [2018-02-02 21:04:58,336 INFO L226 Difference]: Without dead ends: 527 [2018-02-02 21:04:58,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 406 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4265 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1855, Invalid=8651, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 21:04:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-02 21:04:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 513. [2018-02-02 21:04:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-02-02 21:04:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 517 transitions. [2018-02-02 21:04:58,347 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 517 transitions. Word has length 425 [2018-02-02 21:04:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:58,348 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 517 transitions. [2018-02-02 21:04:58,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:04:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 517 transitions. [2018-02-02 21:04:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-02-02 21:04:58,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:58,351 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-02 21:04:58,351 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 439171591, now seen corresponding path program 15 times [2018-02-02 21:04:58,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:58,352 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:58,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:58,352 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:04:58,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:04:58,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:04:59,132 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-02 21:04:59,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:04:59,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:04:59,133 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:04:59,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 21:04:59,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:04:59,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:04:59,224 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-02 21:04:59,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:04:59,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:04:59,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:04:59,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-02 21:04:59,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:04:59,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-02-02 21:04:59,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:04:59,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:04:59,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:04:59,686 INFO L87 Difference]: Start difference. First operand 513 states and 517 transitions. Second operand 17 states. [2018-02-02 21:04:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:04:59,985 INFO L93 Difference]: Finished difference Result 543 states and 549 transitions. [2018-02-02 21:04:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:04:59,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 497 [2018-02-02 21:04:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:04:59,987 INFO L225 Difference]: With dead ends: 543 [2018-02-02 21:04:59,988 INFO L226 Difference]: Without dead ends: 543 [2018-02-02 21:04:59,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 475 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:04:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-02 21:04:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 519. [2018-02-02 21:04:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-02 21:04:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 524 transitions. [2018-02-02 21:04:59,993 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 524 transitions. Word has length 497 [2018-02-02 21:04:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:04:59,994 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 524 transitions. [2018-02-02 21:04:59,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:04:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 524 transitions. [2018-02-02 21:04:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-02 21:04:59,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:04:59,997 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-02 21:04:59,997 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:04:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 16 times [2018-02-02 21:04:59,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:04:59,999 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:04:59,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:04:59,999 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:00,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:00,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:00,731 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-02 21:05:00,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:00,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:00,731 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:05:00,769 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:05:00,769 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:00,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:01,204 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-02 21:05:01,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:01,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 41 [2018-02-02 21:05:01,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:05:01,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:05:01,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:05:01,205 INFO L87 Difference]: Start difference. First operand 519 states and 524 transitions. Second operand 41 states. [2018-02-02 21:05:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:02,636 INFO L93 Difference]: Finished difference Result 625 states and 632 transitions. [2018-02-02 21:05:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 21:05:02,636 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 503 [2018-02-02 21:05:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:02,638 INFO L225 Difference]: With dead ends: 625 [2018-02-02 21:05:02,638 INFO L226 Difference]: Without dead ends: 625 [2018-02-02 21:05:02,639 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-02 21:05:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-02 21:05:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 537. [2018-02-02 21:05:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-02 21:05:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 543 transitions. [2018-02-02 21:05:02,645 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 543 transitions. Word has length 503 [2018-02-02 21:05:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:02,645 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 543 transitions. [2018-02-02 21:05:02,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:05:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 543 transitions. [2018-02-02 21:05:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-02-02 21:05:02,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:02,648 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-02 21:05:02,648 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 17 times [2018-02-02 21:05:02,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:02,648 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:02,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:02,649 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:02,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:02,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:03,444 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-02 21:05:03,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:03,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:03,445 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:05:04,189 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-02 21:05:04,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:04,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:04,949 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-02 21:05:04,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:04,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 30] total 45 [2018-02-02 21:05:04,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 21:05:04,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 21:05:04,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:05:04,951 INFO L87 Difference]: Start difference. First operand 537 states and 543 transitions. Second operand 45 states. [2018-02-02 21:05:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:06,402 INFO L93 Difference]: Finished difference Result 756 states and 773 transitions. [2018-02-02 21:05:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 21:05:06,402 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 515 [2018-02-02 21:05:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:06,404 INFO L225 Difference]: With dead ends: 756 [2018-02-02 21:05:06,404 INFO L226 Difference]: Without dead ends: 756 [2018-02-02 21:05:06,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1171, Invalid=6311, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 21:05:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-02 21:05:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 738. [2018-02-02 21:05:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-02-02 21:05:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 755 transitions. [2018-02-02 21:05:06,418 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 755 transitions. Word has length 515 [2018-02-02 21:05:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:06,418 INFO L432 AbstractCegarLoop]: Abstraction has 738 states and 755 transitions. [2018-02-02 21:05:06,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 21:05:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 755 transitions. [2018-02-02 21:05:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-02-02 21:05:06,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:06,423 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-02 21:05:06,423 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -19559249, now seen corresponding path program 18 times [2018-02-02 21:05:06,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:06,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:06,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:06,424 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:06,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:06,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:06,824 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-02 21:05:06,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:06,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:06,825 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:05:06,876 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-02 21:05:06,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:06,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:07,111 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-02 21:05:07,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:07,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-02-02 21:05:07,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:05:07,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:05:07,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:05:07,113 INFO L87 Difference]: Start difference. First operand 738 states and 755 transitions. Second operand 18 states. [2018-02-02 21:05:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:07,253 INFO L93 Difference]: Finished difference Result 711 states and 722 transitions. [2018-02-02 21:05:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:05:07,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 527 [2018-02-02 21:05:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:07,256 INFO L225 Difference]: With dead ends: 711 [2018-02-02 21:05:07,256 INFO L226 Difference]: Without dead ends: 702 [2018-02-02 21:05:07,256 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-02 21:05:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-02-02 21:05:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2018-02-02 21:05:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-02 21:05:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 710 transitions. [2018-02-02 21:05:07,267 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 710 transitions. Word has length 527 [2018-02-02 21:05:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:07,268 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 710 transitions. [2018-02-02 21:05:07,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:05:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 710 transitions. [2018-02-02 21:05:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-02-02 21:05:07,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:07,272 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-02 21:05:07,272 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash 660674672, now seen corresponding path program 19 times [2018-02-02 21:05:07,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:07,273 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:07,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:07,274 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:07,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:07,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:07,994 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-02 21:05:07,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:07,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:07,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:08,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:08,275 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-02 21:05:08,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:08,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-02-02 21:05:08,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 21:05:08,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 21:05:08,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:05:08,276 INFO L87 Difference]: Start difference. First operand 699 states and 710 transitions. Second operand 32 states. [2018-02-02 21:05:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:08,607 INFO L93 Difference]: Finished difference Result 621 states and 626 transitions. [2018-02-02 21:05:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:05:08,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 587 [2018-02-02 21:05:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:08,608 INFO L225 Difference]: With dead ends: 621 [2018-02-02 21:05:08,608 INFO L226 Difference]: Without dead ends: 612 [2018-02-02 21:05:08,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 21:05:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-02-02 21:05:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2018-02-02 21:05:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-02 21:05:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 614 transitions. [2018-02-02 21:05:08,615 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 614 transitions. Word has length 587 [2018-02-02 21:05:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:08,616 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 614 transitions. [2018-02-02 21:05:08,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 21:05:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 614 transitions. [2018-02-02 21:05:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-02-02 21:05:08,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:08,620 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-02 21:05:08,620 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 20 times [2018-02-02 21:05:08,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:08,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:08,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:08,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:08,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:08,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:09,365 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-02 21:05:09,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:09,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:09,366 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:05:09,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:05:09,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:09,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:09,423 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-02 21:05:09,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:09,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:09,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:10,300 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-02 21:05:10,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:10,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 41 [2018-02-02 21:05:10,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:05:10,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:05:10,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:05:10,301 INFO L87 Difference]: Start difference. First operand 609 states and 614 transitions. Second operand 41 states. [2018-02-02 21:05:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:12,268 INFO L93 Difference]: Finished difference Result 709 states and 714 transitions. [2018-02-02 21:05:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-02 21:05:12,268 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 593 [2018-02-02 21:05:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:12,270 INFO L225 Difference]: With dead ends: 709 [2018-02-02 21:05:12,270 INFO L226 Difference]: Without dead ends: 700 [2018-02-02 21:05:12,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 570 SyntacticMatches, 19 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2682, Invalid=12818, Unknown=0, NotChecked=0, Total=15500 [2018-02-02 21:05:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-02-02 21:05:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 687. [2018-02-02 21:05:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-02-02 21:05:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 691 transitions. [2018-02-02 21:05:12,277 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 691 transitions. Word has length 593 [2018-02-02 21:05:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:12,277 INFO L432 AbstractCegarLoop]: Abstraction has 687 states and 691 transitions. [2018-02-02 21:05:12,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:05:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 691 transitions. [2018-02-02 21:05:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-02-02 21:05:12,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:12,281 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-02 21:05:12,281 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-02-02 21:05:12,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:12,281 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:12,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:12,282 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:12,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:12,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:13,321 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-02 21:05:13,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:13,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:13,322 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:05:13,371 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-02 21:05:13,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:13,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:13,396 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-02 21:05:13,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:13,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:13,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:14,839 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-02 21:05:14,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:14,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 47 [2018-02-02 21:05:14,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 21:05:14,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 21:05:14,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:05:14,840 INFO L87 Difference]: Start difference. First operand 687 states and 691 transitions. Second operand 47 states. [2018-02-02 21:05:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:16,417 INFO L93 Difference]: Finished difference Result 726 states and 731 transitions. [2018-02-02 21:05:16,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 21:05:16,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 677 [2018-02-02 21:05:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:16,418 INFO L225 Difference]: With dead ends: 726 [2018-02-02 21:05:16,418 INFO L226 Difference]: Without dead ends: 720 [2018-02-02 21:05:16,419 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-02 21:05:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-02-02 21:05:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 699. [2018-02-02 21:05:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-02-02 21:05:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 703 transitions. [2018-02-02 21:05:16,427 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 703 transitions. Word has length 677 [2018-02-02 21:05:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:16,428 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 703 transitions. [2018-02-02 21:05:16,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 21:05:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 703 transitions. [2018-02-02 21:05:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-02-02 21:05:16,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:16,432 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-02 21:05:16,433 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 22 times [2018-02-02 21:05:16,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:16,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:16,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:16,434 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:16,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:16,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:17,608 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-02 21:05:17,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:17,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:17,608 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:05:17,638 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:05:17,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:17,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:18,234 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-02 21:05:18,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:18,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 57 [2018-02-02 21:05:18,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 21:05:18,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 21:05:18,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 21:05:18,236 INFO L87 Difference]: Start difference. First operand 699 states and 703 transitions. Second operand 57 states. [2018-02-02 21:05:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:19,384 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-02-02 21:05:19,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 21:05:19,384 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 689 [2018-02-02 21:05:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:19,386 INFO L225 Difference]: With dead ends: 806 [2018-02-02 21:05:19,386 INFO L226 Difference]: Without dead ends: 806 [2018-02-02 21:05:19,387 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-02 21:05:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-02-02 21:05:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-02-02 21:05:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-02 21:05:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-02-02 21:05:19,398 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-02-02 21:05:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:19,399 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-02-02 21:05:19,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 21:05:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-02-02 21:05:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-02-02 21:05:19,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:19,405 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-02 21:05:19,405 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 23 times [2018-02-02 21:05:19,406 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:19,406 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:19,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:19,407 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:19,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:19,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:20,795 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-02 21:05:20,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:20,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:20,795 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:05:21,250 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-02-02 21:05:21,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:21,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:22,002 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-02 21:05:22,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:22,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 59 [2018-02-02 21:05:22,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 21:05:22,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 21:05:22,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2914, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:05:22,003 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 59 states. [2018-02-02 21:05:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:23,619 INFO L93 Difference]: Finished difference Result 809 states and 812 transitions. [2018-02-02 21:05:23,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 21:05:23,619 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 773 [2018-02-02 21:05:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:23,621 INFO L225 Difference]: With dead ends: 809 [2018-02-02 21:05:23,621 INFO L226 Difference]: Without dead ends: 803 [2018-02-02 21:05:23,622 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-02 21:05:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-02 21:05:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 795. [2018-02-02 21:05:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-02-02 21:05:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 798 transitions. [2018-02-02 21:05:23,627 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 798 transitions. Word has length 773 [2018-02-02 21:05:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:23,627 INFO L432 AbstractCegarLoop]: Abstraction has 795 states and 798 transitions. [2018-02-02 21:05:23,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 21:05:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 798 transitions. [2018-02-02 21:05:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-02-02 21:05:23,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:23,631 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-02 21:05:23,631 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash 861490130, now seen corresponding path program 24 times [2018-02-02 21:05:23,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:23,631 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:23,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:23,632 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:23,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:23,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:24,703 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-02 21:05:24,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:24,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:24,703 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:05:24,930 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-02-02 21:05:24,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:24,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:24,959 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-02 21:05:24,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:24,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:24,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:26,139 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-02 21:05:26,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:26,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2018-02-02 21:05:26,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:05:26,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:05:26,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:05:26,140 INFO L87 Difference]: Start difference. First operand 795 states and 798 transitions. Second operand 35 states. [2018-02-02 21:05:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:26,985 INFO L93 Difference]: Finished difference Result 914 states and 920 transitions. [2018-02-02 21:05:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 21:05:26,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 779 [2018-02-02 21:05:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:26,987 INFO L225 Difference]: With dead ends: 914 [2018-02-02 21:05:26,987 INFO L226 Difference]: Without dead ends: 914 [2018-02-02 21:05:26,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 738 SyntacticMatches, 25 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1013, Invalid=3277, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 21:05:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-02 21:05:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 891. [2018-02-02 21:05:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-02-02 21:05:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 896 transitions. [2018-02-02 21:05:26,993 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 896 transitions. Word has length 779 [2018-02-02 21:05:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:26,993 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 896 transitions. [2018-02-02 21:05:26,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:05:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 896 transitions. [2018-02-02 21:05:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-02-02 21:05:26,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:26,999 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-02 21:05:27,000 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1790043837, now seen corresponding path program 25 times [2018-02-02 21:05:27,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:27,000 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:27,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:27,001 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:27,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:27,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:28,458 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-02 21:05:28,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:28,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:28,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:28,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:29,129 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-02 21:05:29,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:29,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 59 [2018-02-02 21:05:29,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 21:05:29,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 21:05:29,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2814, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:05:29,131 INFO L87 Difference]: Start difference. First operand 891 states and 896 transitions. Second operand 59 states. [2018-02-02 21:05:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:30,033 INFO L93 Difference]: Finished difference Result 915 states and 919 transitions. [2018-02-02 21:05:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 21:05:30,033 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 875 [2018-02-02 21:05:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:30,034 INFO L225 Difference]: With dead ends: 915 [2018-02-02 21:05:30,034 INFO L226 Difference]: Without dead ends: 909 [2018-02-02 21:05:30,035 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-02 21:05:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-02-02 21:05:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-02-02 21:05:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-02-02 21:05:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-02-02 21:05:30,043 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-02-02 21:05:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:30,043 INFO L432 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-02-02 21:05:30,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 21:05:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-02-02 21:05:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-02-02 21:05:30,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:30,050 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-02 21:05:30,050 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 26 times [2018-02-02 21:05:30,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:30,050 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:30,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:30,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:30,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:30,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:31,389 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-02 21:05:31,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:31,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:31,390 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:05:31,449 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:05:31,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:31,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:31,463 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-02 21:05:31,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:31,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:31,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:32,599 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-02 21:05:32,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:32,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-02-02 21:05:32,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:05:32,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:05:32,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:05:32,600 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-02-02 21:05:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:32,942 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-02-02 21:05:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:05:32,942 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-02-02 21:05:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:32,944 INFO L225 Difference]: With dead ends: 927 [2018-02-02 21:05:32,944 INFO L226 Difference]: Without dead ends: 927 [2018-02-02 21:05:32,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 851 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:05:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-02-02 21:05:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-02-02 21:05:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-02-02 21:05:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-02-02 21:05:32,950 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-02-02 21:05:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:32,950 INFO L432 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-02-02 21:05:32,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:05:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-02-02 21:05:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-02-02 21:05:32,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:32,954 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-02 21:05:32,954 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 27 times [2018-02-02 21:05:32,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:32,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:32,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:32,955 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:32,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:32,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:34,329 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-02 21:05:34,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:34,329 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:34,330 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:05:34,402 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-02 21:05:34,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:34,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:35,388 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-02 21:05:35,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:35,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 70 [2018-02-02 21:05:35,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-02 21:05:35,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-02 21:05:35,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=4097, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 21:05:35,390 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 70 states. [2018-02-02 21:05:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:37,221 INFO L93 Difference]: Finished difference Result 1021 states and 1026 transitions. [2018-02-02 21:05:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-02 21:05:37,221 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 887 [2018-02-02 21:05:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:37,223 INFO L225 Difference]: With dead ends: 1021 [2018-02-02 21:05:37,223 INFO L226 Difference]: Without dead ends: 1021 [2018-02-02 21:05:37,224 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-02 21:05:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-02-02 21:05:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1011. [2018-02-02 21:05:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-02-02 21:05:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1016 transitions. [2018-02-02 21:05:37,229 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1016 transitions. Word has length 887 [2018-02-02 21:05:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:37,230 INFO L432 AbstractCegarLoop]: Abstraction has 1011 states and 1016 transitions. [2018-02-02 21:05:37,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-02 21:05:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1016 transitions. [2018-02-02 21:05:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-02-02 21:05:37,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:37,234 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-02 21:05:37,235 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 28 times [2018-02-02 21:05:37,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:37,235 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:37,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:37,235 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:37,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:37,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:38,872 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-02 21:05:38,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:38,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:38,873 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:05:39,355 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:05:39,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:39,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:39,382 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-02 21:05:39,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:39,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:39,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:39,457 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-02 21:05:39,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:39,462 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-02 21:05:39,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-02 21:05:41,785 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-02 21:05:41,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:41,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 47] total 65 [2018-02-02 21:05:41,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-02 21:05:41,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-02 21:05:41,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3812, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 21:05:41,786 INFO L87 Difference]: Start difference. First operand 1011 states and 1016 transitions. Second operand 66 states. [2018-02-02 21:05:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:45,404 INFO L93 Difference]: Finished difference Result 1030 states and 1035 transitions. [2018-02-02 21:05:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-02 21:05:45,404 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 989 [2018-02-02 21:05:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:45,406 INFO L225 Difference]: With dead ends: 1030 [2018-02-02 21:05:45,406 INFO L226 Difference]: Without dead ends: 1027 [2018-02-02 21:05:45,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 917 SyntacticMatches, 28 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1997, Invalid=15559, Unknown=0, NotChecked=0, Total=17556 [2018-02-02 21:05:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-02-02 21:05:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1014. [2018-02-02 21:05:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-02 21:05:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1019 transitions. [2018-02-02 21:05:45,412 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1019 transitions. Word has length 989 [2018-02-02 21:05:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:45,413 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1019 transitions. [2018-02-02 21:05:45,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-02 21:05:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1019 transitions. [2018-02-02 21:05:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-02-02 21:05:45,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:45,417 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-02 21:05:45,418 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1007592468, now seen corresponding path program 29 times [2018-02-02 21:05:45,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:45,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:45,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:45,418 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:45,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:45,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:47,123 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-02 21:05:47,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:47,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:47,124 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... [2018-02-02 21:05:47,321 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-02 21:05:47,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-02-02 21:05:47,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:05:47,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 21:05:47,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:05:47,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:05:47,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:05:47,384 INFO L87 Difference]: Start difference. First operand 1014 states and 1019 transitions. Second operand 22 states. [2018-02-02 21:05:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 21:05:47,385 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 21:05:47,389 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 21:05:47,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:05:47 BoogieIcfgContainer [2018-02-02 21:05:47,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:05:47,390 INFO L168 Benchmark]: Toolchain (without parser) took 66406.86 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.1 MB in the beginning and 1.3 GB in the end (delta: -893.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-02 21:05:47,390 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:05:47,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.35 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:47,391 INFO L168 Benchmark]: Boogie Preprocessor took 23.05 ms. Allocated memory is still 399.0 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:47,391 INFO L168 Benchmark]: RCFGBuilder took 172.40 ms. Allocated memory is still 399.0 MB. Free memory was 346.4 MB in the beginning and 329.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:47,391 INFO L168 Benchmark]: TraceAbstraction took 66074.63 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.6 MB in the beginning and 1.3 GB in the end (delta: -921.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-02 21:05:47,392 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.13 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 134.35 ms. Allocated memory is still 399.0 MB. Free memory was 357.1 MB in the beginning and 349.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 23.05 ms. Allocated memory is still 399.0 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.40 ms. Allocated memory is still 399.0 MB. Free memory was 346.4 MB in the beginning and 329.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66074.63 ms. Allocated memory was 399.0 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 329.6 MB in the beginning and 1.3 GB in the end (delta: -921.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (1014states) and interpolant automaton (currently 2 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 66.0s OverallTime, 37 OverallIterations, 150 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1077 SDtfs, 12179 SDslu, 11379 SDs, 0 SdLazy, 32516 SolverSat, 1964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14081 GetRequests, 12143 SyntacticMatches, 197 SemanticMatches, 1741 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41062 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1014occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 585 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 27555 NumberOfCodeBlocks, 25860 NumberOfCodeBlocksAsserted, 257 NumberOfCheckSat, 26493 ConstructedInterpolants, 4377 QuantifiedInterpolants, 58474870 SizeOfPredicates, 111 NumberOfNonLiveVariables, 25668 ConjunctsInSsa, 719 ConjunctsInUnsatCore, 67 InterpolantComputations, 7 PerfectInterpolantSequences, 921541/962839 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout 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-02_21-05-47-398.csv 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-TraceAbstractionBenchmarks-0-2018-02-02_21-05-47-398.csv Completed graceful shutdown