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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:58:32,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:58:32,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:58:32,535 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:58:32,535 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:58:32,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:58:32,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:58:32,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:58:32,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:58:32,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:58:32,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:58:32,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:58:32,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:58:32,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:58:32,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:58:32,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:58:32,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:58:32,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:58:32,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:58:32,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:58:32,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:58:32,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:58:32,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:58:32,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:58:32,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:58:32,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:58:32,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:58:32,556 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:58:32,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:58:32,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:58:32,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:58:32,557 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 02:58:32,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:58:32,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:58:32,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:58:32,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:58:32,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:58:32,569 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:58:32,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:58:32,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:58:32,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:58:32,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:58:32,606 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:58:32,608 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:58:32,609 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:58:32,609 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:58:32,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-02-04 02:58:32,698 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:58:32,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:58:32,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:58:32,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:58:32,703 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:58:32,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32, skipping insertion in model container [2018-02-04 02:58:32,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,716 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:58:32,727 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:58:32,806 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:58:32,818 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:58:32,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32 WrapperNode [2018-02-04 02:58:32,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:58:32,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:58:32,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:58:32,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:58:32,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (1/1) ... [2018-02-04 02:58:32,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:58:32,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:58:32,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:58:32,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:58:32,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (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 02:58:32,880 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:58:32,881 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:58:32,881 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:58:32,881 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:58:32,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:58:33,022 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:58:33,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:33 BoogieIcfgContainer [2018-02-04 02:58:33,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:58:33,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:58:33,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:58:33,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:58:33,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:32" (1/3) ... [2018-02-04 02:58:33,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b6a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:33, skipping insertion in model container [2018-02-04 02:58:33,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:32" (2/3) ... [2018-02-04 02:58:33,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b6a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:33, skipping insertion in model container [2018-02-04 02:58:33,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:33" (3/3) ... [2018-02-04 02:58:33,027 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-02-04 02:58:33,033 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:58:33,037 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 02:58:33,067 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:58:33,068 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:58:33,068 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:58:33,068 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:58:33,068 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:58:33,068 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:58:33,068 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:58:33,068 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:58:33,069 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:58:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 02:58:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:58:33,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,084 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:33,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 02:58:33,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,199 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 02:58:33,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:33,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:58:33,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,201 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 02:58:33,202 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-04 02:58:33,202 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 02:58:33,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:58:33,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:58:33,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:58:33,212 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 02:58:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,273 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 02:58:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:58:33,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 02:58:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,284 INFO L225 Difference]: With dead ends: 63 [2018-02-04 02:58:33,284 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 02:58:33,286 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 02:58:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 02:58:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 02:58:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:58:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 02:58:33,358 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 02:58:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,359 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 02:58:33,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:58:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 02:58:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:58:33,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,359 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:58:33,359 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 02:58:33,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,396 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 02:58:33,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:33,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:58:33,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,397 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 02:58:33,397 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-04 02:58:33,398 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 02:58:33,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:58:33,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:58:33,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:58:33,400 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 02:58:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,433 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 02:58:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:58:33,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 02:58:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,435 INFO L225 Difference]: With dead ends: 60 [2018-02-04 02:58:33,435 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 02:58:33,436 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 02:58:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 02:58:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 02:58:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:58:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 02:58:33,442 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 02:58:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,442 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 02:58:33,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:58:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 02:58:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:58:33,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,443 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 02:58:33,443 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 02:58:33,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,581 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 02:58:33,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:33,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:58:33,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,582 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 02:58:33,582 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset)), 283#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 284#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 285#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-04 02:58:33,582 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 02:58:33,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:58:33,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:58:33,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:58:33,583 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2018-02-04 02:58:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,733 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 02:58:33,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:58:33,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 02:58:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,735 INFO L225 Difference]: With dead ends: 54 [2018-02-04 02:58:33,735 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 02:58:33,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:58:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 02:58:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 02:58:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 02:58:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 02:58:33,739 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 02:58:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,740 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 02:58:33,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:58:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 02:58:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 02:58:33,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,741 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 02:58:33,741 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 02:58:33,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,775 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 02:58:33,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:33,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:58:33,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,776 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 02:58:33,776 INFO L182 omatonBuilderFactory]: Interpolants [400#(= 1 (select |#valid| main_~c~0.base)), 401#(= 1 (select |#valid| |foo_#in~b.base|)), 402#(= 1 (select |#valid| foo_~b.base)), 397#true, 398#false, 399#(= 1 (select |#valid| |main_~#mask~0.base|))] [2018-02-04 02:58:33,776 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 02:58:33,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:58:33,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:58:33,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:58:33,776 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-02-04 02:58:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,817 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 02:58:33,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:58:33,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 02:58:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,818 INFO L225 Difference]: With dead ends: 50 [2018-02-04 02:58:33,818 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 02:58:33,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:58:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 02:58:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 02:58:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 02:58:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 02:58:33,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 02:58:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,823 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 02:58:33,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:58:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 02:58:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 02:58:33,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,824 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 02:58:33,824 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 02:58:33,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,891 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 02:58:33,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:33,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:58:33,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,892 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 02:58:33,892 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (<= 1 foo_~i~0) (= foo_~size 32)), 513#(and (<= 1 foo_~i~0) (<= foo_~i~0 31)), 507#true, 508#false, 509#(= 32 |foo_#in~size|), 510#(= foo_~size 32), 511#(and (<= 0 foo_~i~0) (= foo_~size 32))] [2018-02-04 02:58:33,892 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 02:58:33,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:58:33,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:58:33,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:58:33,893 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-04 02:58:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:33,932 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-02-04 02:58:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:58:33,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 02:58:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:33,933 INFO L225 Difference]: With dead ends: 52 [2018-02-04 02:58:33,934 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 02:58:33,934 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 02:58:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 02:58:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-02-04 02:58:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 02:58:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 02:58:33,937 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 22 [2018-02-04 02:58:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:33,937 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 02:58:33,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:58:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 02:58:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:58:33,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:33,938 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 02:58:33,938 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 02:58:33,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:33,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:33,977 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 02:58:33,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:33,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:58:33,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:33,978 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 02:58:33,978 INFO L182 omatonBuilderFactory]: Interpolants [618#true, 619#false, 620#(<= 0 main_~i~1), 621#(<= 1 main_~i~1), 622#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-04 02:58:33,978 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 02:58:33,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:58:33,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:58:33,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:58:33,979 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-04 02:58:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,012 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 02:58:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:58:34,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 02:58:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,013 INFO L225 Difference]: With dead ends: 56 [2018-02-04 02:58:34,014 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 02:58:34,014 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 02:58:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 02:58:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-02-04 02:58:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 02:58:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 02:58:34,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 23 [2018-02-04 02:58:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,017 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 02:58:34,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:58:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 02:58:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:58:34,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,018 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 02:58:34,018 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 02:58:34,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,074 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 02:58:34,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:58:34,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:58:34,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,075 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 02:58:34,075 INFO L182 omatonBuilderFactory]: Interpolants [721#true, 722#false, 723#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 724#(and (= foo_~i~0 0) (not (= |foo_#in~size| 32))), 725#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:34,075 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 02:58:34,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:58:34,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:58:34,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:58:34,076 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2018-02-04 02:58:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,110 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 02:58:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:58:34,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 02:58:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,116 INFO L225 Difference]: With dead ends: 51 [2018-02-04 02:58:34,116 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 02:58:34,117 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 02:58:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 02:58:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-04 02:58:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 02:58:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-02-04 02:58:34,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 31 [2018-02-04 02:58:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,120 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-02-04 02:58:34,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:58:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-02-04 02:58:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 02:58:34,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,121 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 02:58:34,122 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 02:58:34,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,155 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 02:58:34,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 02:58:34,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,156 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 02:58:34,156 INFO L182 omatonBuilderFactory]: Interpolants [823#true, 824#false, 825#(= main_~i~1 0), 826#(<= main_~i~1 1)] [2018-02-04 02:58:34,156 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 02:58:34,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:58:34,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:58:34,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:58:34,157 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2018-02-04 02:58:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,187 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 02:58:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:58:34,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-04 02:58:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,188 INFO L225 Difference]: With dead ends: 72 [2018-02-04 02:58:34,188 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 02:58:34,188 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 02:58:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 02:58:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-02-04 02:58:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 02:58:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 02:58:34,191 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 37 [2018-02-04 02:58:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,191 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 02:58:34,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:58:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 02:58:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 02:58:34,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,193 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 02:58:34,193 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1953764441, now seen corresponding path program 2 times [2018-02-04 02:58:34,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,281 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 02:58:34,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:58:34,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,282 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 02:58:34,282 INFO L182 omatonBuilderFactory]: Interpolants [954#true, 955#false, 956#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 957#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 958#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:34,282 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 02:58:34,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:58:34,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:58:34,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:58:34,283 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-02-04 02:58:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,320 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 02:58:34,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:58:34,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-02-04 02:58:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,322 INFO L225 Difference]: With dead ends: 68 [2018-02-04 02:58:34,322 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:58:34,322 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 02:58:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:58:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-02-04 02:58:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 02:58:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 02:58:34,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 55 [2018-02-04 02:58:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,327 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 02:58:34,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:58:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 02:58:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:58:34,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,328 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 02:58:34,328 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 3 times [2018-02-04 02:58:34,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,386 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 02:58:34,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:58:34,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,387 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 02:58:34,387 INFO L182 omatonBuilderFactory]: Interpolants [1090#true, 1091#false, 1092#(= main_~i~1 0), 1093#(<= main_~i~1 1), 1094#(<= main_~i~1 2)] [2018-02-04 02:58:34,387 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 02:58:34,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:58:34,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:58:34,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:58:34,388 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-04 02:58:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,436 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-04 02:58:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:58:34,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 02:58:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,437 INFO L225 Difference]: With dead ends: 94 [2018-02-04 02:58:34,437 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 02:58:34,437 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 02:58:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 02:58:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-02-04 02:58:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 02:58:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-04 02:58:34,441 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 67 [2018-02-04 02:58:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,442 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-04 02:58:34,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:58:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-04 02:58:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 02:58:34,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,443 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 02:58:34,443 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -33793592, now seen corresponding path program 4 times [2018-02-04 02:58:34,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,567 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 02:58:34,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:58:34,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,568 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 02:58:34,569 INFO L182 omatonBuilderFactory]: Interpolants [1264#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1265#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1266#(not (= |foo_#in~size| 32)), 1261#true, 1262#false, 1263#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:34,569 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 02:58:34,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:58:34,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:58:34,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:58:34,570 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-04 02:58:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,614 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 02:58:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:58:34,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-02-04 02:58:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,616 INFO L225 Difference]: With dead ends: 85 [2018-02-04 02:58:34,616 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 02:58:34,616 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 02:58:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 02:58:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-04 02:58:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 02:58:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-04 02:58:34,621 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 91 [2018-02-04 02:58:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,621 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-04 02:58:34,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:58:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-04 02:58:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 02:58:34,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,623 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 02:58:34,623 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash -913746080, now seen corresponding path program 5 times [2018-02-04 02:58:34,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,701 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 02:58:34,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:58:34,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,702 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 02:58:34,702 INFO L182 omatonBuilderFactory]: Interpolants [1432#true, 1433#false, 1434#(= main_~i~1 0), 1435#(<= main_~i~1 1), 1436#(<= main_~i~1 2), 1437#(<= main_~i~1 3)] [2018-02-04 02:58:34,702 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 02:58:34,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:58:34,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:58:34,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:58:34,703 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states. [2018-02-04 02:58:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,764 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-04 02:58:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:58:34,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-02-04 02:58:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,765 INFO L225 Difference]: With dead ends: 116 [2018-02-04 02:58:34,765 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 02:58:34,766 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 02:58:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 02:58:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2018-02-04 02:58:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 02:58:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-04 02:58:34,769 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 109 [2018-02-04 02:58:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:34,770 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-04 02:58:34,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:58:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-04 02:58:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 02:58:34,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:34,771 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 02:58:34,771 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 969284025, now seen corresponding path program 6 times [2018-02-04 02:58:34,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:34,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:34,961 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 02:58:34,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:34,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:58:34,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:34,962 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 02:58:34,962 INFO L182 omatonBuilderFactory]: Interpolants [1648#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1649#(not (= |foo_#in~size| 32)), 1643#true, 1644#false, 1645#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1646#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 1647#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:34,962 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 02:58:34,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:58:34,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:58:34,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:58:34,963 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-04 02:58:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:34,997 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-04 02:58:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:58:34,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-02-04 02:58:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:34,998 INFO L225 Difference]: With dead ends: 102 [2018-02-04 02:58:34,999 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 02:58:34,999 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 02:58:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 02:58:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 02:58:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 02:58:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-02-04 02:58:35,003 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 139 [2018-02-04 02:58:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:35,003 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-02-04 02:58:35,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:58:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-02-04 02:58:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 02:58:35,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:35,006 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 02:58:35,006 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1862037927, now seen corresponding path program 7 times [2018-02-04 02:58:35,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:35,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:35,073 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 02:58:35,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:35,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:58:35,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:35,074 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 02:58:35,075 INFO L182 omatonBuilderFactory]: Interpolants [1849#true, 1850#false, 1851#(= main_~i~1 0), 1852#(<= main_~i~1 1), 1853#(<= main_~i~1 2), 1854#(<= main_~i~1 3), 1855#(<= main_~i~1 4)] [2018-02-04 02:58:35,075 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 02:58:35,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:58:35,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:58:35,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:58:35,076 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 7 states. [2018-02-04 02:58:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:35,132 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-04 02:58:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:58:35,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-02-04 02:58:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:35,133 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:58:35,133 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 02:58:35,133 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 02:58:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 02:58:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-02-04 02:58:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:58:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-02-04 02:58:35,137 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 163 [2018-02-04 02:58:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:35,138 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-02-04 02:58:35,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:58:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-02-04 02:58:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 02:58:35,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:35,141 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 02:58:35,141 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1319247558, now seen corresponding path program 8 times [2018-02-04 02:58:35,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:35,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:35,398 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 02:58:35,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:35,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:58:35,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:35,400 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 02:58:35,400 INFO L182 omatonBuilderFactory]: Interpolants [2100#true, 2101#false, 2102#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2103#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2104#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2105#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2106#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2107#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:35,401 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 02:58:35,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:58:35,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:58:35,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:58:35,402 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 8 states. [2018-02-04 02:58:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:35,466 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-04 02:58:35,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:58:35,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2018-02-04 02:58:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:35,470 INFO L225 Difference]: With dead ends: 119 [2018-02-04 02:58:35,471 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 02:58:35,471 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 02:58:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 02:58:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 02:58:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 02:58:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-02-04 02:58:35,477 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 199 [2018-02-04 02:58:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:35,478 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-02-04 02:58:35,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:58:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-02-04 02:58:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 02:58:35,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:35,481 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 02:58:35,481 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash 125993506, now seen corresponding path program 9 times [2018-02-04 02:58:35,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:35,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:35,622 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 02:58:35,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:35,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:58:35,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:35,623 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 02:58:35,623 INFO L182 omatonBuilderFactory]: Interpolants [2341#true, 2342#false, 2343#(= main_~i~1 0), 2344#(<= main_~i~1 1), 2345#(<= main_~i~1 2), 2346#(<= main_~i~1 3), 2347#(<= main_~i~1 4), 2348#(<= main_~i~1 5)] [2018-02-04 02:58:35,624 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 02:58:35,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:58:35,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:58:35,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:58:35,624 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 8 states. [2018-02-04 02:58:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:35,720 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-02-04 02:58:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:58:35,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-02-04 02:58:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:35,721 INFO L225 Difference]: With dead ends: 160 [2018-02-04 02:58:35,721 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 02:58:35,721 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 02:58:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 02:58:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-02-04 02:58:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 02:58:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-02-04 02:58:35,725 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 229 [2018-02-04 02:58:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:35,726 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-02-04 02:58:35,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:58:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-02-04 02:58:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 02:58:35,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:35,733 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 02:58:35,733 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2046000651, now seen corresponding path program 10 times [2018-02-04 02:58:35,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:35,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:36,016 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 02:58:36,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:36,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:58:36,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:36,017 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 02:58:36,017 INFO L182 omatonBuilderFactory]: Interpolants [2640#(not (= |foo_#in~size| 32)), 2632#true, 2633#false, 2634#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2635#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2636#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2637#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2638#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 2639#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:36,018 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 02:58:36,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:58:36,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:58:36,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:58:36,018 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 9 states. [2018-02-04 02:58:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:36,066 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-02-04 02:58:36,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:58:36,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-02-04 02:58:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:36,066 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:58:36,066 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 02:58:36,067 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 02:58:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 02:58:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-02-04 02:58:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 02:58:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-02-04 02:58:36,069 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 271 [2018-02-04 02:58:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:36,070 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-02-04 02:58:36,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:58:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-02-04 02:58:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 02:58:36,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:36,071 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 02:58:36,071 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash -416957317, now seen corresponding path program 11 times [2018-02-04 02:58:36,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:36,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:36,223 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 02:58:36,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:36,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:58:36,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:36,224 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 02:58:36,224 INFO L182 omatonBuilderFactory]: Interpolants [2912#(<= main_~i~1 2), 2913#(<= main_~i~1 3), 2914#(<= main_~i~1 4), 2915#(<= main_~i~1 5), 2916#(<= main_~i~1 6), 2908#true, 2909#false, 2910#(= main_~i~1 0), 2911#(<= main_~i~1 1)] [2018-02-04 02:58:36,225 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 02:58:36,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:58:36,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:58:36,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:58:36,226 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 9 states. [2018-02-04 02:58:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:36,331 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-04 02:58:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:58:36,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2018-02-04 02:58:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:36,333 INFO L225 Difference]: With dead ends: 182 [2018-02-04 02:58:36,333 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 02:58:36,333 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 02:58:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 02:58:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-02-04 02:58:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 02:58:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2018-02-04 02:58:36,338 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 307 [2018-02-04 02:58:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:36,339 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2018-02-04 02:58:36,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:58:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2018-02-04 02:58:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-04 02:58:36,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:36,342 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 02:58:36,342 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1766255124, now seen corresponding path program 12 times [2018-02-04 02:58:36,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:36,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:36,713 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 02:58:36,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:36,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:58:36,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:36,715 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 02:58:36,715 INFO L182 omatonBuilderFactory]: Interpolants [3248#(not (= |foo_#in~size| 32)), 3239#true, 3240#false, 3241#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3242#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3243#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3244#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3245#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3246#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3247#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:36,716 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 02:58:36,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:58:36,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:58:36,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:58:36,717 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand 10 states. [2018-02-04 02:58:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:36,778 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-02-04 02:58:36,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:58:36,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 355 [2018-02-04 02:58:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:36,779 INFO L225 Difference]: With dead ends: 153 [2018-02-04 02:58:36,779 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 02:58:36,779 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 02:58:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 02:58:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-02-04 02:58:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 02:58:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-04 02:58:36,782 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 355 [2018-02-04 02:58:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:36,782 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-04 02:58:36,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:58:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-04 02:58:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 02:58:36,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:36,784 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 02:58:36,784 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1901043492, now seen corresponding path program 13 times [2018-02-04 02:58:36,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:36,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:37,072 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 02:58:37,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:37,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:58:37,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:37,073 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 02:58:37,073 INFO L182 omatonBuilderFactory]: Interpolants [3552#(= main_~i~1 0), 3553#(<= main_~i~1 1), 3554#(<= main_~i~1 2), 3555#(<= main_~i~1 3), 3556#(<= main_~i~1 4), 3557#(<= main_~i~1 5), 3558#(<= main_~i~1 6), 3559#(<= main_~i~1 7), 3550#true, 3551#false] [2018-02-04 02:58:37,075 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 02:58:37,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:58:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:58:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:58:37,076 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 10 states. [2018-02-04 02:58:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:37,211 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2018-02-04 02:58:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:58:37,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 397 [2018-02-04 02:58:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:37,213 INFO L225 Difference]: With dead ends: 204 [2018-02-04 02:58:37,213 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 02:58:37,213 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 02:58:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 02:58:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2018-02-04 02:58:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 02:58:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2018-02-04 02:58:37,218 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 397 [2018-02-04 02:58:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:37,218 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2018-02-04 02:58:37,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:58:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2018-02-04 02:58:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-04 02:58:37,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:37,221 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 02:58:37,221 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 319186589, now seen corresponding path program 14 times [2018-02-04 02:58:37,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:37,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:37,770 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 02:58:37,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:37,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:58:37,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:37,771 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 02:58:37,772 INFO L182 omatonBuilderFactory]: Interpolants [3921#true, 3922#false, 3923#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3924#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3925#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3926#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3927#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3928#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3929#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3930#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 3931#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:37,772 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 02:58:37,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:58:37,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:58:37,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:58:37,773 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2018-02-04 02:58:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:37,841 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-02-04 02:58:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:58:37,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 451 [2018-02-04 02:58:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:37,843 INFO L225 Difference]: With dead ends: 170 [2018-02-04 02:58:37,843 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 02:58:37,843 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 02:58:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 02:58:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-02-04 02:58:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 02:58:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-04 02:58:37,846 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 451 [2018-02-04 02:58:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:37,847 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-04 02:58:37,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:58:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-04 02:58:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-04 02:58:37,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:37,849 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 02:58:37,849 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash -702635043, now seen corresponding path program 15 times [2018-02-04 02:58:37,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:37,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:38,234 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 02:58:38,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:38,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:58:38,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:38,235 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 02:58:38,235 INFO L182 omatonBuilderFactory]: Interpolants [4272#(<= main_~i~1 3), 4273#(<= main_~i~1 4), 4274#(<= main_~i~1 5), 4275#(<= main_~i~1 6), 4276#(<= main_~i~1 7), 4277#(<= main_~i~1 8), 4267#true, 4268#false, 4269#(= main_~i~1 0), 4270#(<= main_~i~1 1), 4271#(<= main_~i~1 2)] [2018-02-04 02:58:38,236 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 02:58:38,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:58:38,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:58:38,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:58:38,236 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 11 states. [2018-02-04 02:58:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:38,347 INFO L93 Difference]: Finished difference Result 226 states and 238 transitions. [2018-02-04 02:58:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:58:38,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 499 [2018-02-04 02:58:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:38,351 INFO L225 Difference]: With dead ends: 226 [2018-02-04 02:58:38,351 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 02:58:38,351 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 02:58:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 02:58:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2018-02-04 02:58:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 02:58:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2018-02-04 02:58:38,357 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 499 [2018-02-04 02:58:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:38,358 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2018-02-04 02:58:38,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:58:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2018-02-04 02:58:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-02-04 02:58:38,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:38,361 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 02:58:38,362 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1002440158, now seen corresponding path program 16 times [2018-02-04 02:58:38,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:38,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:39,095 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 02:58:39,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:39,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:58:39,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:39,097 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 02:58:39,097 INFO L182 omatonBuilderFactory]: Interpolants [4688#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 4689#(not (= |foo_#in~size| 32)), 4678#true, 4679#false, 4680#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4681#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4682#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4683#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4684#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4685#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4686#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 4687#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:39,098 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 02:58:39,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:58:39,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:58:39,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:58:39,099 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 12 states. [2018-02-04 02:58:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:39,187 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-02-04 02:58:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:58:39,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 559 [2018-02-04 02:58:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:39,189 INFO L225 Difference]: With dead ends: 187 [2018-02-04 02:58:39,189 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 02:58:39,189 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 02:58:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 02:58:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-02-04 02:58:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 02:58:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-04 02:58:39,192 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 559 [2018-02-04 02:58:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:39,192 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-04 02:58:39,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:58:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-04 02:58:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-02-04 02:58:39,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:39,195 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 02:58:39,195 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -978150298, now seen corresponding path program 17 times [2018-02-04 02:58:39,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:39,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:39,667 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 02:58:39,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:39,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:58:39,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:39,668 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 02:58:39,668 INFO L182 omatonBuilderFactory]: Interpolants [5059#true, 5060#false, 5061#(= main_~i~1 0), 5062#(<= main_~i~1 1), 5063#(<= main_~i~1 2), 5064#(<= main_~i~1 3), 5065#(<= main_~i~1 4), 5066#(<= main_~i~1 5), 5067#(<= main_~i~1 6), 5068#(<= main_~i~1 7), 5069#(<= main_~i~1 8), 5070#(<= main_~i~1 9)] [2018-02-04 02:58:39,668 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 02:58:39,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:58:39,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:58:39,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:58:39,669 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 12 states. [2018-02-04 02:58:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:39,827 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2018-02-04 02:58:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:58:39,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 613 [2018-02-04 02:58:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:39,830 INFO L225 Difference]: With dead ends: 248 [2018-02-04 02:58:39,830 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 02:58:39,830 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 02:58:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 02:58:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2018-02-04 02:58:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 02:58:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2018-02-04 02:58:39,835 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 613 [2018-02-04 02:58:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:39,836 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2018-02-04 02:58:39,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:58:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2018-02-04 02:58:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-02-04 02:58:39,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:39,840 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 02:58:39,841 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 711631215, now seen corresponding path program 18 times [2018-02-04 02:58:39,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:39,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:40,752 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 02:58:40,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:40,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:58:40,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:40,753 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 02:58:40,753 INFO L182 omatonBuilderFactory]: Interpolants [5510#true, 5511#false, 5512#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5513#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5514#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5515#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5516#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5517#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5518#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5519#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5520#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 5521#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 5522#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:40,754 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 02:58:40,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:58:40,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:58:40,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:58:40,755 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states. [2018-02-04 02:58:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:40,812 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-02-04 02:58:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:58:40,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 679 [2018-02-04 02:58:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:40,814 INFO L225 Difference]: With dead ends: 204 [2018-02-04 02:58:40,814 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 02:58:40,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:58:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 02:58:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-02-04 02:58:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 02:58:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-04 02:58:40,819 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 679 [2018-02-04 02:58:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:40,820 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-04 02:58:40,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:58:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-04 02:58:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-02-04 02:58:40,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:40,826 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 02:58:40,826 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1834618241, now seen corresponding path program 19 times [2018-02-04 02:58:40,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:40,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:41,655 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 02:58:41,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:41,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:58:41,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:41,656 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 02:58:41,656 INFO L182 omatonBuilderFactory]: Interpolants [5926#true, 5927#false, 5928#(= main_~i~1 0), 5929#(<= main_~i~1 1), 5930#(<= main_~i~1 2), 5931#(<= main_~i~1 3), 5932#(<= main_~i~1 4), 5933#(<= main_~i~1 5), 5934#(<= main_~i~1 6), 5935#(<= main_~i~1 7), 5936#(<= main_~i~1 8), 5937#(<= main_~i~1 9), 5938#(<= main_~i~1 10)] [2018-02-04 02:58:41,657 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 02:58:41,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:58:41,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:58:41,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:58:41,658 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 13 states. [2018-02-04 02:58:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:41,804 INFO L93 Difference]: Finished difference Result 270 states and 284 transitions. [2018-02-04 02:58:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:58:41,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 739 [2018-02-04 02:58:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:41,807 INFO L225 Difference]: With dead ends: 270 [2018-02-04 02:58:41,807 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 02:58:41,807 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 02:58:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 02:58:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 208. [2018-02-04 02:58:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 02:58:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2018-02-04 02:58:41,813 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 739 [2018-02-04 02:58:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:41,813 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2018-02-04 02:58:41,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:58:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2018-02-04 02:58:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2018-02-04 02:58:41,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:41,819 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 02:58:41,819 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2041430256, now seen corresponding path program 20 times [2018-02-04 02:58:41,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:41,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:42,846 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 02:58:42,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:42,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:58:42,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:42,847 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 02:58:42,847 INFO L182 omatonBuilderFactory]: Interpolants [6417#true, 6418#false, 6419#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6420#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6421#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6422#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6423#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6424#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6425#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6426#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6427#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 6428#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6429#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 6430#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:42,848 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 02:58:42,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:58:42,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:58:42,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:58:42,849 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 14 states. [2018-02-04 02:58:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:42,949 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2018-02-04 02:58:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:58:42,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 811 [2018-02-04 02:58:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:42,952 INFO L225 Difference]: With dead ends: 221 [2018-02-04 02:58:42,952 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 02:58:42,952 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 02:58:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 02:58:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-02-04 02:58:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 02:58:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2018-02-04 02:58:42,955 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 811 [2018-02-04 02:58:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:42,956 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2018-02-04 02:58:42,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:58:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2018-02-04 02:58:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-02-04 02:58:42,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:42,960 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 02:58:42,960 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1088231448, now seen corresponding path program 21 times [2018-02-04 02:58:42,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:42,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:43,688 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 02:58:43,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:43,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:58:43,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:43,754 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 02:58:43,754 INFO L182 omatonBuilderFactory]: Interpolants [6880#(<= main_~i~1 10), 6881#(<= main_~i~1 11), 6868#true, 6869#false, 6870#(= main_~i~1 0), 6871#(<= main_~i~1 1), 6872#(<= main_~i~1 2), 6873#(<= main_~i~1 3), 6874#(<= main_~i~1 4), 6875#(<= main_~i~1 5), 6876#(<= main_~i~1 6), 6877#(<= main_~i~1 7), 6878#(<= main_~i~1 8), 6879#(<= main_~i~1 9)] [2018-02-04 02:58:43,755 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 02:58:43,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:58:43,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:58:43,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:58:43,756 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 14 states. [2018-02-04 02:58:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:43,861 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2018-02-04 02:58:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:58:43,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 877 [2018-02-04 02:58:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:43,863 INFO L225 Difference]: With dead ends: 292 [2018-02-04 02:58:43,864 INFO L226 Difference]: Without dead ends: 292 [2018-02-04 02:58:43,864 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 02:58:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-04 02:58:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 225. [2018-02-04 02:58:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 02:58:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-02-04 02:58:43,869 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 877 [2018-02-04 02:58:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:43,870 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-02-04 02:58:43,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:58:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-02-04 02:58:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-02-04 02:58:43,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:43,878 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 02:58:43,878 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -500335487, now seen corresponding path program 22 times [2018-02-04 02:58:43,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:43,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:45,186 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 02:58:45,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:45,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:58:45,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:45,186 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 02:58:45,187 INFO L182 omatonBuilderFactory]: Interpolants [7399#true, 7400#false, 7401#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7402#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7403#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7404#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7405#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7406#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7407#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7408#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7409#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 7410#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7411#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7412#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 7413#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:45,187 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 02:58:45,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:58:45,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:58:45,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:58:45,188 INFO L87 Difference]: Start difference. First operand 225 states and 250 transitions. Second operand 15 states. [2018-02-04 02:58:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:45,245 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-02-04 02:58:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:58:45,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 955 [2018-02-04 02:58:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:45,247 INFO L225 Difference]: With dead ends: 238 [2018-02-04 02:58:45,247 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 02:58:45,247 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 02:58:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 02:58:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-02-04 02:58:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 02:58:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 256 transitions. [2018-02-04 02:58:45,252 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 256 transitions. Word has length 955 [2018-02-04 02:58:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:45,253 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 256 transitions. [2018-02-04 02:58:45,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:58:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 256 transitions. [2018-02-04 02:58:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-02-04 02:58:45,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:45,262 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 02:58:45,262 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1879255455, now seen corresponding path program 23 times [2018-02-04 02:58:45,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:45,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:46,441 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 02:58:46,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:46,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:58:46,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:46,442 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 02:58:46,442 INFO L182 omatonBuilderFactory]: Interpolants [7885#true, 7886#false, 7887#(= main_~i~1 0), 7888#(<= main_~i~1 1), 7889#(<= main_~i~1 2), 7890#(<= main_~i~1 3), 7891#(<= main_~i~1 4), 7892#(<= main_~i~1 5), 7893#(<= main_~i~1 6), 7894#(<= main_~i~1 7), 7895#(<= main_~i~1 8), 7896#(<= main_~i~1 9), 7897#(<= main_~i~1 10), 7898#(<= main_~i~1 11), 7899#(<= main_~i~1 12)] [2018-02-04 02:58:46,443 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 02:58:46,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:58:46,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:58:46,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:58:46,444 INFO L87 Difference]: Start difference. First operand 231 states and 256 transitions. Second operand 15 states. [2018-02-04 02:58:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:46,540 INFO L93 Difference]: Finished difference Result 314 states and 330 transitions. [2018-02-04 02:58:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:58:46,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1027 [2018-02-04 02:58:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:46,542 INFO L225 Difference]: With dead ends: 314 [2018-02-04 02:58:46,542 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 02:58:46,543 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 02:58:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 02:58:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2018-02-04 02:58:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 02:58:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-02-04 02:58:46,547 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 1027 [2018-02-04 02:58:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:46,547 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-02-04 02:58:46,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:58:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-02-04 02:58:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-02-04 02:58:46,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:46,554 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 02:58:46,554 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1856294786, now seen corresponding path program 24 times [2018-02-04 02:58:46,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:46,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:48,013 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 02:58:48,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:48,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:58:48,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:48,013 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 02:58:48,014 INFO L182 omatonBuilderFactory]: Interpolants [8456#true, 8457#false, 8458#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8459#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8460#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8461#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8462#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8463#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8464#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8465#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8466#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 8467#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8468#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8469#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8470#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 8471#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:48,015 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 02:58:48,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:58:48,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:58:48,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:58:48,015 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 16 states. [2018-02-04 02:58:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:48,071 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2018-02-04 02:58:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:58:48,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1111 [2018-02-04 02:58:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:48,072 INFO L225 Difference]: With dead ends: 255 [2018-02-04 02:58:48,072 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 02:58:48,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:58:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 02:58:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2018-02-04 02:58:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 02:58:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2018-02-04 02:58:48,076 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 1111 [2018-02-04 02:58:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:48,077 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2018-02-04 02:58:48,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:58:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2018-02-04 02:58:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2018-02-04 02:58:48,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:48,087 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 02:58:48,087 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1396010922, now seen corresponding path program 25 times [2018-02-04 02:58:48,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:48,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:49,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 02:58:49,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:49,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:58:49,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:49,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 02:58:49,446 INFO L182 omatonBuilderFactory]: Interpolants [8992#(<= main_~i~1 13), 8977#true, 8978#false, 8979#(= main_~i~1 0), 8980#(<= main_~i~1 1), 8981#(<= main_~i~1 2), 8982#(<= main_~i~1 3), 8983#(<= main_~i~1 4), 8984#(<= main_~i~1 5), 8985#(<= main_~i~1 6), 8986#(<= main_~i~1 7), 8987#(<= main_~i~1 8), 8988#(<= main_~i~1 9), 8989#(<= main_~i~1 10), 8990#(<= main_~i~1 11), 8991#(<= main_~i~1 12)] [2018-02-04 02:58:49,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 02:58:49,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:58:49,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:58:49,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:58:49,448 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand 16 states. [2018-02-04 02:58:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:49,553 INFO L93 Difference]: Finished difference Result 336 states and 353 transitions. [2018-02-04 02:58:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:58:49,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1189 [2018-02-04 02:58:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:49,555 INFO L225 Difference]: With dead ends: 336 [2018-02-04 02:58:49,555 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 02:58:49,555 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 02:58:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 02:58:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 259. [2018-02-04 02:58:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 02:58:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2018-02-04 02:58:49,561 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 1189 [2018-02-04 02:58:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:49,562 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2018-02-04 02:58:49,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:58:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2018-02-04 02:58:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-02-04 02:58:49,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:49,574 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 02:58:49,574 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash -601504301, now seen corresponding path program 26 times [2018-02-04 02:58:49,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:49,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:51,450 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 02:58:51,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:51,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:58:51,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:51,451 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 02:58:51,451 INFO L182 omatonBuilderFactory]: Interpolants [9600#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9601#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9602#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9603#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9604#(not (= |foo_#in~size| 32)), 9588#true, 9589#false, 9590#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9591#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9592#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9593#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9594#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9595#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9596#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9597#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 9598#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 9599#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:58:51,453 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 02:58:51,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:58:51,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:58:51,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:58:51,454 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 17 states. [2018-02-04 02:58:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:51,510 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions. [2018-02-04 02:58:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:58:51,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1279 [2018-02-04 02:58:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:51,511 INFO L225 Difference]: With dead ends: 272 [2018-02-04 02:58:51,511 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 02:58:51,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:58:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 02:58:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-02-04 02:58:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 02:58:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 294 transitions. [2018-02-04 02:58:51,516 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 294 transitions. Word has length 1279 [2018-02-04 02:58:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:51,516 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 294 transitions. [2018-02-04 02:58:51,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:58:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 294 transitions. [2018-02-04 02:58:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-02-04 02:58:51,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:51,524 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 02:58:51,525 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1767243139, now seen corresponding path program 27 times [2018-02-04 02:58:51,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:51,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:53,330 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 02:58:53,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:53,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:58:53,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:53,331 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 02:58:53,331 INFO L182 omatonBuilderFactory]: Interpolants [10144#true, 10145#false, 10146#(= main_~i~1 0), 10147#(<= main_~i~1 1), 10148#(<= main_~i~1 2), 10149#(<= main_~i~1 3), 10150#(<= main_~i~1 4), 10151#(<= main_~i~1 5), 10152#(<= main_~i~1 6), 10153#(<= main_~i~1 7), 10154#(<= main_~i~1 8), 10155#(<= main_~i~1 9), 10156#(<= main_~i~1 10), 10157#(<= main_~i~1 11), 10158#(<= main_~i~1 12), 10159#(<= main_~i~1 13), 10160#(<= main_~i~1 14)] [2018-02-04 02:58:53,332 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 02:58:53,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:58:53,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:58:53,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:58:53,333 INFO L87 Difference]: Start difference. First operand 265 states and 294 transitions. Second operand 17 states. [2018-02-04 02:58:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:53,456 INFO L93 Difference]: Finished difference Result 358 states and 376 transitions. [2018-02-04 02:58:53,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:58:53,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1363 [2018-02-04 02:58:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:53,458 INFO L225 Difference]: With dead ends: 358 [2018-02-04 02:58:53,458 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 02:58:53,458 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 02:58:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 02:58:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276. [2018-02-04 02:58:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 02:58:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 307 transitions. [2018-02-04 02:58:53,465 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 307 transitions. Word has length 1363 [2018-02-04 02:58:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:53,466 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 307 transitions. [2018-02-04 02:58:53,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:58:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 307 transitions. [2018-02-04 02:58:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1460 [2018-02-04 02:58:53,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:53,482 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 02:58:53,482 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 946488628, now seen corresponding path program 28 times [2018-02-04 02:58:53,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:53,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:55,910 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 02:58:55,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:55,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:58:55,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:55,911 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 02:58:55,911 INFO L182 omatonBuilderFactory]: Interpolants [10795#true, 10796#false, 10797#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10798#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10799#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10800#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10801#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10802#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10803#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10804#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10805#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 10806#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10807#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10808#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10809#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10810#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10811#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 10812#(not (= |foo_#in~size| 32))] [2018-02-04 02:58:55,913 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 02:58:55,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:58:55,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:58:55,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:58:55,914 INFO L87 Difference]: Start difference. First operand 276 states and 307 transitions. Second operand 18 states. [2018-02-04 02:58:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:55,992 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-02-04 02:58:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:58:55,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1459 [2018-02-04 02:58:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:55,993 INFO L225 Difference]: With dead ends: 289 [2018-02-04 02:58:55,993 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 02:58:55,993 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 02:58:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 02:58:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-02-04 02:58:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-04 02:58:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2018-02-04 02:58:55,997 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 1459 [2018-02-04 02:58:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:55,998 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2018-02-04 02:58:55,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:58:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2018-02-04 02:58:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550 [2018-02-04 02:58:56,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:56,013 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 02:58:56,013 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash -754671188, now seen corresponding path program 29 times [2018-02-04 02:58:56,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:56,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:58:58,172 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 02:58:58,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:58:58,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:58:58,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:58:58,173 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 02:58:58,173 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~1 4), 11393#(<= main_~i~1 5), 11394#(<= main_~i~1 6), 11395#(<= main_~i~1 7), 11396#(<= main_~i~1 8), 11397#(<= main_~i~1 9), 11398#(<= main_~i~1 10), 11399#(<= main_~i~1 11), 11400#(<= main_~i~1 12), 11401#(<= main_~i~1 13), 11402#(<= main_~i~1 14), 11403#(<= main_~i~1 15), 11386#true, 11387#false, 11388#(= main_~i~1 0), 11389#(<= main_~i~1 1), 11390#(<= main_~i~1 2), 11391#(<= main_~i~1 3)] [2018-02-04 02:58:58,175 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 02:58:58,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:58:58,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:58:58,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:58:58,175 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand 18 states. [2018-02-04 02:58:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:58:58,311 INFO L93 Difference]: Finished difference Result 380 states and 399 transitions. [2018-02-04 02:58:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:58:58,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1549 [2018-02-04 02:58:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:58:58,312 INFO L225 Difference]: With dead ends: 380 [2018-02-04 02:58:58,313 INFO L226 Difference]: Without dead ends: 380 [2018-02-04 02:58:58,313 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 02:58:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-04 02:58:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 293. [2018-02-04 02:58:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 02:58:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 326 transitions. [2018-02-04 02:58:58,318 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 326 transitions. Word has length 1549 [2018-02-04 02:58:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:58:58,319 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 326 transitions. [2018-02-04 02:58:58,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:58:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 326 transitions. [2018-02-04 02:58:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2018-02-04 02:58:58,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:58:58,332 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 02:58:58,332 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:58:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1444662117, now seen corresponding path program 30 times [2018-02-04 02:58:58,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:58:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:58:58,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:01,395 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 02:59:01,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:01,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:59:01,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:01,397 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 02:59:01,397 INFO L182 omatonBuilderFactory]: Interpolants [12077#true, 12078#false, 12079#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12080#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12081#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12082#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12083#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12084#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12085#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12086#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12087#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 12088#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12089#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12090#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12091#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12092#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12093#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12094#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 12095#(not (= |foo_#in~size| 32))] [2018-02-04 02:59:01,399 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 02:59:01,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:59:01,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:59:01,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:59:01,400 INFO L87 Difference]: Start difference. First operand 293 states and 326 transitions. Second operand 19 states. [2018-02-04 02:59:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:01,486 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-02-04 02:59:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:59:01,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1651 [2018-02-04 02:59:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:01,487 INFO L225 Difference]: With dead ends: 306 [2018-02-04 02:59:01,487 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 02:59:01,487 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 02:59:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 02:59:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-02-04 02:59:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 02:59:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2018-02-04 02:59:01,493 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 1651 [2018-02-04 02:59:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:01,493 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2018-02-04 02:59:01,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:59:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2018-02-04 02:59:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2018-02-04 02:59:01,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:01,511 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 02:59:01,511 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 104699365, now seen corresponding path program 31 times [2018-02-04 02:59:01,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:01,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:04,382 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 02:59:04,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:04,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:59:04,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:04,383 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 02:59:04,383 INFO L182 omatonBuilderFactory]: Interpolants [12704#false, 12705#(= main_~i~1 0), 12706#(<= main_~i~1 1), 12707#(<= main_~i~1 2), 12708#(<= main_~i~1 3), 12709#(<= main_~i~1 4), 12710#(<= main_~i~1 5), 12711#(<= main_~i~1 6), 12712#(<= main_~i~1 7), 12713#(<= main_~i~1 8), 12714#(<= main_~i~1 9), 12715#(<= main_~i~1 10), 12716#(<= main_~i~1 11), 12717#(<= main_~i~1 12), 12718#(<= main_~i~1 13), 12719#(<= main_~i~1 14), 12720#(<= main_~i~1 15), 12721#(<= main_~i~1 16), 12703#true] [2018-02-04 02:59:04,386 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 02:59:04,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:59:04,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:59:04,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:59:04,386 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand 19 states. [2018-02-04 02:59:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:04,530 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions. [2018-02-04 02:59:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:59:04,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1747 [2018-02-04 02:59:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:04,532 INFO L225 Difference]: With dead ends: 402 [2018-02-04 02:59:04,532 INFO L226 Difference]: Without dead ends: 402 [2018-02-04 02:59:04,533 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 02:59:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-04 02:59:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 310. [2018-02-04 02:59:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 02:59:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 345 transitions. [2018-02-04 02:59:04,537 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 345 transitions. Word has length 1747 [2018-02-04 02:59:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:04,537 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 345 transitions. [2018-02-04 02:59:04,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:59:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 345 transitions. [2018-02-04 02:59:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1856 [2018-02-04 02:59:04,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:04,551 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 02:59:04,551 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -553996762, now seen corresponding path program 32 times [2018-02-04 02:59:04,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:04,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:08,457 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 02:59:08,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:08,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:59:08,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:08,458 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 02:59:08,458 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13441#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13442#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13443#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13444#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 13445#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13446#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13447#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13448#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13449#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13450#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13451#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13452#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13453#(not (= |foo_#in~size| 32)), 13434#true, 13435#false, 13436#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13437#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13438#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 13439#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:59:08,461 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 02:59:08,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:59:08,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:59:08,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:59:08,462 INFO L87 Difference]: Start difference. First operand 310 states and 345 transitions. Second operand 20 states. [2018-02-04 02:59:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:08,534 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2018-02-04 02:59:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:59:08,534 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1855 [2018-02-04 02:59:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:08,535 INFO L225 Difference]: With dead ends: 323 [2018-02-04 02:59:08,535 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 02:59:08,536 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 02:59:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 02:59:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-02-04 02:59:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 02:59:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 351 transitions. [2018-02-04 02:59:08,539 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 351 transitions. Word has length 1855 [2018-02-04 02:59:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:08,539 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 351 transitions. [2018-02-04 02:59:08,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:59:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2018-02-04 02:59:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958 [2018-02-04 02:59:08,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:08,555 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 02:59:08,555 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:08,555 INFO L82 PathProgramCache]: Analyzing trace with hash 546860014, now seen corresponding path program 33 times [2018-02-04 02:59:08,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:08,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:12,123 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 02:59:12,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:12,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:59:12,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:12,124 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 02:59:12,124 INFO L182 omatonBuilderFactory]: Interpolants [14112#(<= main_~i~1 15), 14113#(<= main_~i~1 16), 14114#(<= main_~i~1 17), 14095#true, 14096#false, 14097#(= main_~i~1 0), 14098#(<= main_~i~1 1), 14099#(<= main_~i~1 2), 14100#(<= main_~i~1 3), 14101#(<= main_~i~1 4), 14102#(<= main_~i~1 5), 14103#(<= main_~i~1 6), 14104#(<= main_~i~1 7), 14105#(<= main_~i~1 8), 14106#(<= main_~i~1 9), 14107#(<= main_~i~1 10), 14108#(<= main_~i~1 11), 14109#(<= main_~i~1 12), 14110#(<= main_~i~1 13), 14111#(<= main_~i~1 14)] [2018-02-04 02:59:12,127 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 02:59:12,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:59:12,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:59:12,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:59:12,128 INFO L87 Difference]: Start difference. First operand 316 states and 351 transitions. Second operand 20 states. [2018-02-04 02:59:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:12,273 INFO L93 Difference]: Finished difference Result 424 states and 445 transitions. [2018-02-04 02:59:12,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:59:12,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1957 [2018-02-04 02:59:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:12,276 INFO L225 Difference]: With dead ends: 424 [2018-02-04 02:59:12,276 INFO L226 Difference]: Without dead ends: 424 [2018-02-04 02:59:12,276 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 02:59:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-04 02:59:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 327. [2018-02-04 02:59:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 02:59:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 364 transitions. [2018-02-04 02:59:12,280 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 364 transitions. Word has length 1957 [2018-02-04 02:59:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:12,281 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 364 transitions. [2018-02-04 02:59:12,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:59:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 364 transitions. [2018-02-04 02:59:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072 [2018-02-04 02:59:12,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:12,298 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 02:59:12,298 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1829676233, now seen corresponding path program 34 times [2018-02-04 02:59:12,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:12,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:17,299 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 02:59:17,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:17,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:59:17,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:17,335 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 02:59:17,335 INFO L182 omatonBuilderFactory]: Interpolants [14880#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14881#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14882#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14883#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14884#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14885#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14886#(not (= |foo_#in~size| 32)), 14866#true, 14867#false, 14868#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14869#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14870#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14871#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14872#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14873#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14874#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14875#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14876#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 14877#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14878#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 14879#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:59:17,339 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 02:59:17,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:59:17,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:59:17,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:59:17,339 INFO L87 Difference]: Start difference. First operand 327 states and 364 transitions. Second operand 21 states. [2018-02-04 02:59:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:17,412 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-02-04 02:59:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:59:17,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2071 [2018-02-04 02:59:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:17,414 INFO L225 Difference]: With dead ends: 340 [2018-02-04 02:59:17,414 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 02:59:17,414 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 02:59:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 02:59:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-02-04 02:59:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 02:59:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 370 transitions. [2018-02-04 02:59:17,417 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 370 transitions. Word has length 2071 [2018-02-04 02:59:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:17,418 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 370 transitions. [2018-02-04 02:59:17,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:59:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 370 transitions. [2018-02-04 02:59:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2180 [2018-02-04 02:59:17,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:17,436 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 02:59:17,436 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash 771837319, now seen corresponding path program 35 times [2018-02-04 02:59:17,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:17,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:21,936 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 02:59:21,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:21,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:59:21,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:21,937 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 02:59:21,937 INFO L182 omatonBuilderFactory]: Interpolants [15562#true, 15563#false, 15564#(= main_~i~1 0), 15565#(<= main_~i~1 1), 15566#(<= main_~i~1 2), 15567#(<= main_~i~1 3), 15568#(<= main_~i~1 4), 15569#(<= main_~i~1 5), 15570#(<= main_~i~1 6), 15571#(<= main_~i~1 7), 15572#(<= main_~i~1 8), 15573#(<= main_~i~1 9), 15574#(<= main_~i~1 10), 15575#(<= main_~i~1 11), 15576#(<= main_~i~1 12), 15577#(<= main_~i~1 13), 15578#(<= main_~i~1 14), 15579#(<= main_~i~1 15), 15580#(<= main_~i~1 16), 15581#(<= main_~i~1 17), 15582#(<= main_~i~1 18)] [2018-02-04 02:59:21,940 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 02:59:21,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:59:21,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:59:21,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:59:21,941 INFO L87 Difference]: Start difference. First operand 333 states and 370 transitions. Second operand 21 states. [2018-02-04 02:59:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:22,168 INFO L93 Difference]: Finished difference Result 446 states and 468 transitions. [2018-02-04 02:59:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:59:22,169 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2179 [2018-02-04 02:59:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:22,172 INFO L225 Difference]: With dead ends: 446 [2018-02-04 02:59:22,172 INFO L226 Difference]: Without dead ends: 446 [2018-02-04 02:59:22,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:59:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-04 02:59:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344. [2018-02-04 02:59:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 02:59:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 383 transitions. [2018-02-04 02:59:22,177 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 383 transitions. Word has length 2179 [2018-02-04 02:59:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:22,178 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 383 transitions. [2018-02-04 02:59:22,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:59:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 383 transitions. [2018-02-04 02:59:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300 [2018-02-04 02:59:22,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:22,211 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 02:59:22,211 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1752930392, now seen corresponding path program 36 times [2018-02-04 02:59:22,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:22,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:28,369 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 02:59:28,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:28,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:59:28,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:28,370 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 02:59:28,370 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16385#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16386#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16387#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16388#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16389#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16390#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16391#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16392#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16393#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16394#(not (= |foo_#in~size| 32)), 16373#true, 16374#false, 16375#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16376#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16377#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16378#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16379#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16380#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16381#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16382#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 16383#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8)))] [2018-02-04 02:59:28,374 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 02:59:28,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:59:28,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:59:28,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:59:28,375 INFO L87 Difference]: Start difference. First operand 344 states and 383 transitions. Second operand 22 states. [2018-02-04 02:59:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:28,455 INFO L93 Difference]: Finished difference Result 357 states and 396 transitions. [2018-02-04 02:59:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:59:28,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2299 [2018-02-04 02:59:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:28,456 INFO L225 Difference]: With dead ends: 357 [2018-02-04 02:59:28,456 INFO L226 Difference]: Without dead ends: 354 [2018-02-04 02:59:28,457 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 02:59:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-04 02:59:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2018-02-04 02:59:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 02:59:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 389 transitions. [2018-02-04 02:59:28,460 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 389 transitions. Word has length 2299 [2018-02-04 02:59:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:28,461 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 389 transitions. [2018-02-04 02:59:28,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:59:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 389 transitions. [2018-02-04 02:59:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2414 [2018-02-04 02:59:28,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:28,482 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 02:59:28,482 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 760102000, now seen corresponding path program 37 times [2018-02-04 02:59:28,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:28,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:34,105 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 02:59:34,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:34,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:59:34,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:34,106 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 02:59:34,107 INFO L182 omatonBuilderFactory]: Interpolants [17120#(<= main_~i~1 14), 17121#(<= main_~i~1 15), 17122#(<= main_~i~1 16), 17123#(<= main_~i~1 17), 17124#(<= main_~i~1 18), 17125#(<= main_~i~1 19), 17104#true, 17105#false, 17106#(= main_~i~1 0), 17107#(<= main_~i~1 1), 17108#(<= main_~i~1 2), 17109#(<= main_~i~1 3), 17110#(<= main_~i~1 4), 17111#(<= main_~i~1 5), 17112#(<= main_~i~1 6), 17113#(<= main_~i~1 7), 17114#(<= main_~i~1 8), 17115#(<= main_~i~1 9), 17116#(<= main_~i~1 10), 17117#(<= main_~i~1 11), 17118#(<= main_~i~1 12), 17119#(<= main_~i~1 13)] [2018-02-04 02:59:34,110 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 02:59:34,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:59:34,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:59:34,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:59:34,111 INFO L87 Difference]: Start difference. First operand 350 states and 389 transitions. Second operand 22 states. [2018-02-04 02:59:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:34,273 INFO L93 Difference]: Finished difference Result 468 states and 491 transitions. [2018-02-04 02:59:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:59:34,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2413 [2018-02-04 02:59:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:34,275 INFO L225 Difference]: With dead ends: 468 [2018-02-04 02:59:34,275 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 02:59:34,276 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 02:59:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 02:59:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 361. [2018-02-04 02:59:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-04 02:59:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 402 transitions. [2018-02-04 02:59:34,280 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 402 transitions. Word has length 2413 [2018-02-04 02:59:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:34,282 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 402 transitions. [2018-02-04 02:59:34,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:59:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 402 transitions. [2018-02-04 02:59:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2540 [2018-02-04 02:59:34,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:34,307 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 02:59:34,307 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1154073417, now seen corresponding path program 38 times [2018-02-04 02:59:34,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:34,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:41,895 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 02:59:41,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:41,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:59:41,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:41,896 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 02:59:41,896 INFO L182 omatonBuilderFactory]: Interpolants [17955#true, 17956#false, 17957#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17958#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17959#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17960#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17961#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17962#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17963#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17964#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17965#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 17966#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17967#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17968#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17969#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17970#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17971#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17972#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17973#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17974#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17975#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17976#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 17977#(not (= |foo_#in~size| 32))] [2018-02-04 02:59:41,900 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 02:59:41,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:59:41,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:59:41,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:59:41,901 INFO L87 Difference]: Start difference. First operand 361 states and 402 transitions. Second operand 23 states. [2018-02-04 02:59:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:42,011 INFO L93 Difference]: Finished difference Result 374 states and 415 transitions. [2018-02-04 02:59:42,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:59:42,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2539 [2018-02-04 02:59:42,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:42,012 INFO L225 Difference]: With dead ends: 374 [2018-02-04 02:59:42,012 INFO L226 Difference]: Without dead ends: 371 [2018-02-04 02:59:42,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:59:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-04 02:59:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-02-04 02:59:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 02:59:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 408 transitions. [2018-02-04 02:59:42,016 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 408 transitions. Word has length 2539 [2018-02-04 02:59:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:42,016 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 408 transitions. [2018-02-04 02:59:42,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:59:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 408 transitions. [2018-02-04 02:59:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2660 [2018-02-04 02:59:42,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:42,044 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 02:59:42,044 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1105702295, now seen corresponding path program 39 times [2018-02-04 02:59:42,044 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:42,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:49,056 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 02:59:49,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:49,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:59:49,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:49,057 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 02:59:49,057 INFO L182 omatonBuilderFactory]: Interpolants [18721#true, 18722#false, 18723#(= main_~i~1 0), 18724#(<= main_~i~1 1), 18725#(<= main_~i~1 2), 18726#(<= main_~i~1 3), 18727#(<= main_~i~1 4), 18728#(<= main_~i~1 5), 18729#(<= main_~i~1 6), 18730#(<= main_~i~1 7), 18731#(<= main_~i~1 8), 18732#(<= main_~i~1 9), 18733#(<= main_~i~1 10), 18734#(<= main_~i~1 11), 18735#(<= main_~i~1 12), 18736#(<= main_~i~1 13), 18737#(<= main_~i~1 14), 18738#(<= main_~i~1 15), 18739#(<= main_~i~1 16), 18740#(<= main_~i~1 17), 18741#(<= main_~i~1 18), 18742#(<= main_~i~1 19), 18743#(<= main_~i~1 20)] [2018-02-04 02:59:49,062 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 02:59:49,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:59:49,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:59:49,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:59:49,062 INFO L87 Difference]: Start difference. First operand 367 states and 408 transitions. Second operand 23 states. [2018-02-04 02:59:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:49,285 INFO L93 Difference]: Finished difference Result 490 states and 514 transitions. [2018-02-04 02:59:49,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:59:49,285 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 2659 [2018-02-04 02:59:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:49,288 INFO L225 Difference]: With dead ends: 490 [2018-02-04 02:59:49,288 INFO L226 Difference]: Without dead ends: 490 [2018-02-04 02:59:49,288 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 02:59:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-04 02:59:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 378. [2018-02-04 02:59:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 02:59:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 421 transitions. [2018-02-04 02:59:49,292 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 421 transitions. Word has length 2659 [2018-02-04 02:59:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:49,292 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 421 transitions. [2018-02-04 02:59:49,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:59:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 421 transitions. [2018-02-04 02:59:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-02-04 02:59:49,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:49,338 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 02:59:49,338 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash -737668662, now seen corresponding path program 40 times [2018-02-04 02:59:49,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:49,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:59:58,611 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 02:59:58,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:59:58,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:59:58,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:59:58,612 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 02:59:58,612 INFO L182 omatonBuilderFactory]: Interpolants [19616#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19617#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19618#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19619#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19620#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19621#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19622#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 19623#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19624#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19625#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19626#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19627#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19628#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19629#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19630#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19631#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19632#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19633#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19634#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19635#(not (= |foo_#in~size| 32)), 19612#true, 19613#false, 19614#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 19615#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 02:59:58,618 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 02:59:58,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:59:58,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:59:58,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:59:58,619 INFO L87 Difference]: Start difference. First operand 378 states and 421 transitions. Second operand 24 states. [2018-02-04 02:59:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:59:58,713 INFO L93 Difference]: Finished difference Result 391 states and 434 transitions. [2018-02-04 02:59:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:59:58,713 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2791 [2018-02-04 02:59:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:59:58,714 INFO L225 Difference]: With dead ends: 391 [2018-02-04 02:59:58,714 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 02:59:58,714 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 02:59:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 02:59:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2018-02-04 02:59:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-04 02:59:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 427 transitions. [2018-02-04 02:59:58,718 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 427 transitions. Word has length 2791 [2018-02-04 02:59:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:59:58,718 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 427 transitions. [2018-02-04 02:59:58,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:59:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 427 transitions. [2018-02-04 02:59:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2918 [2018-02-04 02:59:58,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:59:58,751 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 02:59:58,751 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 02:59:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash -180289230, now seen corresponding path program 41 times [2018-02-04 02:59:58,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:59:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:59:58,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:00:07,380 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 03:00:07,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:00:07,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:00:07,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:00:07,381 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 03:00:07,382 INFO L182 omatonBuilderFactory]: Interpolants [20416#(<= main_~i~1 1), 20417#(<= main_~i~1 2), 20418#(<= main_~i~1 3), 20419#(<= main_~i~1 4), 20420#(<= main_~i~1 5), 20421#(<= main_~i~1 6), 20422#(<= main_~i~1 7), 20423#(<= main_~i~1 8), 20424#(<= main_~i~1 9), 20425#(<= main_~i~1 10), 20426#(<= main_~i~1 11), 20427#(<= main_~i~1 12), 20428#(<= main_~i~1 13), 20429#(<= main_~i~1 14), 20430#(<= main_~i~1 15), 20431#(<= main_~i~1 16), 20432#(<= main_~i~1 17), 20433#(<= main_~i~1 18), 20434#(<= main_~i~1 19), 20435#(<= main_~i~1 20), 20436#(<= main_~i~1 21), 20413#true, 20414#false, 20415#(= main_~i~1 0)] [2018-02-04 03:00:07,387 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 03:00:07,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:00:07,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:00:07,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:00:07,387 INFO L87 Difference]: Start difference. First operand 384 states and 427 transitions. Second operand 24 states. [2018-02-04 03:00:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:00:07,592 INFO L93 Difference]: Finished difference Result 512 states and 537 transitions. [2018-02-04 03:00:07,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:00:07,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2917 [2018-02-04 03:00:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:00:07,594 INFO L225 Difference]: With dead ends: 512 [2018-02-04 03:00:07,594 INFO L226 Difference]: Without dead ends: 512 [2018-02-04 03:00:07,594 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 03:00:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-04 03:00:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 395. [2018-02-04 03:00:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 03:00:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 440 transitions. [2018-02-04 03:00:07,598 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 440 transitions. Word has length 2917 [2018-02-04 03:00:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:00:07,599 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 440 transitions. [2018-02-04 03:00:07,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:00:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 440 transitions. [2018-02-04 03:00:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3056 [2018-02-04 03:00:07,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:00:07,631 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 03:00:07,631 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:00:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1406021221, now seen corresponding path program 42 times [2018-02-04 03:00:07,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:00:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:00:07,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:00:18,678 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 03:00:18,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:00:18,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:00:18,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:00:18,680 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 03:00:18,681 INFO L182 omatonBuilderFactory]: Interpolants [21344#true, 21345#false, 21346#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21347#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21348#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21349#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21350#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21351#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21352#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21353#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21354#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 21355#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21356#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21357#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21358#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21359#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21360#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21361#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21362#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21363#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21364#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21365#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21366#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 21367#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 21368#(not (= |foo_#in~size| 32))] [2018-02-04 03:00:18,692 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 03:00:18,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:00:18,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:00:18,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:00:18,692 INFO L87 Difference]: Start difference. First operand 395 states and 440 transitions. Second operand 25 states. [2018-02-04 03:00:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:00:18,801 INFO L93 Difference]: Finished difference Result 408 states and 453 transitions. [2018-02-04 03:00:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:00:18,801 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 3055 [2018-02-04 03:00:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:00:18,802 INFO L225 Difference]: With dead ends: 408 [2018-02-04 03:00:18,802 INFO L226 Difference]: Without dead ends: 405 [2018-02-04 03:00:18,802 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 03:00:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-04 03:00:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-02-04 03:00:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-04 03:00:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 446 transitions. [2018-02-04 03:00:18,806 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 446 transitions. Word has length 3055 [2018-02-04 03:00:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:00:18,806 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 446 transitions. [2018-02-04 03:00:18,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:00:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 446 transitions. [2018-02-04 03:00:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3188 [2018-02-04 03:00:18,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:00:18,841 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 03:00:18,841 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:00:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1215606133, now seen corresponding path program 43 times [2018-02-04 03:00:18,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:00:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:00:18,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:00:29,129 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 03:00:29,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:00:29,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:00:29,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:00:29,130 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 03:00:29,130 INFO L182 omatonBuilderFactory]: Interpolants [22180#true, 22181#false, 22182#(= main_~i~1 0), 22183#(<= main_~i~1 1), 22184#(<= main_~i~1 2), 22185#(<= main_~i~1 3), 22186#(<= main_~i~1 4), 22187#(<= main_~i~1 5), 22188#(<= main_~i~1 6), 22189#(<= main_~i~1 7), 22190#(<= main_~i~1 8), 22191#(<= main_~i~1 9), 22192#(<= main_~i~1 10), 22193#(<= main_~i~1 11), 22194#(<= main_~i~1 12), 22195#(<= main_~i~1 13), 22196#(<= main_~i~1 14), 22197#(<= main_~i~1 15), 22198#(<= main_~i~1 16), 22199#(<= main_~i~1 17), 22200#(<= main_~i~1 18), 22201#(<= main_~i~1 19), 22202#(<= main_~i~1 20), 22203#(<= main_~i~1 21), 22204#(<= main_~i~1 22)] [2018-02-04 03:00:29,137 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 03:00:29,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:00:29,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:00:29,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:00:29,137 INFO L87 Difference]: Start difference. First operand 401 states and 446 transitions. Second operand 25 states. [2018-02-04 03:00:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:00:29,356 INFO L93 Difference]: Finished difference Result 534 states and 560 transitions. [2018-02-04 03:00:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:00:29,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 3187 [2018-02-04 03:00:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:00:29,358 INFO L225 Difference]: With dead ends: 534 [2018-02-04 03:00:29,358 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 03:00:29,358 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 03:00:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 03:00:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 412. [2018-02-04 03:00:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 03:00:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 459 transitions. [2018-02-04 03:00:29,362 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 459 transitions. Word has length 3187 [2018-02-04 03:00:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:00:29,363 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 459 transitions. [2018-02-04 03:00:29,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:00:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 459 transitions. [2018-02-04 03:00:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3332 [2018-02-04 03:00:29,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:00:29,401 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 03:00:29,401 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:00:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1457039484, now seen corresponding path program 44 times [2018-02-04 03:00:29,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:00:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:00:29,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:00:42,837 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 03:00:42,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:00:42,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:00:42,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:00:42,839 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 03:00:42,839 INFO L182 omatonBuilderFactory]: Interpolants [23168#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23169#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23170#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23171#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23172#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23173#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23174#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 23175#(and (or (<= foo_~i~0 22) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23176#(not (= |foo_#in~size| 32)), 23151#true, 23152#false, 23153#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23154#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23155#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23156#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23157#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23158#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23159#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23160#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23161#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 23162#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23163#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23164#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23165#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23166#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 23167#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 03:00:42,847 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 03:00:42,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:00:42,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:00:42,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:00:42,848 INFO L87 Difference]: Start difference. First operand 412 states and 459 transitions. Second operand 26 states. [2018-02-04 03:00:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:00:42,934 INFO L93 Difference]: Finished difference Result 425 states and 472 transitions. [2018-02-04 03:00:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:00:42,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 3331 [2018-02-04 03:00:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:00:42,936 INFO L225 Difference]: With dead ends: 425 [2018-02-04 03:00:42,936 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 03:00:42,936 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 03:00:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 03:00:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2018-02-04 03:00:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-04 03:00:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 465 transitions. [2018-02-04 03:00:42,940 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 465 transitions. Word has length 3331 [2018-02-04 03:00:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:00:42,940 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 465 transitions. [2018-02-04 03:00:42,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:00:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 465 transitions. [2018-02-04 03:00:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3470 [2018-02-04 03:00:42,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:00:42,981 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 03:00:42,981 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:00:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash 733030452, now seen corresponding path program 45 times [2018-02-04 03:00:42,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:00:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:00:43,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:00:55,530 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 03:00:55,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:00:55,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:00:55,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:00:55,531 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 03:00:55,531 INFO L182 omatonBuilderFactory]: Interpolants [24022#true, 24023#false, 24024#(= main_~i~1 0), 24025#(<= main_~i~1 1), 24026#(<= main_~i~1 2), 24027#(<= main_~i~1 3), 24028#(<= main_~i~1 4), 24029#(<= main_~i~1 5), 24030#(<= main_~i~1 6), 24031#(<= main_~i~1 7), 24032#(<= main_~i~1 8), 24033#(<= main_~i~1 9), 24034#(<= main_~i~1 10), 24035#(<= main_~i~1 11), 24036#(<= main_~i~1 12), 24037#(<= main_~i~1 13), 24038#(<= main_~i~1 14), 24039#(<= main_~i~1 15), 24040#(<= main_~i~1 16), 24041#(<= main_~i~1 17), 24042#(<= main_~i~1 18), 24043#(<= main_~i~1 19), 24044#(<= main_~i~1 20), 24045#(<= main_~i~1 21), 24046#(<= main_~i~1 22), 24047#(<= main_~i~1 23)] [2018-02-04 03:00:55,539 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 03:00:55,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:00:55,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:00:55,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:00:55,539 INFO L87 Difference]: Start difference. First operand 418 states and 465 transitions. Second operand 26 states. [2018-02-04 03:00:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:00:55,728 INFO L93 Difference]: Finished difference Result 556 states and 583 transitions. [2018-02-04 03:00:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:00:55,728 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 3469 [2018-02-04 03:00:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:00:55,730 INFO L225 Difference]: With dead ends: 556 [2018-02-04 03:00:55,730 INFO L226 Difference]: Without dead ends: 556 [2018-02-04 03:00:55,730 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 03:00:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-04 03:00:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 429. [2018-02-04 03:00:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 03:00:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 478 transitions. [2018-02-04 03:00:55,734 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 478 transitions. Word has length 3469 [2018-02-04 03:00:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:00:55,735 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 478 transitions. [2018-02-04 03:00:55,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:00:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 478 transitions. [2018-02-04 03:00:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3620 [2018-02-04 03:00:55,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:00:55,780 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 03:00:55,780 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:00:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 541578285, now seen corresponding path program 46 times [2018-02-04 03:00:55,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:00:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:00:55,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:01:12,319 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 03:01:12,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:01:12,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:01:12,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:01:12,320 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 03:01:12,321 INFO L182 omatonBuilderFactory]: Interpolants [25033#true, 25034#false, 25035#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25036#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25037#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25038#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25039#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25040#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25041#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25042#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25043#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 25044#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25045#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25046#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25047#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25048#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25049#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25050#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25051#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25052#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25053#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25054#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25055#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25056#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 25057#(and (or (<= foo_~i~0 22) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25058#(and (or (<= foo_~i~0 23) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 25059#(not (= |foo_#in~size| 32))] [2018-02-04 03:01:12,330 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 03:01:12,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:01:12,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:01:12,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:01:12,331 INFO L87 Difference]: Start difference. First operand 429 states and 478 transitions. Second operand 27 states. [2018-02-04 03:01:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:01:12,436 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-02-04 03:01:12,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:01:12,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 3619 [2018-02-04 03:01:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:01:12,437 INFO L225 Difference]: With dead ends: 442 [2018-02-04 03:01:12,437 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 03:01:12,437 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 03:01:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 03:01:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2018-02-04 03:01:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 03:01:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 484 transitions. [2018-02-04 03:01:12,441 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 484 transitions. Word has length 3619 [2018-02-04 03:01:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:01:12,441 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 484 transitions. [2018-02-04 03:01:12,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:01:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 484 transitions. [2018-02-04 03:01:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3764 [2018-02-04 03:01:12,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:01:12,488 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 03:01:12,488 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:01:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1465678829, now seen corresponding path program 47 times [2018-02-04 03:01:12,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:01:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:01:12,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:01:27,482 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 03:01:27,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:01:27,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:01:27,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:01:27,483 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 03:01:27,483 INFO L182 omatonBuilderFactory]: Interpolants [25939#true, 25940#false, 25941#(= main_~i~1 0), 25942#(<= main_~i~1 1), 25943#(<= main_~i~1 2), 25944#(<= main_~i~1 3), 25945#(<= main_~i~1 4), 25946#(<= main_~i~1 5), 25947#(<= main_~i~1 6), 25948#(<= main_~i~1 7), 25949#(<= main_~i~1 8), 25950#(<= main_~i~1 9), 25951#(<= main_~i~1 10), 25952#(<= main_~i~1 11), 25953#(<= main_~i~1 12), 25954#(<= main_~i~1 13), 25955#(<= main_~i~1 14), 25956#(<= main_~i~1 15), 25957#(<= main_~i~1 16), 25958#(<= main_~i~1 17), 25959#(<= main_~i~1 18), 25960#(<= main_~i~1 19), 25961#(<= main_~i~1 20), 25962#(<= main_~i~1 21), 25963#(<= main_~i~1 22), 25964#(<= main_~i~1 23), 25965#(<= main_~i~1 24)] [2018-02-04 03:01:27,492 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 03:01:27,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:01:27,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:01:27,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:01:27,493 INFO L87 Difference]: Start difference. First operand 435 states and 484 transitions. Second operand 27 states. [2018-02-04 03:01:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:01:27,760 INFO L93 Difference]: Finished difference Result 578 states and 606 transitions. [2018-02-04 03:01:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:01:27,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 3763 [2018-02-04 03:01:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:01:27,763 INFO L225 Difference]: With dead ends: 578 [2018-02-04 03:01:27,763 INFO L226 Difference]: Without dead ends: 578 [2018-02-04 03:01:27,763 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 03:01:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-04 03:01:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 446. [2018-02-04 03:01:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 03:01:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 497 transitions. [2018-02-04 03:01:27,768 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 497 transitions. Word has length 3763 [2018-02-04 03:01:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:01:27,769 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 497 transitions. [2018-02-04 03:01:27,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:01:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 497 transitions. [2018-02-04 03:01:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3920 [2018-02-04 03:01:27,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:01:27,818 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 03:01:27,818 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 03:01:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1670682002, now seen corresponding path program 48 times [2018-02-04 03:01:27,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:01:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:01:27,997 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 03:01:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1111850 backedges. 98 proven. 87072 refuted. 0 times theorem prover too weak. 1024680 trivial. 0 not checked. [2018-02-04 03:01:46,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:01:46,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:01:46,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:01:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 45000 backedges. 0 proven. 3576 refuted. 0 times theorem prover too weak. 41424 trivial. 0 not checked. [2018-02-04 03:01:46,820 INFO L182 omatonBuilderFactory]: Interpolants [27008#(and (or (not (= foo_~size 32)) (<= foo_~i~0 16)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27009#(and (or (<= foo_~i~0 17) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27010#(and (or (<= foo_~i~0 18) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27011#(and (or (<= foo_~i~0 19) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27012#(and (or (not (= foo_~size 32)) (<= foo_~i~0 20)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27013#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (<= foo_~i~0 21) (not (= foo_~size 32)))), 27014#(and (or (<= foo_~i~0 22) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27015#(and (or (<= foo_~i~0 23) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27016#(and (or (<= foo_~i~0 24) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27017#(not (= |foo_#in~size| 32)), 26990#true, 26991#false, 26992#(and (= foo_~i~0 0) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26993#(and (or (<= foo_~i~0 1) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26994#(and (or (<= foo_~i~0 2) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26995#(and (or (<= foo_~i~0 3) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26996#(and (or (<= foo_~i~0 4) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26997#(and (or (not (= foo_~size 32)) (<= foo_~i~0 5)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26998#(and (or (<= foo_~i~0 6) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 26999#(and (or (<= foo_~i~0 7) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27000#(and (or (= |foo_#in~size| foo_~size) (= foo_~size 32)) (or (not (= foo_~size 32)) (<= foo_~i~0 8))), 27001#(and (or (<= foo_~i~0 9) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27002#(and (or (<= foo_~i~0 10) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27003#(and (or (<= foo_~i~0 11) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27004#(and (or (<= foo_~i~0 12) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27005#(and (or (not (= foo_~size 32)) (<= foo_~i~0 13)) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27006#(and (or (<= foo_~i~0 14) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32))), 27007#(and (or (<= foo_~i~0 15) (not (= foo_~size 32))) (or (= |foo_#in~size| foo_~size) (= foo_~size 32)))] [2018-02-04 03:01:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1111850 backedges. 98 proven. 87072 refuted. 0 times theorem prover too weak. 1024680 trivial. 0 not checked. [2018-02-04 03:01:46,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:01:46,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:01:46,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:01:46,832 INFO L87 Difference]: Start difference. First operand 446 states and 497 transitions. Second operand 28 states. [2018-02-04 03:01:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 03:01:46,832 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 03:01:46,836 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 03:01:46,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:01:46 BoogieIcfgContainer [2018-02-04 03:01:46,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:01:46,837 INFO L168 Benchmark]: Toolchain (without parser) took 194138.58 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 357.0 MB in the beginning and 860.8 MB in the end (delta: -503.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 03:01:46,837 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:01:46,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.67 ms. Allocated memory is still 399.0 MB. Free memory was 357.0 MB in the beginning and 349.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:01:46,838 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 ms. Allocated memory is still 399.0 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:01:46,838 INFO L168 Benchmark]: RCFGBuilder took 177.69 ms. Allocated memory is still 399.0 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:01:46,838 INFO L168 Benchmark]: TraceAbstraction took 193812.85 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 329.2 MB in the beginning and 860.8 MB in the end (delta: -531.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 03:01:46,839 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 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 123.67 ms. Allocated memory is still 399.0 MB. Free memory was 357.0 MB in the beginning and 349.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.96 ms. Allocated memory is still 399.0 MB. Free memory was 349.1 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.69 ms. Allocated memory is still 399.0 MB. Free memory was 346.4 MB in the beginning and 329.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 193812.85 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 329.2 MB in the beginning and 860.8 MB in the end (delta: -531.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (446states) and interpolant automaton (currently 2 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 193.7s OverallTime, 55 OverallIterations, 625 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2133 SDtfs, 6075 SDslu, 15727 SDs, 0 SdLazy, 8895 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 7.1s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 10952875/11542776 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 1925 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 144.8s InterpolantComputationTime, 69137 NumberOfCodeBlocks, 69137 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 69082 ConstructedInterpolants, 0 QuantifiedInterpolants, 229994918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 6 PerfectInterpolantSequences, 10952875/11542776 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-01-46-844.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-01-46-844.csv Completed graceful shutdown