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_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:09:13,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:09:13,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:09:13,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:09:13,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:09:13,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:09:13,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:09:13,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:09:13,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:09:13,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:09:13,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:09:13,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:09:13,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:09:13,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:09:13,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:09:13,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:09:13,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:09:13,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:09:13,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:09:13,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:09:13,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:09:13,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:09:13,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:09:13,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:09:13,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:09:13,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:09:13,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:09:13,613 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:09:13,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:09:13,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:09:13,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:09:13,614 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_Array.epf [2018-02-04 16:09:13,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:09:13,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:09:13,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:09:13,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:09:13,625 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:09:13,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:09:13,626 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:09:13,626 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:09:13,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:09:13,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:09:13,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:09:13,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:09:13,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:09:13,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:09:13,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:09:13,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:09:13,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:09:13,667 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:09:13,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:09:13,668 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:09:13,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-04 16:09:13,781 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:09:13,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:09:13,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:09:13,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:09:13,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:09:13,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ae5b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13, skipping insertion in model container [2018-02-04 16:09:13,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,806 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:09:13,820 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:09:13,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:09:13,927 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:09:13,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13 WrapperNode [2018-02-04 16:09:13,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:09:13,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:09:13,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:09:13,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:09:13,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... [2018-02-04 16:09:13,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:09:13,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:09:13,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:09:13,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:09:13,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:09:13,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:09:13,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:09:13,994 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 16:09:13,994 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:09:13,994 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:09:13,994 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:09:13,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:09:14,126 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:09:14,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:09:14 BoogieIcfgContainer [2018-02-04 16:09:14,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:09:14,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:09:14,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:09:14,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:09:14,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:09:13" (1/3) ... [2018-02-04 16:09:14,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d40f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:09:14, skipping insertion in model container [2018-02-04 16:09:14,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:09:13" (2/3) ... [2018-02-04 16:09:14,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d40f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:09:14, skipping insertion in model container [2018-02-04 16:09:14,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:09:14" (3/3) ... [2018-02-04 16:09:14,131 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-02-04 16:09:14,137 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:09:14,142 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 16:09:14,173 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:09:14,173 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:09:14,174 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:09:14,174 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:09:14,174 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:09:14,174 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:09:14,174 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:09:14,174 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:09:14,175 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:09:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 16:09:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 16:09:14,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,196 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:14,197 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 16:09:14,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:14,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:09:14,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,319 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-04 16:09:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:09:14,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:09:14,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:09:14,333 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 16:09:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:14,386 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 16:09:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:09:14,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 16:09:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:14,394 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:09:14,394 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 16:09:14,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:09:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 16:09:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 16:09:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 16:09:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 16:09:14,484 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 16:09:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:14,485 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 16:09:14,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:09:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 16:09:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 16:09:14,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,485 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:14,485 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 16:09:14,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:14,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:09:14,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,527 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-04 16:09:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:09:14,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:09:14,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:09:14,529 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 16:09:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:14,567 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 16:09:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:09:14,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 16:09:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:14,569 INFO L225 Difference]: With dead ends: 60 [2018-02-04 16:09:14,569 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 16:09:14,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:09:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 16:09:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 16:09:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 16:09:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 16:09:14,575 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 16:09:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:14,575 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 16:09:14,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:09:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 16:09:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:09:14,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,576 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:14,576 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 16:09:14,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:14,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:09:14,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,712 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-04 16:09:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:09:14,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:09:14,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:14,713 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 16:09:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:14,771 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 16:09:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:09:14,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 16:09:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:14,772 INFO L225 Difference]: With dead ends: 54 [2018-02-04 16:09:14,772 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 16:09:14,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:09:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 16:09:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 16:09:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 16:09:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 16:09:14,775 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 16:09:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:14,775 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 16:09:14,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:09:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 16:09:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:09:14,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,775 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:14,776 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 16:09:14,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:14,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:09:14,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,799 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))] [2018-02-04 16:09:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:09:14,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:09:14,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:14,800 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 16:09:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:14,822 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 16:09:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:09:14,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 16:09:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:14,822 INFO L225 Difference]: With dead ends: 50 [2018-02-04 16:09:14,822 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 16:09:14,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 16:09:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 16:09:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 16:09:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 16:09:14,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 16:09:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:14,825 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 16:09:14,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:09:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 16:09:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 16:09:14,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,826 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:14,826 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 16:09:14,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:14,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:09:14,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,903 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= 32 |foo_#in~size|), 504#(= foo_~size 32), 505#(and (<= 0 foo_~i~0) (= foo_~size 32)), 506#(and (<= 1 foo_~i~0) (= foo_~size 32)), 507#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))] [2018-02-04 16:09:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:09:14,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:09:14,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:09:14,904 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-04 16:09:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:14,944 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-02-04 16:09:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:09:14,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 16:09:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:14,945 INFO L225 Difference]: With dead ends: 52 [2018-02-04 16:09:14,945 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 16:09:14,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:09:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 16:09:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-02-04 16:09:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 16:09:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 16:09:14,948 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 22 [2018-02-04 16:09:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:14,948 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 16:09:14,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:09:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 16:09:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:09:14,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:14,948 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] [2018-02-04 16:09:14,948 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:14,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 16:09:14,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:14,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:14,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:09:14,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,999 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(<= 0 main_~i~1), 615#(<= 1 main_~i~1), 616#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-04 16:09:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:14,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:09:14,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:09:14,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:14,999 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-04 16:09:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,032 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 16:09:15,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:09:15,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 16:09:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,033 INFO L225 Difference]: With dead ends: 56 [2018-02-04 16:09:15,033 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 16:09:15,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 16:09:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-02-04 16:09:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 16:09:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 16:09:15,036 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2018-02-04 16:09:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,036 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 16:09:15,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:09:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 16:09:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 16:09:15,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,037 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 16:09:15,037 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 16:09:15,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:15,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:09:15,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:09:15,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:15,087 INFO L182 omatonBuilderFactory]: Interpolants [715#true, 716#false, 717#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 718#(and (= foo_~i~0 0) (not (= |foo_#in~size| 32))), 719#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:15,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:09:15,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:09:15,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:15,088 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2018-02-04 16:09:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,123 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 16:09:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:09:15,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 16:09:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,124 INFO L225 Difference]: With dead ends: 51 [2018-02-04 16:09:15,124 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 16:09:15,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 16:09:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-04 16:09:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 16:09:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-02-04 16:09:15,127 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31 [2018-02-04 16:09:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,127 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-02-04 16:09:15,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:09:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-02-04 16:09:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 16:09:15,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,128 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,128 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 16:09:15,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:09:15,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:15,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 16:09:15,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:09:15,164 INFO L182 omatonBuilderFactory]: Interpolants [817#true, 818#false, 819#(= main_~i~1 0), 820#(<= main_~i~1 1)] [2018-02-04 16:09:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:09:15,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:09:15,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:09:15,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:09:15,165 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2018-02-04 16:09:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,199 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 16:09:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:09:15,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-04 16:09:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,200 INFO L225 Difference]: With dead ends: 72 [2018-02-04 16:09:15,200 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 16:09:15,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:09:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 16:09:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-02-04 16:09:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 16:09:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 16:09:15,203 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 37 [2018-02-04 16:09:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,203 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 16:09:15,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:09:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 16:09:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 16:09:15,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,205 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,205 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1953764441, now seen corresponding path program 2 times [2018-02-04 16:09:15,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 16:09:15,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:15,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:09:15,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:09:15,280 INFO L182 omatonBuilderFactory]: Interpolants [948#true, 949#false, 950#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 951#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 952#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 16:09:15,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:09:15,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:09:15,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:15,281 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-02-04 16:09:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,333 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 16:09:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:09:15,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-02-04 16:09:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,340 INFO L225 Difference]: With dead ends: 68 [2018-02-04 16:09:15,340 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 16:09:15,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 16:09:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-02-04 16:09:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:09:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 16:09:15,344 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55 [2018-02-04 16:09:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,345 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 16:09:15,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:09:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 16:09:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 16:09:15,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,346 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,346 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 3 times [2018-02-04 16:09:15,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 16:09:15,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:15,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:09:15,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 16:09:15,454 INFO L182 omatonBuilderFactory]: Interpolants [1088#(<= main_~i~1 2), 1084#true, 1085#false, 1086#(= main_~i~1 0), 1087#(<= main_~i~1 1)] [2018-02-04 16:09:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 16:09:15,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:09:15,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:09:15,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:15,454 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-04 16:09:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,512 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-04 16:09:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:09:15,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 16:09:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,515 INFO L225 Difference]: With dead ends: 94 [2018-02-04 16:09:15,515 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 16:09:15,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:09:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 16:09:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-02-04 16:09:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 16:09:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 16:09:15,523 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 67 [2018-02-04 16:09:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,524 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 16:09:15,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:09:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 16:09:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 16:09:15,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,525 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,525 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash -33793592, now seen corresponding path program 4 times [2018-02-04 16:09:15,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 16:09:15,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:15,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:09:15,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 16:09:15,670 INFO L182 omatonBuilderFactory]: Interpolants [1255#true, 1256#false, 1257#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1258#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1259#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1260#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 10 proven. 84 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 16:09:15,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:09:15,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:09:15,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:15,671 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-04 16:09:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,731 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 16:09:15,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:09:15,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-02-04 16:09:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,732 INFO L225 Difference]: With dead ends: 85 [2018-02-04 16:09:15,732 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 16:09:15,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:09:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 16:09:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-04 16:09:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 16:09:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-04 16:09:15,738 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 91 [2018-02-04 16:09:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,738 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-04 16:09:15,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:09:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-04 16:09:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 16:09:15,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,740 INFO L351 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,740 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash -913746080, now seen corresponding path program 5 times [2018-02-04 16:09:15,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 16:09:15,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:15,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:09:15,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 16:09:15,818 INFO L182 omatonBuilderFactory]: Interpolants [1426#true, 1427#false, 1428#(= main_~i~1 0), 1429#(<= main_~i~1 1), 1430#(<= main_~i~1 2), 1431#(<= main_~i~1 3)] [2018-02-04 16:09:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 16:09:15,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:09:15,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:09:15,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:15,823 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states. [2018-02-04 16:09:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:15,898 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-04 16:09:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:09:15,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-02-04 16:09:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:15,900 INFO L225 Difference]: With dead ends: 116 [2018-02-04 16:09:15,900 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 16:09:15,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:09:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 16:09:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2018-02-04 16:09:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:09:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-04 16:09:15,905 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 109 [2018-02-04 16:09:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:15,906 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-04 16:09:15,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:09:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-04 16:09:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 16:09:15,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:15,908 INFO L351 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:15,908 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash 969284025, now seen corresponding path program 6 times [2018-02-04 16:09:15,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:15,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 16:09:16,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:16,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:09:16,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-04 16:09:16,101 INFO L182 omatonBuilderFactory]: Interpolants [1637#true, 1638#false, 1639#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1640#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1641#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1642#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1643#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 14 proven. 237 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-04 16:09:16,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:09:16,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:09:16,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:09:16,102 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-04 16:09:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:16,141 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-04 16:09:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:09:16,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-02-04 16:09:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:16,143 INFO L225 Difference]: With dead ends: 102 [2018-02-04 16:09:16,143 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 16:09:16,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:09:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 16:09:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 16:09:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 16:09:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-02-04 16:09:16,148 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 139 [2018-02-04 16:09:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:16,149 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-02-04 16:09:16,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:09:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-02-04 16:09:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 16:09:16,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:16,151 INFO L351 BasicCegarLoop]: trace histogram [20, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:16,152 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1862037927, now seen corresponding path program 7 times [2018-02-04 16:09:16,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:16,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-02-04 16:09:16,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:16,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:09:16,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 16:09:16,221 INFO L182 omatonBuilderFactory]: Interpolants [1843#true, 1844#false, 1845#(= main_~i~1 0), 1846#(<= main_~i~1 1), 1847#(<= main_~i~1 2), 1848#(<= main_~i~1 3), 1849#(<= main_~i~1 4)] [2018-02-04 16:09:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-02-04 16:09:16,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:09:16,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:09:16,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:09:16,221 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 7 states. [2018-02-04 16:09:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:16,286 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-04 16:09:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:09:16,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-02-04 16:09:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:16,287 INFO L225 Difference]: With dead ends: 138 [2018-02-04 16:09:16,287 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 16:09:16,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:09:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 16:09:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-02-04 16:09:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 16:09:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-02-04 16:09:16,293 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 163 [2018-02-04 16:09:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:16,293 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-02-04 16:09:16,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:09:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-02-04 16:09:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 16:09:16,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:16,296 INFO L351 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:16,296 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1319247558, now seen corresponding path program 8 times [2018-02-04 16:09:16,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:16,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-02-04 16:09:16,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:16,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:09:16,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-04 16:09:16,526 INFO L182 omatonBuilderFactory]: Interpolants [2096#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2097#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2098#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2099#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2100#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2101#(not (= |foo_#in~size| 32)), 2094#true, 2095#false] [2018-02-04 16:09:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 18 proven. 512 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-02-04 16:09:16,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:09:16,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:09:16,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:09:16,530 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 8 states. [2018-02-04 16:09:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:16,585 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-04 16:09:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:09:16,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2018-02-04 16:09:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:16,588 INFO L225 Difference]: With dead ends: 119 [2018-02-04 16:09:16,588 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 16:09:16,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:09:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 16:09:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 16:09:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 16:09:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-02-04 16:09:16,598 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 199 [2018-02-04 16:09:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:16,599 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-02-04 16:09:16,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:09:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-02-04 16:09:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 16:09:16,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:16,602 INFO L351 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:16,602 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash 125993506, now seen corresponding path program 9 times [2018-02-04 16:09:16,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:16,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked. [2018-02-04 16:09:16,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:16,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:09:16,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-02-04 16:09:16,745 INFO L182 omatonBuilderFactory]: Interpolants [2336#false, 2337#(= main_~i~1 0), 2338#(<= main_~i~1 1), 2339#(<= main_~i~1 2), 2340#(<= main_~i~1 3), 2341#(<= main_~i~1 4), 2342#(<= main_~i~1 5), 2335#true] [2018-02-04 16:09:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2110 trivial. 0 not checked. [2018-02-04 16:09:16,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:09:16,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:09:16,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:09:16,747 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 8 states. [2018-02-04 16:09:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:16,823 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-02-04 16:09:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:09:16,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-02-04 16:09:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:16,825 INFO L225 Difference]: With dead ends: 160 [2018-02-04 16:09:16,825 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 16:09:16,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:09:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 16:09:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-02-04 16:09:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 16:09:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-02-04 16:09:16,829 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 229 [2018-02-04 16:09:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:16,830 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-02-04 16:09:16,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:09:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-02-04 16:09:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 16:09:16,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:16,833 INFO L351 BasicCegarLoop]: trace histogram [36, 30, 30, 30, 30, 30, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:16,833 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2046000651, now seen corresponding path program 10 times [2018-02-04 16:09:16,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:16,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2018-02-04 16:09:17,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:17,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:09:17,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-02-04 16:09:17,082 INFO L182 omatonBuilderFactory]: Interpolants [2626#true, 2627#false, 2628#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2629#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2630#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2631#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2632#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2633#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2634#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 22 proven. 945 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2018-02-04 16:09:17,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:09:17,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:09:17,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:09:17,083 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 9 states. [2018-02-04 16:09:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:17,129 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-02-04 16:09:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:09:17,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-02-04 16:09:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:17,130 INFO L225 Difference]: With dead ends: 136 [2018-02-04 16:09:17,130 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 16:09:17,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:09:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 16:09:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-02-04 16:09:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 16:09:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-02-04 16:09:17,135 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 271 [2018-02-04 16:09:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:17,135 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-02-04 16:09:17,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:09:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-02-04 16:09:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 16:09:17,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:17,137 INFO L351 BasicCegarLoop]: trace histogram [42, 36, 36, 36, 36, 36, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:17,137 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:17,137 INFO L82 PathProgramCache]: Analyzing trace with hash -416957317, now seen corresponding path program 11 times [2018-02-04 16:09:17,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:17,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked. [2018-02-04 16:09:17,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:17,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:09:17,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-02-04 16:09:17,345 INFO L182 omatonBuilderFactory]: Interpolants [2902#true, 2903#false, 2904#(= main_~i~1 0), 2905#(<= main_~i~1 1), 2906#(<= main_~i~1 2), 2907#(<= main_~i~1 3), 2908#(<= main_~i~1 4), 2909#(<= main_~i~1 5), 2910#(<= main_~i~1 6)] [2018-02-04 16:09:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4404 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 4302 trivial. 0 not checked. [2018-02-04 16:09:17,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:09:17,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:09:17,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:09:17,346 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 9 states. [2018-02-04 16:09:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:17,432 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-04 16:09:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:09:17,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2018-02-04 16:09:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:17,434 INFO L225 Difference]: With dead ends: 182 [2018-02-04 16:09:17,434 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 16:09:17,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:09:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 16:09:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-02-04 16:09:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 16:09:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2018-02-04 16:09:17,440 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 307 [2018-02-04 16:09:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:17,441 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2018-02-04 16:09:17,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:09:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2018-02-04 16:09:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-04 16:09:17,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:17,444 INFO L351 BasicCegarLoop]: trace histogram [49, 42, 42, 42, 42, 42, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:17,444 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1766255124, now seen corresponding path program 12 times [2018-02-04 16:09:17,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:17,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-02-04 16:09:17,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:17,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:09:17,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-02-04 16:09:17,771 INFO L182 omatonBuilderFactory]: Interpolants [3233#true, 3234#false, 3235#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3236#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3237#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3238#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3239#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3240#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3241#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3242#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 26 proven. 1572 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-02-04 16:09:17,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:09:17,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:09:17,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:09:17,773 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand 10 states. [2018-02-04 16:09:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:17,823 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-02-04 16:09:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:09:17,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 355 [2018-02-04 16:09:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:17,827 INFO L225 Difference]: With dead ends: 153 [2018-02-04 16:09:17,827 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 16:09:17,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:09:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 16:09:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-02-04 16:09:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 16:09:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-04 16:09:17,830 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 355 [2018-02-04 16:09:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:17,831 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-04 16:09:17,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:09:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-04 16:09:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 16:09:17,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:17,832 INFO L351 BasicCegarLoop]: trace histogram [56, 49, 49, 49, 49, 49, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:17,833 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1901043492, now seen corresponding path program 13 times [2018-02-04 16:09:17,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:17,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked. [2018-02-04 16:09:18,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:18,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:09:18,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-02-04 16:09:18,090 INFO L182 omatonBuilderFactory]: Interpolants [3552#(<= main_~i~1 6), 3553#(<= main_~i~1 7), 3544#true, 3545#false, 3546#(= main_~i~1 0), 3547#(<= main_~i~1 1), 3548#(<= main_~i~1 2), 3549#(<= main_~i~1 3), 3550#(<= main_~i~1 4), 3551#(<= main_~i~1 5)] [2018-02-04 16:09:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8008 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 7868 trivial. 0 not checked. [2018-02-04 16:09:18,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:09:18,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:09:18,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:09:18,094 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 10 states. [2018-02-04 16:09:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:18,194 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2018-02-04 16:09:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:09:18,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 397 [2018-02-04 16:09:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:18,196 INFO L225 Difference]: With dead ends: 204 [2018-02-04 16:09:18,196 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 16:09:18,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:09:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 16:09:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2018-02-04 16:09:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 16:09:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2018-02-04 16:09:18,201 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 397 [2018-02-04 16:09:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:18,201 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2018-02-04 16:09:18,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:09:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2018-02-04 16:09:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-04 16:09:18,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:18,204 INFO L351 BasicCegarLoop]: trace histogram [64, 56, 56, 56, 56, 56, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:18,204 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash 319186589, now seen corresponding path program 14 times [2018-02-04 16:09:18,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:18,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked. [2018-02-04 16:09:18,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:18,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:09:18,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-02-04 16:09:18,718 INFO L182 omatonBuilderFactory]: Interpolants [3920#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3921#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3922#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3923#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3924#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3925#(not (= |foo_#in~size| 32)), 3915#true, 3916#false, 3917#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3918#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3919#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:09:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10488 backedges. 30 proven. 2429 refuted. 0 times theorem prover too weak. 8029 trivial. 0 not checked. [2018-02-04 16:09:18,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:09:18,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:09:18,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:09:18,719 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2018-02-04 16:09:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:18,800 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-02-04 16:09:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:09:18,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 451 [2018-02-04 16:09:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:18,802 INFO L225 Difference]: With dead ends: 170 [2018-02-04 16:09:18,802 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 16:09:18,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:09:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 16:09:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-02-04 16:09:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 16:09:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-04 16:09:18,807 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 451 [2018-02-04 16:09:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:18,807 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-04 16:09:18,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:09:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-04 16:09:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-04 16:09:18,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:18,810 INFO L351 BasicCegarLoop]: trace histogram [72, 64, 64, 64, 64, 64, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:18,810 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -702635043, now seen corresponding path program 15 times [2018-02-04 16:09:18,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:18,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked. [2018-02-04 16:09:19,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:19,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:09:19,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-02-04 16:09:19,121 INFO L182 omatonBuilderFactory]: Interpolants [4261#true, 4262#false, 4263#(= main_~i~1 0), 4264#(<= main_~i~1 1), 4265#(<= main_~i~1 2), 4266#(<= main_~i~1 3), 4267#(<= main_~i~1 4), 4268#(<= main_~i~1 5), 4269#(<= main_~i~1 6), 4270#(<= main_~i~1 7), 4271#(<= main_~i~1 8)] [2018-02-04 16:09:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13472 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 13288 trivial. 0 not checked. [2018-02-04 16:09:19,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:09:19,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:09:19,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:09:19,123 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 11 states. [2018-02-04 16:09:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:19,215 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2018-02-04 16:09:19,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:09:19,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 499 [2018-02-04 16:09:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:19,218 INFO L225 Difference]: With dead ends: 226 [2018-02-04 16:09:19,218 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 16:09:19,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:09:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 16:09:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2018-02-04 16:09:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 16:09:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2018-02-04 16:09:19,222 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 499 [2018-02-04 16:09:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:19,223 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2018-02-04 16:09:19,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:09:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2018-02-04 16:09:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-02-04 16:09:19,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:19,227 INFO L351 BasicCegarLoop]: trace histogram [81, 72, 72, 72, 72, 72, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:19,227 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1002440158, now seen corresponding path program 16 times [2018-02-04 16:09:19,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:19,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked. [2018-02-04 16:09:19,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:19,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:09:19,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2018-02-04 16:09:19,815 INFO L182 omatonBuilderFactory]: Interpolants [4672#true, 4673#false, 4674#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4675#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4676#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4677#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4678#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4679#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4680#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4681#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4682#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 4683#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17082 backedges. 34 proven. 3552 refuted. 0 times theorem prover too weak. 13496 trivial. 0 not checked. [2018-02-04 16:09:19,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:09:19,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:09:19,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:09:19,816 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 12 states. [2018-02-04 16:09:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:19,921 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-02-04 16:09:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:09:19,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 559 [2018-02-04 16:09:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:19,922 INFO L225 Difference]: With dead ends: 187 [2018-02-04 16:09:19,922 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 16:09:19,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:09:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 16:09:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-02-04 16:09:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 16:09:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-04 16:09:19,927 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 559 [2018-02-04 16:09:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:19,927 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-04 16:09:19,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:09:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-04 16:09:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-02-04 16:09:19,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:19,931 INFO L351 BasicCegarLoop]: trace histogram [90, 81, 81, 81, 81, 81, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:19,931 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash -978150298, now seen corresponding path program 17 times [2018-02-04 16:09:19,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:19,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked. [2018-02-04 16:09:20,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:20,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:09:20,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-04 16:09:20,498 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= main_~i~1 1), 5057#(<= main_~i~1 2), 5058#(<= main_~i~1 3), 5059#(<= main_~i~1 4), 5060#(<= main_~i~1 5), 5061#(<= main_~i~1 6), 5062#(<= main_~i~1 7), 5063#(<= main_~i~1 8), 5064#(<= main_~i~1 9), 5053#true, 5054#false, 5055#(= main_~i~1 0)] [2018-02-04 16:09:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21348 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 21114 trivial. 0 not checked. [2018-02-04 16:09:20,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:09:20,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:09:20,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:09:20,500 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 12 states. [2018-02-04 16:09:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:20,657 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2018-02-04 16:09:20,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:09:20,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 613 [2018-02-04 16:09:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:20,659 INFO L225 Difference]: With dead ends: 248 [2018-02-04 16:09:20,659 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 16:09:20,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:09:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 16:09:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2018-02-04 16:09:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 16:09:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2018-02-04 16:09:20,664 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 613 [2018-02-04 16:09:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:20,665 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2018-02-04 16:09:20,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:09:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2018-02-04 16:09:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-02-04 16:09:20,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:20,671 INFO L351 BasicCegarLoop]: trace histogram [100, 90, 90, 90, 90, 90, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:20,671 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash 711631215, now seen corresponding path program 18 times [2018-02-04 16:09:20,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:20,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked. [2018-02-04 16:09:21,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:21,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:09:21,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 531 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2018-02-04 16:09:21,501 INFO L182 omatonBuilderFactory]: Interpolants [5504#true, 5505#false, 5506#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5507#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5508#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5509#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5510#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5511#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5512#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5513#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5514#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 5515#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5516#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 26390 backedges. 38 proven. 4977 refuted. 0 times theorem prover too weak. 21375 trivial. 0 not checked. [2018-02-04 16:09:21,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:09:21,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:09:21,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:09:21,502 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states. [2018-02-04 16:09:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:21,592 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-02-04 16:09:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:09:21,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 679 [2018-02-04 16:09:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:21,594 INFO L225 Difference]: With dead ends: 204 [2018-02-04 16:09:21,594 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 16:09:21,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:09:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 16:09:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-02-04 16:09:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 16:09:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-04 16:09:21,597 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 679 [2018-02-04 16:09:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:21,597 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-04 16:09:21,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:09:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-04 16:09:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-02-04 16:09:21,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:21,600 INFO L351 BasicCegarLoop]: trace histogram [110, 100, 100, 100, 100, 100, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:21,600 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1834618241, now seen corresponding path program 19 times [2018-02-04 16:09:21,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:21,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked. [2018-02-04 16:09:22,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:22,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:09:22,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-02-04 16:09:22,303 INFO L182 omatonBuilderFactory]: Interpolants [5920#true, 5921#false, 5922#(= main_~i~1 0), 5923#(<= main_~i~1 1), 5924#(<= main_~i~1 2), 5925#(<= main_~i~1 3), 5926#(<= main_~i~1 4), 5927#(<= main_~i~1 5), 5928#(<= main_~i~1 6), 5929#(<= main_~i~1 7), 5930#(<= main_~i~1 8), 5931#(<= main_~i~1 9), 5932#(<= main_~i~1 10)] [2018-02-04 16:09:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 32260 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 31970 trivial. 0 not checked. [2018-02-04 16:09:22,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:09:22,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:09:22,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:09:22,304 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 13 states. [2018-02-04 16:09:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:22,436 INFO L93 Difference]: Finished difference Result 270 states and 284 transitions. [2018-02-04 16:09:22,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:09:22,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 739 [2018-02-04 16:09:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:22,438 INFO L225 Difference]: With dead ends: 270 [2018-02-04 16:09:22,438 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 16:09:22,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:09:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 16:09:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 208. [2018-02-04 16:09:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 16:09:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2018-02-04 16:09:22,443 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 739 [2018-02-04 16:09:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:22,443 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2018-02-04 16:09:22,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:09:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2018-02-04 16:09:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2018-02-04 16:09:22,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:22,447 INFO L351 BasicCegarLoop]: trace histogram [121, 110, 110, 110, 110, 110, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:22,447 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2041430256, now seen corresponding path program 20 times [2018-02-04 16:09:22,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:22,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked. [2018-02-04 16:09:23,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:23,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:09:23,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 2980 trivial. 0 not checked. [2018-02-04 16:09:23,318 INFO L182 omatonBuilderFactory]: Interpolants [6411#true, 6412#false, 6413#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6414#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6415#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6416#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6417#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6418#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6419#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6420#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6421#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 6422#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6423#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6424#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 39072 backedges. 42 proven. 6740 refuted. 0 times theorem prover too weak. 32290 trivial. 0 not checked. [2018-02-04 16:09:23,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:09:23,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:09:23,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:09:23,320 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 14 states. [2018-02-04 16:09:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:23,409 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-02-04 16:09:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:09:23,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 811 [2018-02-04 16:09:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:23,411 INFO L225 Difference]: With dead ends: 221 [2018-02-04 16:09:23,411 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 16:09:23,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:09:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 16:09:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-02-04 16:09:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 16:09:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2018-02-04 16:09:23,416 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 811 [2018-02-04 16:09:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:23,417 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2018-02-04 16:09:23,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:09:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2018-02-04 16:09:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-02-04 16:09:23,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:23,424 INFO L351 BasicCegarLoop]: trace histogram [132, 121, 121, 121, 121, 121, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:23,424 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1088231448, now seen corresponding path program 21 times [2018-02-04 16:09:23,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:23,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked. [2018-02-04 16:09:24,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:24,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:09:24,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-02-04 16:09:24,342 INFO L182 omatonBuilderFactory]: Interpolants [6862#true, 6863#false, 6864#(= main_~i~1 0), 6865#(<= main_~i~1 1), 6866#(<= main_~i~1 2), 6867#(<= main_~i~1 3), 6868#(<= main_~i~1 4), 6869#(<= main_~i~1 5), 6870#(<= main_~i~1 6), 6871#(<= main_~i~1 7), 6872#(<= main_~i~1 8), 6873#(<= main_~i~1 9), 6874#(<= main_~i~1 10), 6875#(<= main_~i~1 11)] [2018-02-04 16:09:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46904 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 46552 trivial. 0 not checked. [2018-02-04 16:09:24,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:09:24,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:09:24,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:09:24,343 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 14 states. [2018-02-04 16:09:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:24,591 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2018-02-04 16:09:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:09:24,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 877 [2018-02-04 16:09:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:24,594 INFO L225 Difference]: With dead ends: 292 [2018-02-04 16:09:24,594 INFO L226 Difference]: Without dead ends: 292 [2018-02-04 16:09:24,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:09:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-04 16:09:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 225. [2018-02-04 16:09:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 16:09:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-02-04 16:09:24,599 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 877 [2018-02-04 16:09:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:24,600 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-02-04 16:09:24,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:09:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-02-04 16:09:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-02-04 16:09:24,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:24,607 INFO L351 BasicCegarLoop]: trace histogram [144, 132, 132, 132, 132, 132, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:24,607 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -500335487, now seen corresponding path program 22 times [2018-02-04 16:09:24,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:24,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked. [2018-02-04 16:09:26,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:26,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:09:26,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4752 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 3971 trivial. 0 not checked. [2018-02-04 16:09:26,027 INFO L182 omatonBuilderFactory]: Interpolants [7393#true, 7394#false, 7395#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7396#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7397#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7398#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7399#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7400#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7401#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7402#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7403#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 7404#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7405#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7406#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7407#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55860 backedges. 46 proven. 8877 refuted. 0 times theorem prover too weak. 46937 trivial. 0 not checked. [2018-02-04 16:09:26,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:09:26,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:09:26,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:09:26,028 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 15 states. [2018-02-04 16:09:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:26,087 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-02-04 16:09:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:09:26,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 955 [2018-02-04 16:09:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:26,088 INFO L225 Difference]: With dead ends: 238 [2018-02-04 16:09:26,088 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 16:09:26,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:09:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 16:09:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 16:09:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 16:09:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2018-02-04 16:09:26,092 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 955 [2018-02-04 16:09:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:26,093 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2018-02-04 16:09:26,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:09:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2018-02-04 16:09:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-02-04 16:09:26,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:26,100 INFO L351 BasicCegarLoop]: trace histogram [156, 144, 144, 144, 144, 144, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:26,100 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1879255455, now seen corresponding path program 23 times [2018-02-04 16:09:26,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:26,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked. [2018-02-04 16:09:27,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:27,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:09:27,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5148 trivial. 0 not checked. [2018-02-04 16:09:27,358 INFO L182 omatonBuilderFactory]: Interpolants [7879#true, 7880#false, 7881#(= main_~i~1 0), 7882#(<= main_~i~1 1), 7883#(<= main_~i~1 2), 7884#(<= main_~i~1 3), 7885#(<= main_~i~1 4), 7886#(<= main_~i~1 5), 7887#(<= main_~i~1 6), 7888#(<= main_~i~1 7), 7889#(<= main_~i~1 8), 7890#(<= main_~i~1 9), 7891#(<= main_~i~1 10), 7892#(<= main_~i~1 11), 7893#(<= main_~i~1 12)] [2018-02-04 16:09:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 66048 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 65628 trivial. 0 not checked. [2018-02-04 16:09:27,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:09:27,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:09:27,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:09:27,359 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand 15 states. [2018-02-04 16:09:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:27,474 INFO L93 Difference]: Finished difference Result 314 states and 330 transitions. [2018-02-04 16:09:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:09:27,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1027 [2018-02-04 16:09:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:27,477 INFO L225 Difference]: With dead ends: 314 [2018-02-04 16:09:27,477 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 16:09:27,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:09:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 16:09:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2018-02-04 16:09:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 16:09:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-02-04 16:09:27,483 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 1027 [2018-02-04 16:09:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:27,484 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-02-04 16:09:27,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:09:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-02-04 16:09:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-02-04 16:09:27,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:27,493 INFO L351 BasicCegarLoop]: trace histogram [169, 156, 156, 156, 156, 156, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:27,494 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1856294786, now seen corresponding path program 24 times [2018-02-04 16:09:27,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:27,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked. [2018-02-04 16:09:29,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:29,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:09:29,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 5160 trivial. 0 not checked. [2018-02-04 16:09:29,071 INFO L182 omatonBuilderFactory]: Interpolants [8450#true, 8451#false, 8452#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8453#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8454#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8455#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8456#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8457#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8458#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8459#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8460#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 8461#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8462#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8463#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8464#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8465#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 77558 backedges. 50 proven. 11424 refuted. 0 times theorem prover too weak. 66084 trivial. 0 not checked. [2018-02-04 16:09:29,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:09:29,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:09:29,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:09:29,072 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 16 states. [2018-02-04 16:09:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:29,139 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2018-02-04 16:09:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:09:29,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1111 [2018-02-04 16:09:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:29,140 INFO L225 Difference]: With dead ends: 255 [2018-02-04 16:09:29,141 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 16:09:29,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:09:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 16:09:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2018-02-04 16:09:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 16:09:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2018-02-04 16:09:29,144 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 1111 [2018-02-04 16:09:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:29,144 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2018-02-04 16:09:29,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:09:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2018-02-04 16:09:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2018-02-04 16:09:29,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:29,151 INFO L351 BasicCegarLoop]: trace histogram [182, 169, 169, 169, 169, 169, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:29,151 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1396010922, now seen corresponding path program 25 times [2018-02-04 16:09:29,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:29,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked. [2018-02-04 16:09:30,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:30,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:09:30,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6552 trivial. 0 not checked. [2018-02-04 16:09:30,446 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(= main_~i~1 0), 8974#(<= main_~i~1 1), 8975#(<= main_~i~1 2), 8976#(<= main_~i~1 3), 8977#(<= main_~i~1 4), 8978#(<= main_~i~1 5), 8979#(<= main_~i~1 6), 8980#(<= main_~i~1 7), 8981#(<= main_~i~1 8), 8982#(<= main_~i~1 9), 8983#(<= main_~i~1 10), 8984#(<= main_~i~1 11), 8985#(<= main_~i~1 12), 8986#(<= main_~i~1 13)] [2018-02-04 16:09:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 90532 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 90038 trivial. 0 not checked. [2018-02-04 16:09:30,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:09:30,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:09:30,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:09:30,448 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand 16 states. [2018-02-04 16:09:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:30,574 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions. [2018-02-04 16:09:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:09:30,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1189 [2018-02-04 16:09:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:30,575 INFO L225 Difference]: With dead ends: 336 [2018-02-04 16:09:30,575 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 16:09:30,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:09:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 16:09:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 259. [2018-02-04 16:09:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 16:09:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2018-02-04 16:09:30,580 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 1189 [2018-02-04 16:09:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:30,580 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2018-02-04 16:09:30,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:09:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2018-02-04 16:09:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-02-04 16:09:30,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:30,588 INFO L351 BasicCegarLoop]: trace histogram [196, 182, 182, 182, 182, 182, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:30,588 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash -601504301, now seen corresponding path program 26 times [2018-02-04 16:09:30,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:30,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked. [2018-02-04 16:09:32,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:32,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:09:32,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 0 proven. 1079 refuted. 0 times theorem prover too weak. 6565 trivial. 0 not checked. [2018-02-04 16:09:32,485 INFO L182 omatonBuilderFactory]: Interpolants [9582#true, 9583#false, 9584#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9585#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9586#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9587#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9588#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9589#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9590#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9591#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9592#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 9593#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9594#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9595#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9596#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9597#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9598#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 105042 backedges. 54 proven. 14417 refuted. 0 times theorem prover too weak. 90571 trivial. 0 not checked. [2018-02-04 16:09:32,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:09:32,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:09:32,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:09:32,487 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 17 states. [2018-02-04 16:09:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:32,552 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions. [2018-02-04 16:09:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:09:32,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1279 [2018-02-04 16:09:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:32,553 INFO L225 Difference]: With dead ends: 272 [2018-02-04 16:09:32,553 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 16:09:32,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:09:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 16:09:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-02-04 16:09:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 16:09:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 294 transitions. [2018-02-04 16:09:32,558 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 294 transitions. Word has length 1279 [2018-02-04 16:09:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:32,559 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 294 transitions. [2018-02-04 16:09:32,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:09:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 294 transitions. [2018-02-04 16:09:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-02-04 16:09:32,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:32,568 INFO L351 BasicCegarLoop]: trace histogram [210, 196, 196, 196, 196, 196, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:32,568 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1767243139, now seen corresponding path program 27 times [2018-02-04 16:09:32,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:32,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked. [2018-02-04 16:09:34,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:34,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:09:34,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8190 trivial. 0 not checked. [2018-02-04 16:09:34,421 INFO L182 omatonBuilderFactory]: Interpolants [10144#(<= main_~i~1 4), 10145#(<= main_~i~1 5), 10146#(<= main_~i~1 6), 10147#(<= main_~i~1 7), 10148#(<= main_~i~1 8), 10149#(<= main_~i~1 9), 10150#(<= main_~i~1 10), 10151#(<= main_~i~1 11), 10152#(<= main_~i~1 12), 10153#(<= main_~i~1 13), 10154#(<= main_~i~1 14), 10138#true, 10139#false, 10140#(= main_~i~1 0), 10141#(<= main_~i~1 1), 10142#(<= main_~i~1 2), 10143#(<= main_~i~1 3)] [2018-02-04 16:09:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 121268 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 120694 trivial. 0 not checked. [2018-02-04 16:09:34,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:09:34,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:09:34,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:09:34,422 INFO L87 Difference]: Start difference. First operand 265 states and 294 transitions. Second operand 17 states. [2018-02-04 16:09:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:34,533 INFO L93 Difference]: Finished difference Result 358 states and 376 transitions. [2018-02-04 16:09:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:09:34,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1363 [2018-02-04 16:09:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:34,535 INFO L225 Difference]: With dead ends: 358 [2018-02-04 16:09:34,535 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 16:09:34,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:09:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 16:09:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276. [2018-02-04 16:09:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 16:09:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 307 transitions. [2018-02-04 16:09:34,539 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 307 transitions. Word has length 1363 [2018-02-04 16:09:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:34,539 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 307 transitions. [2018-02-04 16:09:34,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:09:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 307 transitions. [2018-02-04 16:09:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2018-02-04 16:09:34,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:34,549 INFO L351 BasicCegarLoop]: trace histogram [225, 210, 210, 210, 210, 210, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:34,549 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 946488628, now seen corresponding path program 28 times [2018-02-04 16:09:34,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:34,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked. [2018-02-04 16:09:36,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:36,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:09:36,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9450 backedges. 0 proven. 1246 refuted. 0 times theorem prover too weak. 8204 trivial. 0 not checked. [2018-02-04 16:09:36,976 INFO L182 omatonBuilderFactory]: Interpolants [10789#true, 10790#false, 10791#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10792#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10793#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10794#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10795#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10796#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10797#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10798#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10799#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 10800#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10801#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10802#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10803#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10804#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10805#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10806#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 139260 backedges. 58 proven. 17892 refuted. 0 times theorem prover too weak. 121310 trivial. 0 not checked. [2018-02-04 16:09:36,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:09:36,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:09:36,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:09:36,978 INFO L87 Difference]: Start difference. First operand 276 states and 307 transitions. Second operand 18 states. [2018-02-04 16:09:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:37,055 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-02-04 16:09:37,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:09:37,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1459 [2018-02-04 16:09:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:37,057 INFO L225 Difference]: With dead ends: 289 [2018-02-04 16:09:37,057 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 16:09:37,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:09:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 16:09:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-02-04 16:09:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 16:09:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2018-02-04 16:09:37,063 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 1459 [2018-02-04 16:09:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:37,063 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2018-02-04 16:09:37,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:09:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2018-02-04 16:09:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550 [2018-02-04 16:09:37,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:37,079 INFO L351 BasicCegarLoop]: trace histogram [240, 225, 225, 225, 225, 225, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:37,079 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash -754671188, now seen corresponding path program 29 times [2018-02-04 16:09:37,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:37,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked. [2018-02-04 16:09:39,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:39,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:09:39,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2018-02-04 16:09:39,244 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~1 10), 11393#(<= main_~i~1 11), 11394#(<= main_~i~1 12), 11395#(<= main_~i~1 13), 11396#(<= main_~i~1 14), 11397#(<= main_~i~1 15), 11380#true, 11381#false, 11382#(= main_~i~1 0), 11383#(<= main_~i~1 1), 11384#(<= main_~i~1 2), 11385#(<= main_~i~1 3), 11386#(<= main_~i~1 4), 11387#(<= main_~i~1 5), 11388#(<= main_~i~1 6), 11389#(<= main_~i~1 7), 11390#(<= main_~i~1 8), 11391#(<= main_~i~1 9)] [2018-02-04 16:09:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 159240 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 158580 trivial. 0 not checked. [2018-02-04 16:09:39,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:09:39,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:09:39,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:09:39,246 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand 18 states. [2018-02-04 16:09:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:39,370 INFO L93 Difference]: Finished difference Result 380 states and 399 transitions. [2018-02-04 16:09:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:09:39,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1549 [2018-02-04 16:09:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:39,373 INFO L225 Difference]: With dead ends: 380 [2018-02-04 16:09:39,373 INFO L226 Difference]: Without dead ends: 380 [2018-02-04 16:09:39,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:09:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-04 16:09:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 293. [2018-02-04 16:09:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 16:09:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 326 transitions. [2018-02-04 16:09:39,377 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 326 transitions. Word has length 1549 [2018-02-04 16:09:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:39,378 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 326 transitions. [2018-02-04 16:09:39,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:09:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 326 transitions. [2018-02-04 16:09:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2018-02-04 16:09:39,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:39,390 INFO L351 BasicCegarLoop]: trace histogram [256, 240, 240, 240, 240, 240, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:39,390 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1444662117, now seen corresponding path program 30 times [2018-02-04 16:09:39,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:39,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked. [2018-02-04 16:09:42,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:42,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:09:42,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 0 proven. 1425 refuted. 0 times theorem prover too weak. 10095 trivial. 0 not checked. [2018-02-04 16:09:42,469 INFO L182 omatonBuilderFactory]: Interpolants [12071#true, 12072#false, 12073#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12074#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12075#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12076#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12077#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12078#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12079#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12080#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12081#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 12082#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12083#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12084#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12085#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12086#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12087#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12088#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12089#(not (= |foo_#in~size| 32))] [2018-02-04 16:09:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 181232 backedges. 62 proven. 21885 refuted. 0 times theorem prover too weak. 159285 trivial. 0 not checked. [2018-02-04 16:09:42,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:09:42,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:09:42,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:09:42,471 INFO L87 Difference]: Start difference. First operand 293 states and 326 transitions. Second operand 19 states. [2018-02-04 16:09:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:42,546 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-02-04 16:09:42,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:09:42,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1651 [2018-02-04 16:09:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:42,547 INFO L225 Difference]: With dead ends: 306 [2018-02-04 16:09:42,547 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 16:09:42,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:09:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 16:09:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-02-04 16:09:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 16:09:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2018-02-04 16:09:42,553 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 1651 [2018-02-04 16:09:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:42,554 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2018-02-04 16:09:42,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:09:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2018-02-04 16:09:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2018-02-04 16:09:42,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:42,570 INFO L351 BasicCegarLoop]: trace histogram [272, 256, 256, 256, 256, 256, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:42,570 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 104699365, now seen corresponding path program 31 times [2018-02-04 16:09:42,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:42,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked. [2018-02-04 16:09:45,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:45,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:09:45,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12240 trivial. 0 not checked. [2018-02-04 16:09:45,342 INFO L182 omatonBuilderFactory]: Interpolants [12704#(<= main_~i~1 5), 12705#(<= main_~i~1 6), 12706#(<= main_~i~1 7), 12707#(<= main_~i~1 8), 12708#(<= main_~i~1 9), 12709#(<= main_~i~1 10), 12710#(<= main_~i~1 11), 12711#(<= main_~i~1 12), 12712#(<= main_~i~1 13), 12713#(<= main_~i~1 14), 12714#(<= main_~i~1 15), 12715#(<= main_~i~1 16), 12697#true, 12698#false, 12699#(= main_~i~1 0), 12700#(<= main_~i~1 1), 12701#(<= main_~i~1 2), 12702#(<= main_~i~1 3), 12703#(<= main_~i~1 4)] [2018-02-04 16:09:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 205504 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 204752 trivial. 0 not checked. [2018-02-04 16:09:45,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:09:45,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:09:45,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:09:45,344 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 19 states. [2018-02-04 16:09:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:45,492 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions. [2018-02-04 16:09:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:09:45,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1747 [2018-02-04 16:09:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:45,494 INFO L225 Difference]: With dead ends: 402 [2018-02-04 16:09:45,494 INFO L226 Difference]: Without dead ends: 402 [2018-02-04 16:09:45,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:09:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-04 16:09:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 310. [2018-02-04 16:09:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 16:09:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 345 transitions. [2018-02-04 16:09:45,498 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 345 transitions. Word has length 1747 [2018-02-04 16:09:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:45,499 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 345 transitions. [2018-02-04 16:09:45,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:09:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 345 transitions. [2018-02-04 16:09:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1856 [2018-02-04 16:09:45,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:45,513 INFO L351 BasicCegarLoop]: trace histogram [289, 272, 272, 272, 272, 272, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:45,513 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash -553996762, now seen corresponding path program 32 times [2018-02-04 16:09:45,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:45,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked. [2018-02-04 16:09:49,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:49,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:09:49,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 1616 refuted. 0 times theorem prover too weak. 12256 trivial. 0 not checked. [2018-02-04 16:09:49,410 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13441#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13442#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13443#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13444#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13445#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13446#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13447#(not (= |foo_#in~size| 32)), 13428#true, 13429#false, 13430#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13431#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13432#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13433#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13434#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13435#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13436#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13437#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13438#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 13439#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:09:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 232050 backedges. 66 proven. 26432 refuted. 0 times theorem prover too weak. 205552 trivial. 0 not checked. [2018-02-04 16:09:49,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:09:49,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:09:49,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:09:49,413 INFO L87 Difference]: Start difference. First operand 310 states and 345 transitions. Second operand 20 states. [2018-02-04 16:09:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:49,481 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2018-02-04 16:09:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:09:49,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1855 [2018-02-04 16:09:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:49,482 INFO L225 Difference]: With dead ends: 323 [2018-02-04 16:09:49,482 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 16:09:49,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:09:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 16:09:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-02-04 16:09:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 16:09:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 351 transitions. [2018-02-04 16:09:49,488 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 351 transitions. Word has length 1855 [2018-02-04 16:09:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:49,488 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 351 transitions. [2018-02-04 16:09:49,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:09:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2018-02-04 16:09:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958 [2018-02-04 16:09:49,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:49,512 INFO L351 BasicCegarLoop]: trace histogram [306, 289, 289, 289, 289, 289, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:49,512 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash 546860014, now seen corresponding path program 33 times [2018-02-04 16:09:49,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:49,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked. [2018-02-04 16:09:53,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:53,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:09:53,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14688 trivial. 0 not checked. [2018-02-04 16:09:53,137 INFO L182 omatonBuilderFactory]: Interpolants [14089#true, 14090#false, 14091#(= main_~i~1 0), 14092#(<= main_~i~1 1), 14093#(<= main_~i~1 2), 14094#(<= main_~i~1 3), 14095#(<= main_~i~1 4), 14096#(<= main_~i~1 5), 14097#(<= main_~i~1 6), 14098#(<= main_~i~1 7), 14099#(<= main_~i~1 8), 14100#(<= main_~i~1 9), 14101#(<= main_~i~1 10), 14102#(<= main_~i~1 11), 14103#(<= main_~i~1 12), 14104#(<= main_~i~1 13), 14105#(<= main_~i~1 14), 14106#(<= main_~i~1 15), 14107#(<= main_~i~1 16), 14108#(<= main_~i~1 17)] [2018-02-04 16:09:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 261188 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 260338 trivial. 0 not checked. [2018-02-04 16:09:53,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:09:53,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:09:53,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:09:53,140 INFO L87 Difference]: Start difference. First operand 316 states and 351 transitions. Second operand 20 states. [2018-02-04 16:09:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:53,315 INFO L93 Difference]: Finished difference Result 424 states and 445 transitions. [2018-02-04 16:09:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:09:53,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1957 [2018-02-04 16:09:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:53,318 INFO L225 Difference]: With dead ends: 424 [2018-02-04 16:09:53,318 INFO L226 Difference]: Without dead ends: 424 [2018-02-04 16:09:53,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:09:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-04 16:09:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 327. [2018-02-04 16:09:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 16:09:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 364 transitions. [2018-02-04 16:09:53,322 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 364 transitions. Word has length 1957 [2018-02-04 16:09:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:53,323 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 364 transitions. [2018-02-04 16:09:53,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:09:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 364 transitions. [2018-02-04 16:09:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072 [2018-02-04 16:09:53,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:53,340 INFO L351 BasicCegarLoop]: trace histogram [324, 306, 306, 306, 306, 306, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:53,340 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1829676233, now seen corresponding path program 34 times [2018-02-04 16:09:53,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:53,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:09:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked. [2018-02-04 16:09:58,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:09:58,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:09:58,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:09:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 1819 refuted. 0 times theorem prover too weak. 14705 trivial. 0 not checked. [2018-02-04 16:09:58,365 INFO L182 omatonBuilderFactory]: Interpolants [14880#(not (= |foo_#in~size| 32)), 14860#true, 14861#false, 14862#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14863#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14864#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14865#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14866#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14867#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14868#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14869#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14870#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 14871#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14872#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14873#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14874#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14875#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14876#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14877#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14878#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14879#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:09:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 292878 backedges. 70 proven. 31569 refuted. 0 times theorem prover too weak. 261239 trivial. 0 not checked. [2018-02-04 16:09:58,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:09:58,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:09:58,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:09:58,369 INFO L87 Difference]: Start difference. First operand 327 states and 364 transitions. Second operand 21 states. [2018-02-04 16:09:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:09:58,453 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-02-04 16:09:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:09:58,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2071 [2018-02-04 16:09:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:09:58,454 INFO L225 Difference]: With dead ends: 340 [2018-02-04 16:09:58,454 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 16:09:58,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:09:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 16:09:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-02-04 16:09:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 16:09:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 370 transitions. [2018-02-04 16:09:58,460 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 370 transitions. Word has length 2071 [2018-02-04 16:09:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:09:58,460 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 370 transitions. [2018-02-04 16:09:58,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:09:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 370 transitions. [2018-02-04 16:09:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2180 [2018-02-04 16:09:58,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:09:58,480 INFO L351 BasicCegarLoop]: trace histogram [342, 324, 324, 324, 324, 324, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:09:58,480 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:09:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash 771837319, now seen corresponding path program 35 times [2018-02-04 16:09:58,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:09:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:09:58,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked. [2018-02-04 16:10:03,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:03,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:10:03,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17442 trivial. 0 not checked. [2018-02-04 16:10:03,171 INFO L182 omatonBuilderFactory]: Interpolants [15556#true, 15557#false, 15558#(= main_~i~1 0), 15559#(<= main_~i~1 1), 15560#(<= main_~i~1 2), 15561#(<= main_~i~1 3), 15562#(<= main_~i~1 4), 15563#(<= main_~i~1 5), 15564#(<= main_~i~1 6), 15565#(<= main_~i~1 7), 15566#(<= main_~i~1 8), 15567#(<= main_~i~1 9), 15568#(<= main_~i~1 10), 15569#(<= main_~i~1 11), 15570#(<= main_~i~1 12), 15571#(<= main_~i~1 13), 15572#(<= main_~i~1 14), 15573#(<= main_~i~1 15), 15574#(<= main_~i~1 16), 15575#(<= main_~i~1 17), 15576#(<= main_~i~1 18)] [2018-02-04 16:10:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 327492 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 326538 trivial. 0 not checked. [2018-02-04 16:10:03,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:10:03,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:10:03,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:10:03,174 INFO L87 Difference]: Start difference. First operand 333 states and 370 transitions. Second operand 21 states. [2018-02-04 16:10:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:03,431 INFO L93 Difference]: Finished difference Result 446 states and 468 transitions. [2018-02-04 16:10:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:10:03,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2179 [2018-02-04 16:10:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:03,435 INFO L225 Difference]: With dead ends: 446 [2018-02-04 16:10:03,435 INFO L226 Difference]: Without dead ends: 446 [2018-02-04 16:10:03,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:10:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-04 16:10:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344. [2018-02-04 16:10:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 16:10:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 383 transitions. [2018-02-04 16:10:03,441 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 383 transitions. Word has length 2179 [2018-02-04 16:10:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:03,443 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 383 transitions. [2018-02-04 16:10:03,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:10:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 383 transitions. [2018-02-04 16:10:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300 [2018-02-04 16:10:03,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:03,482 INFO L351 BasicCegarLoop]: trace histogram [361, 342, 342, 342, 342, 342, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:03,482 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1752930392, now seen corresponding path program 36 times [2018-02-04 16:10:03,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:03,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked. [2018-02-04 16:10:09,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:09,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:10:09,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19494 backedges. 0 proven. 2034 refuted. 0 times theorem prover too weak. 17460 trivial. 0 not checked. [2018-02-04 16:10:09,830 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16385#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16386#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16387#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16388#(not (= |foo_#in~size| 32)), 16367#true, 16368#false, 16369#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16370#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16371#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16372#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16373#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16374#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16375#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16376#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16377#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 16378#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16379#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16380#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16381#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16382#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16383#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:10:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 364952 backedges. 74 proven. 37332 refuted. 0 times theorem prover too weak. 327546 trivial. 0 not checked. [2018-02-04 16:10:09,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:10:09,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:10:09,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:10:09,836 INFO L87 Difference]: Start difference. First operand 344 states and 383 transitions. Second operand 22 states. [2018-02-04 16:10:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:09,916 INFO L93 Difference]: Finished difference Result 357 states and 396 transitions. [2018-02-04 16:10:09,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:10:09,916 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2299 [2018-02-04 16:10:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:09,917 INFO L225 Difference]: With dead ends: 357 [2018-02-04 16:10:09,917 INFO L226 Difference]: Without dead ends: 354 [2018-02-04 16:10:09,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:10:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-04 16:10:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2018-02-04 16:10:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 16:10:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 389 transitions. [2018-02-04 16:10:09,920 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 389 transitions. Word has length 2299 [2018-02-04 16:10:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:09,921 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 389 transitions. [2018-02-04 16:10:09,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:10:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 389 transitions. [2018-02-04 16:10:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2414 [2018-02-04 16:10:09,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:09,943 INFO L351 BasicCegarLoop]: trace histogram [380, 361, 361, 361, 361, 361, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:09,943 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 760102000, now seen corresponding path program 37 times [2018-02-04 16:10:09,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:10,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 405688 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 404624 trivial. 0 not checked. [2018-02-04 16:10:15,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:15,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:10:15,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20520 trivial. 0 not checked. [2018-02-04 16:10:15,680 INFO L182 omatonBuilderFactory]: Interpolants [17098#true, 17099#false, 17100#(= main_~i~1 0), 17101#(<= main_~i~1 1), 17102#(<= main_~i~1 2), 17103#(<= main_~i~1 3), 17104#(<= main_~i~1 4), 17105#(<= main_~i~1 5), 17106#(<= main_~i~1 6), 17107#(<= main_~i~1 7), 17108#(<= main_~i~1 8), 17109#(<= main_~i~1 9), 17110#(<= main_~i~1 10), 17111#(<= main_~i~1 11), 17112#(<= main_~i~1 12), 17113#(<= main_~i~1 13), 17114#(<= main_~i~1 14), 17115#(<= main_~i~1 15), 17116#(<= main_~i~1 16), 17117#(<= main_~i~1 17), 17118#(<= main_~i~1 18), 17119#(<= main_~i~1 19)] [2018-02-04 16:10:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 405688 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 404624 trivial. 0 not checked. [2018-02-04 16:10:15,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:10:15,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:10:15,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:10:15,684 INFO L87 Difference]: Start difference. First operand 350 states and 389 transitions. Second operand 22 states. [2018-02-04 16:10:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:15,865 INFO L93 Difference]: Finished difference Result 468 states and 491 transitions. [2018-02-04 16:10:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:10:15,865 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2413 [2018-02-04 16:10:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:15,867 INFO L225 Difference]: With dead ends: 468 [2018-02-04 16:10:15,867 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 16:10:15,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:10:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 16:10:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 361. [2018-02-04 16:10:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-04 16:10:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 402 transitions. [2018-02-04 16:10:15,872 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 402 transitions. Word has length 2413 [2018-02-04 16:10:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:15,873 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 402 transitions. [2018-02-04 16:10:15,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:10:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 402 transitions. [2018-02-04 16:10:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2540 [2018-02-04 16:10:15,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:15,898 INFO L351 BasicCegarLoop]: trace histogram [400, 380, 380, 380, 380, 380, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:15,898 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1154073417, now seen corresponding path program 38 times [2018-02-04 16:10:15,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:15,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 449580 backedges. 78 proven. 43757 refuted. 0 times theorem prover too weak. 405745 trivial. 0 not checked. [2018-02-04 16:10:23,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:23,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:10:23,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22800 backedges. 0 proven. 2261 refuted. 0 times theorem prover too weak. 20539 trivial. 0 not checked. [2018-02-04 16:10:23,722 INFO L182 omatonBuilderFactory]: Interpolants [17952#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17953#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17954#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17955#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17956#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17957#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17958#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17959#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 17960#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17961#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17962#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17963#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17964#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17965#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17966#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17967#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17968#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17969#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17970#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17971#(not (= |foo_#in~size| 32)), 17949#true, 17950#false, 17951#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:10:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 449580 backedges. 78 proven. 43757 refuted. 0 times theorem prover too weak. 405745 trivial. 0 not checked. [2018-02-04 16:10:23,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:10:23,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:10:23,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:10:23,727 INFO L87 Difference]: Start difference. First operand 361 states and 402 transitions. Second operand 23 states. [2018-02-04 16:10:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:23,813 INFO L93 Difference]: Finished difference Result 374 states and 415 transitions. [2018-02-04 16:10:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:10:23,814 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2539 [2018-02-04 16:10:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:23,815 INFO L225 Difference]: With dead ends: 374 [2018-02-04 16:10:23,815 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 16:10:23,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:10:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 16:10:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-02-04 16:10:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 16:10:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 408 transitions. [2018-02-04 16:10:23,819 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 408 transitions. Word has length 2539 [2018-02-04 16:10:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:23,819 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 408 transitions. [2018-02-04 16:10:23,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:10:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 408 transitions. [2018-02-04 16:10:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2660 [2018-02-04 16:10:23,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:23,846 INFO L351 BasicCegarLoop]: trace histogram [420, 400, 400, 400, 400, 400, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:23,847 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1105702295, now seen corresponding path program 39 times [2018-02-04 16:10:23,847 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:23,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 497120 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 495940 trivial. 0 not checked. [2018-02-04 16:10:31,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:31,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:10:31,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 23940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23940 trivial. 0 not checked. [2018-02-04 16:10:31,126 INFO L182 omatonBuilderFactory]: Interpolants [18720#(<= main_~i~1 3), 18721#(<= main_~i~1 4), 18722#(<= main_~i~1 5), 18723#(<= main_~i~1 6), 18724#(<= main_~i~1 7), 18725#(<= main_~i~1 8), 18726#(<= main_~i~1 9), 18727#(<= main_~i~1 10), 18728#(<= main_~i~1 11), 18729#(<= main_~i~1 12), 18730#(<= main_~i~1 13), 18731#(<= main_~i~1 14), 18732#(<= main_~i~1 15), 18733#(<= main_~i~1 16), 18734#(<= main_~i~1 17), 18735#(<= main_~i~1 18), 18736#(<= main_~i~1 19), 18737#(<= main_~i~1 20), 18715#true, 18716#false, 18717#(= main_~i~1 0), 18718#(<= main_~i~1 1), 18719#(<= main_~i~1 2)] [2018-02-04 16:10:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 497120 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 495940 trivial. 0 not checked. [2018-02-04 16:10:31,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:10:31,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:10:31,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:10:31,131 INFO L87 Difference]: Start difference. First operand 367 states and 408 transitions. Second operand 23 states. [2018-02-04 16:10:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:31,333 INFO L93 Difference]: Finished difference Result 490 states and 514 transitions. [2018-02-04 16:10:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:10:31,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2659 [2018-02-04 16:10:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:31,336 INFO L225 Difference]: With dead ends: 490 [2018-02-04 16:10:31,336 INFO L226 Difference]: Without dead ends: 490 [2018-02-04 16:10:31,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:10:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-04 16:10:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 378. [2018-02-04 16:10:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 16:10:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 421 transitions. [2018-02-04 16:10:31,342 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 421 transitions. Word has length 2659 [2018-02-04 16:10:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:31,344 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 421 transitions. [2018-02-04 16:10:31,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:10:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 421 transitions. [2018-02-04 16:10:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-02-04 16:10:31,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:31,373 INFO L351 BasicCegarLoop]: trace histogram [441, 420, 420, 420, 420, 420, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:31,373 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash -737668662, now seen corresponding path program 40 times [2018-02-04 16:10:31,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:31,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 548142 backedges. 82 proven. 50880 refuted. 0 times theorem prover too weak. 497180 trivial. 0 not checked. [2018-02-04 16:10:40,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:40,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:10:40,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26460 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 23960 trivial. 0 not checked. [2018-02-04 16:10:40,984 INFO L182 omatonBuilderFactory]: Interpolants [19616#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 19617#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19618#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19619#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19620#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19621#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19622#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19623#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19624#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19625#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19626#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19627#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19628#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19629#(not (= |foo_#in~size| 32)), 19606#true, 19607#false, 19608#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19609#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19610#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19611#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19612#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19613#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19614#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19615#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:10:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 548142 backedges. 82 proven. 50880 refuted. 0 times theorem prover too weak. 497180 trivial. 0 not checked. [2018-02-04 16:10:40,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:10:40,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:10:40,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:10:40,990 INFO L87 Difference]: Start difference. First operand 378 states and 421 transitions. Second operand 24 states. [2018-02-04 16:10:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:41,084 INFO L93 Difference]: Finished difference Result 391 states and 434 transitions. [2018-02-04 16:10:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:10:41,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2791 [2018-02-04 16:10:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:41,085 INFO L225 Difference]: With dead ends: 391 [2018-02-04 16:10:41,085 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 16:10:41,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:10:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 16:10:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2018-02-04 16:10:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-04 16:10:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 427 transitions. [2018-02-04 16:10:41,088 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 427 transitions. Word has length 2791 [2018-02-04 16:10:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:41,088 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 427 transitions. [2018-02-04 16:10:41,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:10:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 427 transitions. [2018-02-04 16:10:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2918 [2018-02-04 16:10:41,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:41,119 INFO L351 BasicCegarLoop]: trace histogram [462, 441, 441, 441, 441, 441, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:41,119 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash -180289230, now seen corresponding path program 41 times [2018-02-04 16:10:41,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:41,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:10:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 603204 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 601902 trivial. 0 not checked. [2018-02-04 16:10:49,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:10:49,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:10:49,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:10:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 27720 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27720 trivial. 0 not checked. [2018-02-04 16:10:49,738 INFO L182 omatonBuilderFactory]: Interpolants [20416#(<= main_~i~1 7), 20417#(<= main_~i~1 8), 20418#(<= main_~i~1 9), 20419#(<= main_~i~1 10), 20420#(<= main_~i~1 11), 20421#(<= main_~i~1 12), 20422#(<= main_~i~1 13), 20423#(<= main_~i~1 14), 20424#(<= main_~i~1 15), 20425#(<= main_~i~1 16), 20426#(<= main_~i~1 17), 20427#(<= main_~i~1 18), 20428#(<= main_~i~1 19), 20429#(<= main_~i~1 20), 20430#(<= main_~i~1 21), 20407#true, 20408#false, 20409#(= main_~i~1 0), 20410#(<= main_~i~1 1), 20411#(<= main_~i~1 2), 20412#(<= main_~i~1 3), 20413#(<= main_~i~1 4), 20414#(<= main_~i~1 5), 20415#(<= main_~i~1 6)] [2018-02-04 16:10:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 603204 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 601902 trivial. 0 not checked. [2018-02-04 16:10:49,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:10:49,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:10:49,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:10:49,744 INFO L87 Difference]: Start difference. First operand 384 states and 427 transitions. Second operand 24 states. [2018-02-04 16:10:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:10:49,917 INFO L93 Difference]: Finished difference Result 512 states and 537 transitions. [2018-02-04 16:10:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:10:49,917 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2917 [2018-02-04 16:10:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:10:49,919 INFO L225 Difference]: With dead ends: 512 [2018-02-04 16:10:49,919 INFO L226 Difference]: Without dead ends: 512 [2018-02-04 16:10:49,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:10:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-04 16:10:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 395. [2018-02-04 16:10:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 16:10:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 440 transitions. [2018-02-04 16:10:49,923 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 440 transitions. Word has length 2917 [2018-02-04 16:10:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:10:49,924 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 440 transitions. [2018-02-04 16:10:49,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:10:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 440 transitions. [2018-02-04 16:10:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3056 [2018-02-04 16:10:49,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:10:49,960 INFO L351 BasicCegarLoop]: trace histogram [484, 462, 462, 462, 462, 462, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:10:49,960 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:10:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1406021221, now seen corresponding path program 42 times [2018-02-04 16:10:49,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:10:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:10:50,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:11:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 662090 backedges. 86 proven. 58737 refuted. 0 times theorem prover too weak. 603267 trivial. 0 not checked. [2018-02-04 16:11:01,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:11:01,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:11:01,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:11:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30492 backedges. 0 proven. 2751 refuted. 0 times theorem prover too weak. 27741 trivial. 0 not checked. [2018-02-04 16:11:01,392 INFO L182 omatonBuilderFactory]: Interpolants [21338#true, 21339#false, 21340#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21341#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21342#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21343#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21344#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21345#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21346#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21347#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21348#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 21349#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21350#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21351#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21352#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21353#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21354#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21355#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21356#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21357#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21358#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21359#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21360#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21361#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 21362#(not (= |foo_#in~size| 32))] [2018-02-04 16:11:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 662090 backedges. 86 proven. 58737 refuted. 0 times theorem prover too weak. 603267 trivial. 0 not checked. [2018-02-04 16:11:01,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:11:01,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:11:01,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:11:01,399 INFO L87 Difference]: Start difference. First operand 395 states and 440 transitions. Second operand 25 states. [2018-02-04 16:11:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:11:01,505 INFO L93 Difference]: Finished difference Result 408 states and 453 transitions. [2018-02-04 16:11:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:11:01,505 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 3055 [2018-02-04 16:11:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:11:01,506 INFO L225 Difference]: With dead ends: 408 [2018-02-04 16:11:01,506 INFO L226 Difference]: Without dead ends: 405 [2018-02-04 16:11:01,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:11:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-04 16:11:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-02-04 16:11:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 16:11:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 446 transitions. [2018-02-04 16:11:01,509 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 446 transitions. Word has length 3055 [2018-02-04 16:11:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:11:01,510 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 446 transitions. [2018-02-04 16:11:01,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:11:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 446 transitions. [2018-02-04 16:11:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3188 [2018-02-04 16:11:01,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:11:01,546 INFO L351 BasicCegarLoop]: trace histogram [506, 484, 484, 484, 484, 484, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:11:01,546 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:11:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1215606133, now seen corresponding path program 43 times [2018-02-04 16:11:01,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:11:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:11:01,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:11:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 725428 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 723998 trivial. 0 not checked. [2018-02-04 16:11:12,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:11:12,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:11:12,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:11:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31878 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31878 trivial. 0 not checked. [2018-02-04 16:11:12,355 INFO L182 omatonBuilderFactory]: Interpolants [22174#true, 22175#false, 22176#(= main_~i~1 0), 22177#(<= main_~i~1 1), 22178#(<= main_~i~1 2), 22179#(<= main_~i~1 3), 22180#(<= main_~i~1 4), 22181#(<= main_~i~1 5), 22182#(<= main_~i~1 6), 22183#(<= main_~i~1 7), 22184#(<= main_~i~1 8), 22185#(<= main_~i~1 9), 22186#(<= main_~i~1 10), 22187#(<= main_~i~1 11), 22188#(<= main_~i~1 12), 22189#(<= main_~i~1 13), 22190#(<= main_~i~1 14), 22191#(<= main_~i~1 15), 22192#(<= main_~i~1 16), 22193#(<= main_~i~1 17), 22194#(<= main_~i~1 18), 22195#(<= main_~i~1 19), 22196#(<= main_~i~1 20), 22197#(<= main_~i~1 21), 22198#(<= main_~i~1 22)] [2018-02-04 16:11:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 725428 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 723998 trivial. 0 not checked. [2018-02-04 16:11:12,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:11:12,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:11:12,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:11:12,362 INFO L87 Difference]: Start difference. First operand 401 states and 446 transitions. Second operand 25 states. [2018-02-04 16:11:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:11:12,584 INFO L93 Difference]: Finished difference Result 534 states and 560 transitions. [2018-02-04 16:11:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:11:12,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 3187 [2018-02-04 16:11:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:11:12,587 INFO L225 Difference]: With dead ends: 534 [2018-02-04 16:11:12,587 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 16:11:12,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:11:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 16:11:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 412. [2018-02-04 16:11:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 16:11:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 459 transitions. [2018-02-04 16:11:12,590 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 459 transitions. Word has length 3187 [2018-02-04 16:11:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:11:12,591 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 459 transitions. [2018-02-04 16:11:12,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:11:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 459 transitions. [2018-02-04 16:11:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3332 [2018-02-04 16:11:12,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:11:12,631 INFO L351 BasicCegarLoop]: trace histogram [529, 506, 506, 506, 506, 506, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:11:12,631 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:11:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1457039484, now seen corresponding path program 44 times [2018-02-04 16:11:12,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:11:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:11:12,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:11:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 792948 backedges. 90 proven. 67364 refuted. 0 times theorem prover too weak. 725494 trivial. 0 not checked. [2018-02-04 16:11:26,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:11:26,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:11:26,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:11:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34914 backedges. 0 proven. 3014 refuted. 0 times theorem prover too weak. 31900 trivial. 0 not checked. [2018-02-04 16:11:26,722 INFO L182 omatonBuilderFactory]: Interpolants [23168#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 23169#(and (or (<= foo_~i~0 22) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23170#(not (= |foo_#in~size| 32)), 23145#true, 23146#false, 23147#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23148#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23149#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23150#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23151#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23152#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23153#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23154#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23155#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 23156#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23157#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23158#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23159#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23160#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23161#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23162#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23163#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23164#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23165#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23166#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23167#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 16:11:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 792948 backedges. 90 proven. 67364 refuted. 0 times theorem prover too weak. 725494 trivial. 0 not checked. [2018-02-04 16:11:26,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:11:26,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:11:26,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:11:26,731 INFO L87 Difference]: Start difference. First operand 412 states and 459 transitions. Second operand 26 states. [2018-02-04 16:11:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:11:26,813 INFO L93 Difference]: Finished difference Result 425 states and 472 transitions. [2018-02-04 16:11:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:11:26,814 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 3331 [2018-02-04 16:11:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:11:26,815 INFO L225 Difference]: With dead ends: 425 [2018-02-04 16:11:26,816 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 16:11:26,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:11:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 16:11:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2018-02-04 16:11:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-04 16:11:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 465 transitions. [2018-02-04 16:11:26,820 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 465 transitions. Word has length 3331 [2018-02-04 16:11:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:11:26,820 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 465 transitions. [2018-02-04 16:11:26,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:11:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 465 transitions. [2018-02-04 16:11:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3470 [2018-02-04 16:11:26,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:11:26,865 INFO L351 BasicCegarLoop]: trace histogram [552, 529, 529, 529, 529, 529, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:11:26,865 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:11:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash 733030452, now seen corresponding path program 45 times [2018-02-04 16:11:26,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:11:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:11:27,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:11:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 865352 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 863788 trivial. 0 not checked. [2018-02-04 16:11:39,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:11:39,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:11:39,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:11:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36432 trivial. 0 not checked. [2018-02-04 16:11:39,963 INFO L182 omatonBuilderFactory]: Interpolants [24016#true, 24017#false, 24018#(= main_~i~1 0), 24019#(<= main_~i~1 1), 24020#(<= main_~i~1 2), 24021#(<= main_~i~1 3), 24022#(<= main_~i~1 4), 24023#(<= main_~i~1 5), 24024#(<= main_~i~1 6), 24025#(<= main_~i~1 7), 24026#(<= main_~i~1 8), 24027#(<= main_~i~1 9), 24028#(<= main_~i~1 10), 24029#(<= main_~i~1 11), 24030#(<= main_~i~1 12), 24031#(<= main_~i~1 13), 24032#(<= main_~i~1 14), 24033#(<= main_~i~1 15), 24034#(<= main_~i~1 16), 24035#(<= main_~i~1 17), 24036#(<= main_~i~1 18), 24037#(<= main_~i~1 19), 24038#(<= main_~i~1 20), 24039#(<= main_~i~1 21), 24040#(<= main_~i~1 22), 24041#(<= main_~i~1 23)] [2018-02-04 16:11:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 865352 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 863788 trivial. 0 not checked. [2018-02-04 16:11:39,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:11:39,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:11:39,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:11:39,971 INFO L87 Difference]: Start difference. First operand 418 states and 465 transitions. Second operand 26 states. [2018-02-04 16:11:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:11:40,163 INFO L93 Difference]: Finished difference Result 556 states and 583 transitions. [2018-02-04 16:11:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:11:40,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 3469 [2018-02-04 16:11:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:11:40,166 INFO L225 Difference]: With dead ends: 556 [2018-02-04 16:11:40,166 INFO L226 Difference]: Without dead ends: 556 [2018-02-04 16:11:40,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:11:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-04 16:11:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 429. [2018-02-04 16:11:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 16:11:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 478 transitions. [2018-02-04 16:11:40,170 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 478 transitions. Word has length 3469 [2018-02-04 16:11:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:11:40,171 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 478 transitions. [2018-02-04 16:11:40,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:11:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 478 transitions. [2018-02-04 16:11:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3620 [2018-02-04 16:11:40,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:11:40,217 INFO L351 BasicCegarLoop]: trace histogram [576, 552, 552, 552, 552, 552, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:11:40,217 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:11:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 541578285, now seen corresponding path program 46 times [2018-02-04 16:11:40,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:11:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:11:40,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:11:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 942312 backedges. 94 proven. 76797 refuted. 0 times theorem prover too weak. 865421 trivial. 0 not checked. [2018-02-04 16:11:56,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:11:56,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:11:56,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:11:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 39744 backedges. 0 proven. 3289 refuted. 0 times theorem prover too weak. 36455 trivial. 0 not checked. [2018-02-04 16:11:56,924 INFO L182 omatonBuilderFactory]: Interpolants [25027#true, 25028#false, 25029#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25030#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25031#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25032#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25033#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25034#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25035#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25036#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25037#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 25038#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25039#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25040#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25041#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25042#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25043#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25044#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25045#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25046#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25047#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25048#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25049#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25050#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 25051#(and (or (<= foo_~i~0 22) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25052#(and (or (<= foo_~i~0 23) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25053#(not (= |foo_#in~size| 32))] [2018-02-04 16:11:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 942312 backedges. 94 proven. 76797 refuted. 0 times theorem prover too weak. 865421 trivial. 0 not checked. [2018-02-04 16:11:56,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:11:56,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:11:56,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:11:56,934 INFO L87 Difference]: Start difference. First operand 429 states and 478 transitions. Second operand 27 states. [2018-02-04 16:11:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:11:57,053 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-02-04 16:11:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:11:57,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 3619 [2018-02-04 16:11:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:11:57,055 INFO L225 Difference]: With dead ends: 442 [2018-02-04 16:11:57,055 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 16:11:57,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:11:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 16:11:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2018-02-04 16:11:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 16:11:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 484 transitions. [2018-02-04 16:11:57,059 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 484 transitions. Word has length 3619 [2018-02-04 16:11:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:11:57,059 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 484 transitions. [2018-02-04 16:11:57,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:11:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 484 transitions. [2018-02-04 16:11:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3764 [2018-02-04 16:11:57,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:11:57,109 INFO L351 BasicCegarLoop]: trace histogram [600, 576, 576, 576, 576, 576, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:11:57,109 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:11:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1465678829, now seen corresponding path program 47 times [2018-02-04 16:11:57,109 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:11:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:11:57,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:12:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1024608 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 1022904 trivial. 0 not checked. [2018-02-04 16:12:12,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:12:12,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:12:12,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:12:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 41400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41400 trivial. 0 not checked. [2018-02-04 16:12:12,880 INFO L182 omatonBuilderFactory]: Interpolants [25933#true, 25934#false, 25935#(= main_~i~1 0), 25936#(<= main_~i~1 1), 25937#(<= main_~i~1 2), 25938#(<= main_~i~1 3), 25939#(<= main_~i~1 4), 25940#(<= main_~i~1 5), 25941#(<= main_~i~1 6), 25942#(<= main_~i~1 7), 25943#(<= main_~i~1 8), 25944#(<= main_~i~1 9), 25945#(<= main_~i~1 10), 25946#(<= main_~i~1 11), 25947#(<= main_~i~1 12), 25948#(<= main_~i~1 13), 25949#(<= main_~i~1 14), 25950#(<= main_~i~1 15), 25951#(<= main_~i~1 16), 25952#(<= main_~i~1 17), 25953#(<= main_~i~1 18), 25954#(<= main_~i~1 19), 25955#(<= main_~i~1 20), 25956#(<= main_~i~1 21), 25957#(<= main_~i~1 22), 25958#(<= main_~i~1 23), 25959#(<= main_~i~1 24)] [2018-02-04 16:12:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1024608 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 1022904 trivial. 0 not checked. [2018-02-04 16:12:12,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:12:12,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:12:12,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:12:12,889 INFO L87 Difference]: Start difference. First operand 435 states and 484 transitions. Second operand 27 states. [2018-02-04 16:12:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:12:13,154 INFO L93 Difference]: Finished difference Result 578 states and 606 transitions. [2018-02-04 16:12:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:12:13,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 3763 [2018-02-04 16:12:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:12:13,157 INFO L225 Difference]: With dead ends: 578 [2018-02-04 16:12:13,157 INFO L226 Difference]: Without dead ends: 578 [2018-02-04 16:12:13,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:12:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-04 16:12:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 446. [2018-02-04 16:12:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 16:12:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 497 transitions. [2018-02-04 16:12:13,163 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 497 transitions. Word has length 3763 [2018-02-04 16:12:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:12:13,164 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 497 transitions. [2018-02-04 16:12:13,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:12:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 497 transitions. [2018-02-04 16:12:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3920 [2018-02-04 16:12:13,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:12:13,221 INFO L351 BasicCegarLoop]: trace histogram [625, 600, 600, 600, 600, 600, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:12:13,221 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:12:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1670682002, now seen corresponding path program 48 times [2018-02-04 16:12:13,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:12:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:12:13,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 16:12:23,320 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 16:12:23,323 INFO L168 Benchmark]: Toolchain (without parser) took 189541.70 ms. Allocated memory was 398.5 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 356.6 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 5.3 GB. [2018-02-04 16:12:23,324 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:12:23,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.39 ms. Allocated memory is still 398.5 MB. Free memory was 356.6 MB in the beginning and 348.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 16:12:23,325 INFO L168 Benchmark]: Boogie Preprocessor took 19.69 ms. Allocated memory is still 398.5 MB. Free memory was 348.7 MB in the beginning and 346.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:12:23,325 INFO L168 Benchmark]: RCFGBuilder took 175.29 ms. Allocated memory is still 398.5 MB. Free memory was 346.0 MB in the beginning and 330.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:12:23,325 INFO L168 Benchmark]: TraceAbstraction took 189195.61 ms. Allocated memory was 398.5 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 329.1 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. [2018-02-04 16:12:23,327 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.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.39 ms. Allocated memory is still 398.5 MB. Free memory was 356.6 MB in the beginning and 348.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.69 ms. Allocated memory is still 398.5 MB. Free memory was 348.7 MB in the beginning and 346.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.29 ms. Allocated memory is still 398.5 MB. Free memory was 346.0 MB in the beginning and 330.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 189195.61 ms. Allocated memory was 398.5 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 329.1 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-12-23-332.csv Completed graceful shutdown