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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:42:13,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:42:13,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:42:13,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:42:13,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:42:13,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:42:13,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:42:13,999 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:42:14,000 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:42:14,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:42:14,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:42:14,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:42:14,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:42:14,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:42:14,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:42:14,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:42:14,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:42:14,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:42:14,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:42:14,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:42:14,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:42:14,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:42:14,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:42:14,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:42:14,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:42:14,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:42:14,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:42:14,017 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:42:14,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:42:14,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:42:14,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:42:14,018 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:42:14,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:42:14,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:42:14,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:42:14,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:42:14,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:42:14,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:42:14,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:42:14,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:42:14,032 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:42:14,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:42:14,069 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:42:14,072 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:42:14,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:42:14,073 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:42:14,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-02 10:42:14,158 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:42:14,159 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:42:14,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:42:14,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:42:14,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:42:14,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53250993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14, skipping insertion in model container [2018-02-02 10:42:14,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,184 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:42:14,198 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:42:14,313 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:42:14,326 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:42:14,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14 WrapperNode [2018-02-02 10:42:14,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:42:14,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:42:14,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:42:14,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:42:14,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... [2018-02-02 10:42:14,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:42:14,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:42:14,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:42:14,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:42:14,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:42:14,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:42:14,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:42:14,395 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 10:42:14,395 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:42:14,395 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:42:14,395 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:42:14,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:42:14,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:42:14,395 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:42:14,396 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 10:42:14,396 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:42:14,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:42:14,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:42:14,535 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:42:14,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:14 BoogieIcfgContainer [2018-02-02 10:42:14,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:42:14,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:42:14,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:42:14,538 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:42:14,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:42:14" (1/3) ... [2018-02-02 10:42:14,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225869a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:14, skipping insertion in model container [2018-02-02 10:42:14,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:42:14" (2/3) ... [2018-02-02 10:42:14,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225869a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:42:14, skipping insertion in model container [2018-02-02 10:42:14,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:42:14" (3/3) ... [2018-02-02 10:42:14,541 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-02 10:42:14,548 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:42:14,553 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 10:42:14,587 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:42:14,587 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:42:14,587 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:42:14,587 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:42:14,588 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:42:14,588 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:42:14,588 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:42:14,588 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:42:14,588 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:42:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:42:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:42:14,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:14,606 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:14,606 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 10:42:14,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:14,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:14,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:42:14,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,755 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-02 10:42:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:42:14,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:42:14,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:42:14,767 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:42:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:14,812 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:42:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:42:14,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 10:42:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:14,820 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:42:14,820 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:42:14,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:42:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:42:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 10:42:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:42:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 10:42:14,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 10:42:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:14,905 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 10:42:14,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:42:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 10:42:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:42:14,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:14,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:14,906 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 10:42:14,908 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:14,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:14,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:42:14,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,997 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= 0 main_~i~1), 167#(= 0 |foo_#in~size|), 168#(and (= foo_~size 0) (= foo_~i~0 0))] [2018-02-02 10:42:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:14,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:42:14,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:42:14,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:15,000 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-02-02 10:42:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,137 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-02 10:42:15,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:42:15,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 10:42:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,138 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:42:15,139 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:42:15,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:42:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:42:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-02 10:42:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:42:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 10:42:15,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-02-02 10:42:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,145 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 10:42:15,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:42:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 10:42:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:42:15,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,146 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-02 10:42:15,146 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 10:42:15,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,195 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-02 10:42:15,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:15,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:42:15,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,196 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(<= 0 main_~i~1), 295#(<= 1 main_~i~1), 296#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-02 10:42:15,196 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-02 10:42:15,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:42:15,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:42:15,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:15,197 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-02-02 10:42:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,257 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-02 10:42:15,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:42:15,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:42:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,258 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:42:15,258 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:42:15,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:42:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-02-02 10:42:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:42:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-02 10:42:15,263 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-02-02 10:42:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,264 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-02 10:42:15,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:42:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-02 10:42:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:42:15,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,265 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:15,265 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-02-02 10:42:15,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:42:15,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:15,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:42:15,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,304 INFO L182 omatonBuilderFactory]: Interpolants [416#false, 417#(= foo_~i~0 0), 415#true] [2018-02-02 10:42:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:42:15,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:42:15,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:42:15,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:42:15,305 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-02-02 10:42:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,330 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-02 10:42:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:42:15,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 10:42:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,333 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:42:15,333 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 10:42:15,334 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-02 10:42:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 10:42:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-02-02 10:42:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:42:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-02 10:42:15,337 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-02-02 10:42:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,338 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-02 10:42:15,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:42:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-02 10:42:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:42:15,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,338 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:15,338 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-02-02 10:42:15,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:42:15,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:15,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:42:15,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,443 INFO L182 omatonBuilderFactory]: Interpolants [544#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31)), 538#true, 539#false, 540#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 541#(and (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset)), 542#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 543#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0))] [2018-02-02 10:42:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:42:15,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:42:15,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:42:15,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:42:15,444 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2018-02-02 10:42:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,525 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-02 10:42:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:42:15,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 10:42:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,527 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:42:15,527 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:42:15,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:42:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-02-02 10:42:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:42:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-02 10:42:15,530 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 29 [2018-02-02 10:42:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,530 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-02 10:42:15,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:42:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-02 10:42:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:42:15,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,531 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:15,531 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-02-02 10:42:15,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:42:15,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:15,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:42:15,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,575 INFO L182 omatonBuilderFactory]: Interpolants [666#true, 667#false, 668#(= 1 (select |#valid| |main_~#mask~0.base|)), 669#(= 1 (select |#valid| main_~c~0.base)), 670#(= 1 (select |#valid| |foo_#in~b.base|)), 671#(= 1 (select |#valid| foo_~b.base))] [2018-02-02 10:42:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:42:15,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:42:15,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:42:15,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:42:15,577 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-02 10:42:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,615 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 10:42:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:42:15,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 10:42:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,616 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:42:15,616 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:42:15,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 10:42:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:42:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 10:42:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:42:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-02 10:42:15,619 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-02-02 10:42:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,619 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-02 10:42:15,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:42:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-02 10:42:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:42:15,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,619 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-02 10:42:15,620 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 10:42:15,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:15,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:42:15,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,677 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(= main_~i~1 0), 788#(= foo_~i~0 0), 789#(= |foo_#res| 0), 790#(and (= |main_#t~ret3| 0) (= main_~i~1 0)), 791#(= (select main_~b~0 0) 0), 792#(= main_~i~1 (select main_~b~0 main_~i~1))] [2018-02-02 10:42:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:15,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:15,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:15,678 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-02-02 10:42:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,779 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:42:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:42:15,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 10:42:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,780 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:42:15,780 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:42:15,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:42:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-02-02 10:42:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:42:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 10:42:15,784 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 31 [2018-02-02 10:42:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,784 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 10:42:15,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 10:42:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:42:15,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,786 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:15,786 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-02 10:42:15,787 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:15,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:42:15,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,848 INFO L182 omatonBuilderFactory]: Interpolants [944#(= main_~i~1 0), 945#(<= main_~i~1 1), 946#(<= |foo_#in~size| 1), 947#(<= foo_~size 1), 948#(<= foo_~size (+ foo_~i~0 1)), 949#(<= foo_~size foo_~i~0), 942#true, 943#false] [2018-02-02 10:42:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:15,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:15,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:15,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:15,849 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2018-02-02 10:42:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:15,972 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-02-02 10:42:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:42:15,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 10:42:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:15,974 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:42:15,974 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:42:15,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:42:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-02 10:42:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:42:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:42:15,985 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-02 10:42:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:15,985 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:42:15,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:42:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:42:15,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:15,987 INFO L351 BasicCegarLoop]: trace histogram [3, 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-02 10:42:15,987 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-02-02 10:42:15,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:15,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:42:16,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:16,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:42:16,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:16,054 INFO L182 omatonBuilderFactory]: Interpolants [1125#true, 1126#false, 1127#(= main_~i~1 0), 1128#(<= main_~i~1 1), 1129#(<= main_~i~1 2)] [2018-02-02 10:42:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:42:16,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:42:16,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:42:16,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:42:16,055 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 5 states. [2018-02-02 10:42:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:16,213 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-02-02 10:42:16,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:42:16,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 10:42:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:16,215 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:42:16,215 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:42:16,216 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-02 10:42:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:42:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-02-02 10:42:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 10:42:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-02-02 10:42:16,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 43 [2018-02-02 10:42:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:16,221 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-02-02 10:42:16,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:42:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-02-02 10:42:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:42:16,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:16,223 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:16,223 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 763161719, now seen corresponding path program 2 times [2018-02-02 10:42:16,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:16,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:42:16,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:42:16,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:42:16,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:16,270 INFO L182 omatonBuilderFactory]: Interpolants [1328#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1329#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~i~0)), 1330#(<= |foo_#in~size| 0), 1324#true, 1325#false, 1326#(<= 0 main_~i~1), 1327#(<= 1 main_~i~1)] [2018-02-02 10:42:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:42:16,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:42:16,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:42:16,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:42:16,271 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 7 states. [2018-02-02 10:42:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:16,343 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-02-02 10:42:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:42:16,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-02 10:42:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:16,344 INFO L225 Difference]: With dead ends: 100 [2018-02-02 10:42:16,344 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:42:16,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:42:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-02-02 10:42:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 10:42:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-02 10:42:16,347 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 46 [2018-02-02 10:42:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:16,347 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-02 10:42:16,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:42:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-02 10:42:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:42:16,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:16,348 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:42:16,348 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 3 times [2018-02-02 10:42:16,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:16,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:42:16,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:16,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:42:16,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:16,420 INFO L182 omatonBuilderFactory]: Interpolants [1520#false, 1521#(<= main_~i~1 31), 1522#(<= |foo_#in~size| 31), 1523#(<= foo_~size 31), 1524#(and (<= 0 foo_~i~0) (<= foo_~size 31)), 1525#(and (<= 1 foo_~i~0) (<= foo_~size 31)), 1526#(and (<= 1 foo_~i~0) (<= foo_~i~0 30)), 1519#true] [2018-02-02 10:42:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 10:42:16,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:16,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:16,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:16,421 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-02-02 10:42:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:16,487 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-02 10:42:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:42:16,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-02 10:42:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:16,489 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:42:16,489 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:42:16,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:42:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-02-02 10:42:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:42:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-02-02 10:42:16,493 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2018-02-02 10:42:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:16,493 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-02-02 10:42:16,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-02-02 10:42:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:42:16,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:16,495 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02 10:42:16,495 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1970492696, now seen corresponding path program 1 times [2018-02-02 10:42:16,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:16,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:42:16,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:16,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:42:16,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:42:16,548 INFO L182 omatonBuilderFactory]: Interpolants [1712#(<= main_~i~1 3), 1707#true, 1708#false, 1709#(= main_~i~1 0), 1710#(<= main_~i~1 1), 1711#(<= main_~i~1 2)] [2018-02-02 10:42:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:42:16,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:42:16,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:42:16,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:42:16,549 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-02-02 10:42:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:16,612 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-02-02 10:42:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:42:16,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-02-02 10:42:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:16,613 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:42:16,613 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:42:16,614 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-02 10:42:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:42:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-02-02 10:42:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:42:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-02-02 10:42:16,618 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 67 [2018-02-02 10:42:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:16,618 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-02-02 10:42:16,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:42:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-02-02 10:42:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:42:16,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:16,620 INFO L351 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-02 10:42:16,620 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-02-02 10:42:16,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:16,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-02 10:42:16,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:16,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:42:16,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:42:16,690 INFO L182 omatonBuilderFactory]: Interpolants [1936#(<= main_~i~1 4), 1930#true, 1931#false, 1932#(= main_~i~1 0), 1933#(<= main_~i~1 1), 1934#(<= main_~i~1 2), 1935#(<= main_~i~1 3)] [2018-02-02 10:42:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-02 10:42:16,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:42:16,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:42:16,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:42:16,691 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 7 states. [2018-02-02 10:42:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:16,749 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 10:42:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:42:16,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-02-02 10:42:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:16,751 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:42:16,751 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:42:16,751 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-02 10:42:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:42:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-02-02 10:42:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:42:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-02-02 10:42:16,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 85 [2018-02-02 10:42:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:16,756 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-02-02 10:42:16,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:42:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-02-02 10:42:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 10:42:16,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:16,757 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-02 10:42:16,757 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -825580742, now seen corresponding path program 3 times [2018-02-02 10:42:16,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:16,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:42:16,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:16,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:42:16,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:42:16,966 INFO L182 omatonBuilderFactory]: Interpolants [2181#true, 2182#false, 2183#(= main_~i~1 0), 2184#(<= main_~i~1 1), 2185#(<= main_~i~1 2), 2186#(<= main_~i~1 3), 2187#(<= main_~i~1 4), 2188#(<= main_~i~1 5)] [2018-02-02 10:42:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:42:16,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:16,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:16,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:16,967 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2018-02-02 10:42:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:17,080 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-02-02 10:42:17,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:42:17,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-02-02 10:42:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:17,082 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:42:17,082 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:42:17,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:42:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-02-02 10:42:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:42:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-02 10:42:17,090 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 103 [2018-02-02 10:42:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:17,090 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-02 10:42:17,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-02 10:42:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 10:42:17,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:17,092 INFO L351 BasicCegarLoop]: trace histogram [11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-02 10:42:17,092 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash 797540099, now seen corresponding path program 4 times [2018-02-02 10:42:17,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:17,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-02-02 10:42:17,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:17,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:42:17,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 10:42:17,179 INFO L182 omatonBuilderFactory]: Interpolants [2464#(<= |foo_#in~size| 1), 2465#(<= main_~i~1 1), 2466#(<= main_~i~1 2), 2460#true, 2461#false, 2462#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:42:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-02-02 10:42:17,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:42:17,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:42:17,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:42:17,180 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 7 states. [2018-02-02 10:42:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:17,286 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-02-02 10:42:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:42:17,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-02-02 10:42:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:17,289 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:42:17,289 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:42:17,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:42:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:42:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2018-02-02 10:42:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:42:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-02 10:42:17,295 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 121 [2018-02-02 10:42:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:17,296 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-02 10:42:17,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:42:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-02 10:42:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 10:42:17,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:17,297 INFO L351 BasicCegarLoop]: trace histogram [12, 7, 6, 6, 6, 6, 6, 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-02 10:42:17,298 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1854228341, now seen corresponding path program 5 times [2018-02-02 10:42:17,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:17,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-02-02 10:42:17,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:17,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:42:17,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-02-02 10:42:17,396 INFO L182 omatonBuilderFactory]: Interpolants [2768#(<= 1 main_~i~1), 2769#(<= 2 main_~i~1), 2770#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2771#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2772#(<= |foo_#in~size| 1), 2765#true, 2766#false, 2767#(<= 0 main_~i~1)] [2018-02-02 10:42:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-02-02 10:42:17,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:17,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:17,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:17,397 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 8 states. [2018-02-02 10:42:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:17,487 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-02-02 10:42:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:42:17,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-02-02 10:42:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:17,488 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:42:17,488 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 10:42:17,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 10:42:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2018-02-02 10:42:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:42:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-02 10:42:17,490 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 127 [2018-02-02 10:42:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:17,491 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-02 10:42:17,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-02 10:42:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 10:42:17,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:17,492 INFO L351 BasicCegarLoop]: trace histogram [15, 9, 9, 9, 9, 9, 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-02 10:42:17,492 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:17,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1667069347, now seen corresponding path program 6 times [2018-02-02 10:42:17,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:17,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-02-02 10:42:17,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:17,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:42:17,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-02 10:42:17,616 INFO L182 omatonBuilderFactory]: Interpolants [3040#true, 3041#false, 3042#(= main_~i~1 0), 3043#(<= main_~i~1 1), 3044#(<= main_~i~1 2), 3045#(<= main_~i~1 3), 3046#(<= main_~i~1 4), 3047#(<= main_~i~1 5), 3048#(<= main_~i~1 6)] [2018-02-02 10:42:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-02-02 10:42:17,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:42:17,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:42:17,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:42:17,617 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 9 states. [2018-02-02 10:42:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:17,692 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-02-02 10:42:17,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:42:17,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-02-02 10:42:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:17,693 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:42:17,693 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:42:17,694 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-02 10:42:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:42:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2018-02-02 10:42:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:42:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-02-02 10:42:17,697 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 145 [2018-02-02 10:42:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:17,697 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-02-02 10:42:17,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:42:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-02-02 10:42:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 10:42:17,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:17,698 INFO L351 BasicCegarLoop]: trace histogram [18, 11, 11, 11, 11, 11, 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-02 10:42:17,698 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -418963468, now seen corresponding path program 7 times [2018-02-02 10:42:17,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:17,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-02-02 10:42:17,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:17,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:42:17,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 10:42:17,828 INFO L182 omatonBuilderFactory]: Interpolants [3360#false, 3361#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3362#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3363#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3364#(<= |foo_#in~size| 2), 3365#(<= main_~i~1 2), 3366#(<= main_~i~1 3), 3359#true] [2018-02-02 10:42:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-02-02 10:42:17,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:42:17,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:42:17,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:42:17,829 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 8 states. [2018-02-02 10:42:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:17,959 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-02-02 10:42:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:42:17,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2018-02-02 10:42:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:17,961 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:42:17,961 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:42:17,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:42:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2018-02-02 10:42:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:42:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-02-02 10:42:17,972 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 169 [2018-02-02 10:42:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:17,972 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-02-02 10:42:17,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:42:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-02-02 10:42:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-02 10:42:17,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:17,974 INFO L351 BasicCegarLoop]: trace histogram [19, 12, 12, 12, 12, 12, 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-02 10:42:17,974 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1459740484, now seen corresponding path program 8 times [2018-02-02 10:42:17,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:17,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-02-02 10:42:18,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:18,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:42:18,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-02 10:42:18,099 INFO L182 omatonBuilderFactory]: Interpolants [3712#(<= main_~i~1 1), 3713#(<= main_~i~1 2), 3714#(<= main_~i~1 3), 3715#(<= main_~i~1 4), 3716#(<= main_~i~1 5), 3717#(<= main_~i~1 6), 3718#(<= main_~i~1 7), 3709#true, 3710#false, 3711#(= main_~i~1 0)] [2018-02-02 10:42:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-02-02 10:42:18,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:42:18,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:42:18,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:18,100 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 10 states. [2018-02-02 10:42:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:18,184 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-02-02 10:42:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:42:18,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2018-02-02 10:42:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:18,185 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:42:18,185 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 10:42:18,186 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-02 10:42:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 10:42:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 154. [2018-02-02 10:42:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:42:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-02-02 10:42:18,196 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 175 [2018-02-02 10:42:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:18,196 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-02-02 10:42:18,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:42:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-02-02 10:42:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-02 10:42:18,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:18,198 INFO L351 BasicCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 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-02 10:42:18,198 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1367975757, now seen corresponding path program 9 times [2018-02-02 10:42:18,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:18,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-02-02 10:42:18,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:18,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:42:18,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 10:42:18,341 INFO L182 omatonBuilderFactory]: Interpolants [4084#true, 4085#false, 4086#(<= 0 main_~i~1), 4087#(<= 1 main_~i~1), 4088#(<= 2 main_~i~1), 4089#(<= 3 main_~i~1), 4090#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4092#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4093#(<= |foo_#in~size| 2)] [2018-02-02 10:42:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-02-02 10:42:18,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:42:18,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:42:18,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:18,342 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 10 states. [2018-02-02 10:42:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:18,491 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2018-02-02 10:42:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:42:18,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-02-02 10:42:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:18,493 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:42:18,493 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:42:18,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:42:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2018-02-02 10:42:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:42:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-02-02 10:42:18,497 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 199 [2018-02-02 10:42:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:18,498 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-02-02 10:42:18,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:42:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-02-02 10:42:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-02 10:42:18,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:18,500 INFO L351 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 18, 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-02 10:42:18,500 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash 354968301, now seen corresponding path program 10 times [2018-02-02 10:42:18,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:18,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-02-02 10:42:18,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:18,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:42:18,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-02-02 10:42:18,683 INFO L182 omatonBuilderFactory]: Interpolants [4432#(<= main_~i~1 3), 4433#(<= main_~i~1 4), 4434#(<= main_~i~1 5), 4435#(<= main_~i~1 6), 4436#(<= main_~i~1 7), 4437#(<= main_~i~1 8), 4427#true, 4428#false, 4429#(= main_~i~1 0), 4430#(<= main_~i~1 1), 4431#(<= main_~i~1 2)] [2018-02-02 10:42:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-02-02 10:42:18,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:42:18,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:42:18,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:18,685 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 11 states. [2018-02-02 10:42:18,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:18,821 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-02-02 10:42:18,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:42:18,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-02-02 10:42:18,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:18,823 INFO L225 Difference]: With dead ends: 217 [2018-02-02 10:42:18,823 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:42:18,823 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-02 10:42:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:42:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 165. [2018-02-02 10:42:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:42:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2018-02-02 10:42:18,828 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 223 [2018-02-02 10:42:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:18,829 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2018-02-02 10:42:18,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:42:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-02-02 10:42:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-02 10:42:18,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:18,830 INFO L351 BasicCegarLoop]: trace histogram [30, 21, 21, 21, 21, 21, 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-02 10:42:18,830 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 704000134, now seen corresponding path program 11 times [2018-02-02 10:42:18,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:18,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-02 10:42:19,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:19,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:42:19,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:42:19,003 INFO L182 omatonBuilderFactory]: Interpolants [4820#true, 4821#false, 4822#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4823#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4824#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4825#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4826#(<= |foo_#in~size| 3), 4827#(<= main_~i~1 3), 4828#(<= main_~i~1 4)] [2018-02-02 10:42:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-02 10:42:19,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:42:19,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:42:19,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:42:19,004 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand 9 states. [2018-02-02 10:42:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:19,102 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-02 10:42:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:42:19,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 253 [2018-02-02 10:42:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:19,105 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:42:19,105 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:42:19,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:42:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 174. [2018-02-02 10:42:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:42:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2018-02-02 10:42:19,108 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 253 [2018-02-02 10:42:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:19,108 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2018-02-02 10:42:19,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:42:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2018-02-02 10:42:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-02 10:42:19,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:19,109 INFO L351 BasicCegarLoop]: trace histogram [31, 22, 22, 22, 22, 22, 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-02 10:42:19,109 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1269758926, now seen corresponding path program 12 times [2018-02-02 10:42:19,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:19,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-02 10:42:19,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:19,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:42:19,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-02-02 10:42:19,316 INFO L182 omatonBuilderFactory]: Interpolants [5251#true, 5252#false, 5253#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 5256#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 5258#(<= |foo_#in~size| 4), 5259#(<= main_~i~1 4), 5260#(<= main_~i~1 5)] [2018-02-02 10:42:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-02-02 10:42:19,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:42:19,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:42:19,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:19,317 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand 10 states. [2018-02-02 10:42:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:19,463 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2018-02-02 10:42:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:42:19,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-02-02 10:42:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:19,472 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:42:19,473 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:42:19,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:42:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2018-02-02 10:42:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:42:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-02-02 10:42:19,480 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 259 [2018-02-02 10:42:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:19,480 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-02-02 10:42:19,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:42:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-02-02 10:42:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-02 10:42:19,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:19,482 INFO L351 BasicCegarLoop]: trace histogram [32, 23, 23, 23, 23, 23, 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-02 10:42:19,482 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1255919338, now seen corresponding path program 13 times [2018-02-02 10:42:19,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:19,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-02-02 10:42:19,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:19,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:42:19,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-02-02 10:42:19,675 INFO L182 omatonBuilderFactory]: Interpolants [5700#true, 5701#false, 5702#(= main_~i~1 0), 5703#(<= main_~i~1 1), 5704#(<= main_~i~1 2), 5705#(<= main_~i~1 3), 5706#(<= main_~i~1 4), 5707#(<= main_~i~1 5), 5708#(<= main_~i~1 6), 5709#(<= main_~i~1 7), 5710#(<= main_~i~1 8), 5711#(<= main_~i~1 9)] [2018-02-02 10:42:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-02-02 10:42:19,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:42:19,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:42:19,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:42:19,676 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 12 states. [2018-02-02 10:42:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:19,814 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2018-02-02 10:42:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:42:19,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 265 [2018-02-02 10:42:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:19,815 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:42:19,816 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:42:19,816 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-02 10:42:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:42:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 191. [2018-02-02 10:42:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:42:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-02 10:42:19,821 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 265 [2018-02-02 10:42:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:19,822 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-02 10:42:19,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:42:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-02 10:42:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-02-02 10:42:19,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:19,823 INFO L351 BasicCegarLoop]: trace histogram [36, 26, 26, 26, 26, 26, 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-02 10:42:19,823 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash -478351505, now seen corresponding path program 14 times [2018-02-02 10:42:19,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:19,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-02 10:42:20,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:20,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:42:20,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 129 proven. 20 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-02 10:42:20,027 INFO L182 omatonBuilderFactory]: Interpolants [6161#true, 6162#false, 6163#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6164#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6165#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6166#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6167#(<= |foo_#in~size| 3), 6168#(<= main_~i~1 3), 6169#(<= main_~i~1 4), 6170#(<= main_~i~1 5)] [2018-02-02 10:42:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-02 10:42:20,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:42:20,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:42:20,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:42:20,029 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 10 states. [2018-02-02 10:42:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:20,206 INFO L93 Difference]: Finished difference Result 303 states and 375 transitions. [2018-02-02 10:42:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:42:20,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-02-02 10:42:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:20,208 INFO L225 Difference]: With dead ends: 303 [2018-02-02 10:42:20,208 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 10:42:20,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 10:42:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 194. [2018-02-02 10:42:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:42:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-02 10:42:20,216 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 295 [2018-02-02 10:42:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:20,217 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-02 10:42:20,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:42:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-02 10:42:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-02-02 10:42:20,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:20,219 INFO L351 BasicCegarLoop]: trace histogram [37, 27, 27, 27, 27, 27, 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-02 10:42:20,219 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1133567817, now seen corresponding path program 15 times [2018-02-02 10:42:20,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:20,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-02 10:42:20,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:20,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:42:20,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 114 proven. 26 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-02 10:42:20,410 INFO L182 omatonBuilderFactory]: Interpolants [6676#true, 6677#false, 6678#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6679#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6680#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6681#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6682#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6683#(<= |foo_#in~size| 4), 6684#(<= main_~i~1 4), 6685#(<= main_~i~1 5), 6686#(<= main_~i~1 6)] [2018-02-02 10:42:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-02-02 10:42:20,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:42:20,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:42:20,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:20,411 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 11 states. [2018-02-02 10:42:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:20,549 INFO L93 Difference]: Finished difference Result 307 states and 379 transitions. [2018-02-02 10:42:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:42:20,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 301 [2018-02-02 10:42:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:20,550 INFO L225 Difference]: With dead ends: 307 [2018-02-02 10:42:20,550 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 10:42:20,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 10:42:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 191. [2018-02-02 10:42:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:42:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-02 10:42:20,555 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 301 [2018-02-02 10:42:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:20,555 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-02 10:42:20,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:42:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-02 10:42:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-02 10:42:20,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:20,556 INFO L351 BasicCegarLoop]: trace histogram [38, 28, 28, 28, 28, 28, 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-02 10:42:20,556 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1980154881, now seen corresponding path program 16 times [2018-02-02 10:42:20,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:20,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-02-02 10:42:20,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:20,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:42:20,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-02 10:42:20,761 INFO L182 omatonBuilderFactory]: Interpolants [7200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 7202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 7203#(<= |foo_#in~size| 5), 7204#(<= main_~i~1 5), 7205#(<= main_~i~1 6), 7195#true, 7196#false, 7197#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 7198#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7199#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:42:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-02-02 10:42:20,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:42:20,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:42:20,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:42:20,762 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 11 states. [2018-02-02 10:42:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:20,893 INFO L93 Difference]: Finished difference Result 277 states and 347 transitions. [2018-02-02 10:42:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:42:20,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 307 [2018-02-02 10:42:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:20,894 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:42:20,894 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:42:20,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:42:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2018-02-02 10:42:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:42:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 237 transitions. [2018-02-02 10:42:20,898 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 237 transitions. Word has length 307 [2018-02-02 10:42:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:20,899 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 237 transitions. [2018-02-02 10:42:20,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:42:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 237 transitions. [2018-02-02 10:42:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-02 10:42:20,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:20,901 INFO L351 BasicCegarLoop]: trace histogram [39, 29, 29, 29, 29, 29, 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-02 10:42:20,901 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:20,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1120913543, now seen corresponding path program 17 times [2018-02-02 10:42:20,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:20,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-02-02 10:42:21,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:21,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:42:21,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 37 proven. 109 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-02 10:42:21,134 INFO L182 omatonBuilderFactory]: Interpolants [7696#false, 7697#(<= 0 main_~i~1), 7698#(<= 1 main_~i~1), 7699#(<= 2 main_~i~1), 7700#(<= 3 main_~i~1), 7701#(<= 4 main_~i~1), 7702#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 7703#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7704#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 7705#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7706#(<= |foo_#in~size| 3), 7695#true] [2018-02-02 10:42:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-02-02 10:42:21,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:42:21,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:42:21,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:42:21,136 INFO L87 Difference]: Start difference. First operand 200 states and 237 transitions. Second operand 12 states. [2018-02-02 10:42:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:21,421 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2018-02-02 10:42:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:42:21,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2018-02-02 10:42:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:21,450 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:42:21,451 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:42:21,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:42:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-02-02 10:42:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 10:42:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2018-02-02 10:42:21,456 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 313 [2018-02-02 10:42:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:21,456 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2018-02-02 10:42:21,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:42:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2018-02-02 10:42:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-02 10:42:21,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:21,459 INFO L351 BasicCegarLoop]: trace histogram [43, 33, 33, 33, 33, 33, 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-02 10:42:21,459 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1555650855, now seen corresponding path program 18 times [2018-02-02 10:42:21,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:21,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-02-02 10:42:21,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:21,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:42:21,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-02 10:42:21,690 INFO L182 omatonBuilderFactory]: Interpolants [8141#true, 8142#false, 8143#(= main_~i~1 0), 8144#(<= main_~i~1 1), 8145#(<= main_~i~1 2), 8146#(<= main_~i~1 3), 8147#(<= main_~i~1 4), 8148#(<= main_~i~1 5), 8149#(<= main_~i~1 6), 8150#(<= main_~i~1 7), 8151#(<= main_~i~1 8), 8152#(<= main_~i~1 9), 8153#(<= main_~i~1 10)] [2018-02-02 10:42:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-02-02 10:42:21,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:42:21,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:42:21,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:21,691 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand 13 states. [2018-02-02 10:42:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:21,814 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2018-02-02 10:42:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:42:21,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 337 [2018-02-02 10:42:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:21,816 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:42:21,816 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:42:21,816 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-02 10:42:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:42:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 214. [2018-02-02 10:42:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:42:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-02 10:42:21,820 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 337 [2018-02-02 10:42:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:21,821 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-02 10:42:21,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:42:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-02 10:42:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-02-02 10:42:21,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:21,822 INFO L351 BasicCegarLoop]: trace histogram [48, 37, 37, 37, 37, 37, 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-02 10:42:21,823 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1011854648, now seen corresponding path program 19 times [2018-02-02 10:42:21,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:21,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-02-02 10:42:22,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:22,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:42:22,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 150 proven. 52 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-02 10:42:22,110 INFO L182 omatonBuilderFactory]: Interpolants [8674#true, 8675#false, 8676#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8677#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8678#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8679#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8680#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8681#(<= |foo_#in~size| 4), 8682#(<= main_~i~1 4), 8683#(<= main_~i~1 5), 8684#(<= main_~i~1 6), 8685#(<= main_~i~1 7)] [2018-02-02 10:42:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-02-02 10:42:22,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:42:22,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:42:22,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:42:22,111 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-02 10:42:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:22,360 INFO L93 Difference]: Finished difference Result 370 states and 469 transitions. [2018-02-02 10:42:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:42:22,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 373 [2018-02-02 10:42:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:22,362 INFO L225 Difference]: With dead ends: 370 [2018-02-02 10:42:22,362 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 10:42:22,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 10:42:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 214. [2018-02-02 10:42:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:42:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-02 10:42:22,366 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 373 [2018-02-02 10:42:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:22,367 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-02 10:42:22,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:42:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-02 10:42:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-02-02 10:42:22,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:22,368 INFO L351 BasicCegarLoop]: trace histogram [49, 38, 38, 38, 38, 38, 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-02 10:42:22,368 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -339687920, now seen corresponding path program 20 times [2018-02-02 10:42:22,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:22,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-02-02 10:42:22,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:22,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:42:22,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 173 proven. 32 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-02 10:42:22,709 INFO L182 omatonBuilderFactory]: Interpolants [9280#true, 9281#false, 9282#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9283#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9284#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9285#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9286#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9287#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 9288#(<= |foo_#in~size| 5), 9289#(<= main_~i~1 5), 9290#(<= main_~i~1 6), 9291#(<= main_~i~1 7)] [2018-02-02 10:42:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-02-02 10:42:22,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:42:22,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:42:22,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:42:22,710 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-02 10:42:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:22,899 INFO L93 Difference]: Finished difference Result 341 states and 426 transitions. [2018-02-02 10:42:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:42:22,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 379 [2018-02-02 10:42:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:22,900 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:42:22,901 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:42:22,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:42:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 214. [2018-02-02 10:42:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:42:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-02-02 10:42:22,908 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 379 [2018-02-02 10:42:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:22,909 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-02-02 10:42:22,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:42:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-02-02 10:42:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-02 10:42:22,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:22,911 INFO L351 BasicCegarLoop]: trace histogram [50, 39, 39, 39, 39, 39, 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-02 10:42:22,911 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash 77081240, now seen corresponding path program 21 times [2018-02-02 10:42:22,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:22,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-02 10:42:23,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:23,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:42:23,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-02-02 10:42:23,240 INFO L182 omatonBuilderFactory]: Interpolants [9859#true, 9860#false, 9861#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 9867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 9868#(<= |foo_#in~size| 6), 9869#(<= main_~i~1 6), 9870#(<= main_~i~1 7)] [2018-02-02 10:42:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-02 10:42:23,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:42:23,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:42:23,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:42:23,241 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-02-02 10:42:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:23,460 INFO L93 Difference]: Finished difference Result 305 states and 387 transitions. [2018-02-02 10:42:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:42:23,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 385 [2018-02-02 10:42:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:23,462 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:42:23,462 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:42:23,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:42:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 223. [2018-02-02 10:42:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:42:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2018-02-02 10:42:23,470 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 385 [2018-02-02 10:42:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:23,470 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2018-02-02 10:42:23,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:42:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2018-02-02 10:42:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-02-02 10:42:23,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:23,472 INFO L351 BasicCegarLoop]: trace histogram [51, 40, 40, 40, 40, 40, 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-02 10:42:23,472 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2006818912, now seen corresponding path program 22 times [2018-02-02 10:42:23,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:23,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-02-02 10:42:23,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:23,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:23,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-02-02 10:42:23,854 INFO L182 omatonBuilderFactory]: Interpolants [10413#true, 10414#false, 10415#(= main_~i~1 0), 10416#(<= main_~i~1 1), 10417#(<= main_~i~1 2), 10418#(<= main_~i~1 3), 10419#(<= main_~i~1 4), 10420#(<= main_~i~1 5), 10421#(<= main_~i~1 6), 10422#(<= main_~i~1 7), 10423#(<= main_~i~1 8), 10424#(<= main_~i~1 9), 10425#(<= main_~i~1 10), 10426#(<= main_~i~1 11)] [2018-02-02 10:42:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-02-02 10:42:23,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:23,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:23,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:23,856 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand 14 states. [2018-02-02 10:42:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:23,951 INFO L93 Difference]: Finished difference Result 357 states and 434 transitions. [2018-02-02 10:42:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:42:23,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 391 [2018-02-02 10:42:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:23,953 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:42:23,953 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 10:42:23,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 10:42:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 234. [2018-02-02 10:42:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:42:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-02 10:42:23,962 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 391 [2018-02-02 10:42:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:23,962 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-02 10:42:23,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-02 10:42:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-02-02 10:42:23,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:23,965 INFO L351 BasicCegarLoop]: trace histogram [56, 44, 44, 44, 44, 44, 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-02 10:42:23,965 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:23,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1326020417, now seen corresponding path program 23 times [2018-02-02 10:42:23,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:23,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-02-02 10:42:24,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:24,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:42:24,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-02 10:42:24,337 INFO L182 omatonBuilderFactory]: Interpolants [11018#true, 11019#false, 11020#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11021#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11022#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11025#(<= |foo_#in~size| 4), 11026#(<= main_~i~1 4), 11027#(<= main_~i~1 5), 11028#(<= main_~i~1 6), 11029#(<= main_~i~1 7), 11030#(<= main_~i~1 8)] [2018-02-02 10:42:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-02-02 10:42:24,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:42:24,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:42:24,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:24,338 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-02 10:42:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:24,490 INFO L93 Difference]: Finished difference Result 437 states and 597 transitions. [2018-02-02 10:42:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:42:24,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 427 [2018-02-02 10:42:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:24,493 INFO L225 Difference]: With dead ends: 437 [2018-02-02 10:42:24,494 INFO L226 Difference]: Without dead ends: 437 [2018-02-02 10:42:24,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-02 10:42:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 234. [2018-02-02 10:42:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:42:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-02 10:42:24,504 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 427 [2018-02-02 10:42:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:24,504 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-02 10:42:24,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:42:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-02 10:42:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-02-02 10:42:24,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:24,507 INFO L351 BasicCegarLoop]: trace histogram [57, 45, 45, 45, 45, 45, 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-02 10:42:24,507 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1293788297, now seen corresponding path program 24 times [2018-02-02 10:42:24,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:24,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-02-02 10:42:24,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:24,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:42:24,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 173 proven. 64 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-02 10:42:24,789 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11715#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11716#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11717#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11718#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11719#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11720#(<= |foo_#in~size| 5), 11721#(<= main_~i~1 5), 11722#(<= main_~i~1 6), 11723#(<= main_~i~1 7), 11724#(<= main_~i~1 8)] [2018-02-02 10:42:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-02-02 10:42:24,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:42:24,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:42:24,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:24,790 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-02 10:42:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:24,958 INFO L93 Difference]: Finished difference Result 410 states and 555 transitions. [2018-02-02 10:42:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:42:24,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 433 [2018-02-02 10:42:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:24,960 INFO L225 Difference]: With dead ends: 410 [2018-02-02 10:42:24,960 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 10:42:24,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 10:42:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 234. [2018-02-02 10:42:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:42:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-02 10:42:24,965 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 433 [2018-02-02 10:42:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:24,965 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-02 10:42:24,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:42:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-02 10:42:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-02-02 10:42:24,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:24,967 INFO L351 BasicCegarLoop]: trace histogram [58, 46, 46, 46, 46, 46, 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-02 10:42:24,967 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash -456174831, now seen corresponding path program 25 times [2018-02-02 10:42:24,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:24,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-02-02 10:42:25,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:25,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:42:25,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 211 proven. 38 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-02 10:42:25,297 INFO L182 omatonBuilderFactory]: Interpolants [12384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 12385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 12386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 12387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 12388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 12389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 12390#(<= |foo_#in~size| 6), 12391#(<= main_~i~1 6), 12392#(<= main_~i~1 7), 12393#(<= main_~i~1 8), 12381#true, 12382#false, 12383#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:42:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-02-02 10:42:25,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:42:25,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:42:25,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:25,298 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-02 10:42:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:25,442 INFO L93 Difference]: Finished difference Result 375 states and 497 transitions. [2018-02-02 10:42:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:42:25,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2018-02-02 10:42:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:25,444 INFO L225 Difference]: With dead ends: 375 [2018-02-02 10:42:25,444 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 10:42:25,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 10:42:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 234. [2018-02-02 10:42:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:42:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-02-02 10:42:25,449 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 439 [2018-02-02 10:42:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:25,450 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-02-02 10:42:25,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:42:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-02-02 10:42:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-02-02 10:42:25,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:25,465 INFO L351 BasicCegarLoop]: trace histogram [59, 47, 47, 47, 47, 47, 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-02 10:42:25,465 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1762811175, now seen corresponding path program 26 times [2018-02-02 10:42:25,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:25,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-02-02 10:42:25,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:25,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:42:25,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-02 10:42:25,779 INFO L182 omatonBuilderFactory]: Interpolants [13024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13025#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 13026#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 13027#(<= |foo_#in~size| 7), 13028#(<= main_~i~1 7), 13029#(<= main_~i~1 8), 13017#true, 13018#false, 13019#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13020#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13021#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13022#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-02 10:42:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-02-02 10:42:25,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:42:25,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:42:25,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:42:25,780 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-02-02 10:42:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:25,915 INFO L93 Difference]: Finished difference Result 333 states and 443 transitions. [2018-02-02 10:42:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:42:25,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 445 [2018-02-02 10:42:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:25,917 INFO L225 Difference]: With dead ends: 333 [2018-02-02 10:42:25,917 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 10:42:25,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:42:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 10:42:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 243. [2018-02-02 10:42:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:42:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 309 transitions. [2018-02-02 10:42:25,924 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 309 transitions. Word has length 445 [2018-02-02 10:42:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:25,924 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 309 transitions. [2018-02-02 10:42:25,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:42:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 309 transitions. [2018-02-02 10:42:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-02-02 10:42:25,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:25,927 INFO L351 BasicCegarLoop]: trace histogram [60, 48, 48, 48, 48, 48, 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-02 10:42:25,927 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1871830047, now seen corresponding path program 27 times [2018-02-02 10:42:25,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:25,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-02-02 10:42:26,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:26,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:26,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 63 proven. 162 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2018-02-02 10:42:26,232 INFO L182 omatonBuilderFactory]: Interpolants [13632#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13633#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13634#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13635#(<= |foo_#in~size| 4), 13622#true, 13623#false, 13624#(<= 0 main_~i~1), 13625#(<= 1 main_~i~1), 13626#(<= 2 main_~i~1), 13627#(<= 3 main_~i~1), 13628#(<= 4 main_~i~1), 13629#(<= 5 main_~i~1), 13630#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-02 10:42:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-02-02 10:42:26,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:26,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:26,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:26,232 INFO L87 Difference]: Start difference. First operand 243 states and 309 transitions. Second operand 14 states. [2018-02-02 10:42:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:26,411 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2018-02-02 10:42:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:42:26,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 451 [2018-02-02 10:42:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:26,413 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:42:26,413 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:42:26,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:42:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-02-02 10:42:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:42:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 302 transitions. [2018-02-02 10:42:26,418 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 302 transitions. Word has length 451 [2018-02-02 10:42:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:26,418 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 302 transitions. [2018-02-02 10:42:26,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 302 transitions. [2018-02-02 10:42:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-02-02 10:42:26,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:26,422 INFO L351 BasicCegarLoop]: trace histogram [63, 51, 51, 51, 51, 51, 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-02 10:42:26,422 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -872769991, now seen corresponding path program 28 times [2018-02-02 10:42:26,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:26,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-02-02 10:42:26,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:26,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:26,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2018-02-02 10:42:26,793 INFO L182 omatonBuilderFactory]: Interpolants [14157#true, 14158#false, 14159#(= main_~i~1 0), 14160#(<= main_~i~1 1), 14161#(<= main_~i~1 2), 14162#(<= main_~i~1 3), 14163#(<= main_~i~1 4), 14164#(<= main_~i~1 5), 14165#(<= main_~i~1 6), 14166#(<= main_~i~1 7), 14167#(<= main_~i~1 8), 14168#(<= main_~i~1 9), 14169#(<= main_~i~1 10), 14170#(<= main_~i~1 11), 14171#(<= main_~i~1 12)] [2018-02-02 10:42:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-02-02 10:42:26,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:26,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:26,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:26,793 INFO L87 Difference]: Start difference. First operand 243 states and 302 transitions. Second operand 15 states. [2018-02-02 10:42:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:26,947 INFO L93 Difference]: Finished difference Result 382 states and 466 transitions. [2018-02-02 10:42:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:42:26,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 469 [2018-02-02 10:42:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:26,949 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:42:26,949 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:42:26,949 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-02 10:42:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:42:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 254. [2018-02-02 10:42:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:42:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-02 10:42:26,954 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 469 [2018-02-02 10:42:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:26,954 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-02 10:42:26,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-02 10:42:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-02-02 10:42:26,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:26,958 INFO L351 BasicCegarLoop]: trace histogram [69, 56, 56, 56, 56, 56, 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-02 10:42:26,958 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:26,958 INFO L82 PathProgramCache]: Analyzing trace with hash -677191454, now seen corresponding path program 29 times [2018-02-02 10:42:26,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:26,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-02-02 10:42:27,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:27,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:27,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 200 proven. 96 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-02 10:42:27,398 INFO L182 omatonBuilderFactory]: Interpolants [14816#(<= |foo_#in~size| 5), 14817#(<= main_~i~1 5), 14818#(<= main_~i~1 6), 14819#(<= main_~i~1 7), 14820#(<= main_~i~1 8), 14821#(<= main_~i~1 9), 14808#true, 14809#false, 14810#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14811#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14812#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14813#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-02 10:42:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-02-02 10:42:27,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:27,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:27,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:27,398 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-02 10:42:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:27,578 INFO L93 Difference]: Finished difference Result 483 states and 670 transitions. [2018-02-02 10:42:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:42:27,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 511 [2018-02-02 10:42:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:27,580 INFO L225 Difference]: With dead ends: 483 [2018-02-02 10:42:27,580 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 10:42:27,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 10:42:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 254. [2018-02-02 10:42:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:42:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-02 10:42:27,588 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 511 [2018-02-02 10:42:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:27,589 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-02 10:42:27,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-02 10:42:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-02-02 10:42:27,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:27,592 INFO L351 BasicCegarLoop]: trace histogram [70, 57, 57, 57, 57, 57, 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-02 10:42:27,592 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:27,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2088382826, now seen corresponding path program 30 times [2018-02-02 10:42:27,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:27,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-02-02 10:42:27,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:27,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:27,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 229 proven. 76 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-02 10:42:27,995 INFO L182 omatonBuilderFactory]: Interpolants [15584#(<= main_~i~1 9), 15571#true, 15572#false, 15573#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15578#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15579#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 15580#(<= |foo_#in~size| 6), 15581#(<= main_~i~1 6), 15582#(<= main_~i~1 7), 15583#(<= main_~i~1 8)] [2018-02-02 10:42:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-02-02 10:42:27,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:27,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:27,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:27,996 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-02 10:42:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:28,148 INFO L93 Difference]: Finished difference Result 450 states and 618 transitions. [2018-02-02 10:42:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:42:28,148 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 517 [2018-02-02 10:42:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:28,150 INFO L225 Difference]: With dead ends: 450 [2018-02-02 10:42:28,150 INFO L226 Difference]: Without dead ends: 450 [2018-02-02 10:42:28,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:42:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-02 10:42:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 254. [2018-02-02 10:42:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:42:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-02 10:42:28,155 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 517 [2018-02-02 10:42:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:28,156 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-02 10:42:28,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-02 10:42:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-02-02 10:42:28,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:28,158 INFO L351 BasicCegarLoop]: trace histogram [71, 58, 58, 58, 58, 58, 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-02 10:42:28,158 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1038597326, now seen corresponding path program 31 times [2018-02-02 10:42:28,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:28,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-02-02 10:42:28,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:28,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:28,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 273 proven. 44 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-02 10:42:28,570 INFO L182 omatonBuilderFactory]: Interpolants [16303#true, 16304#false, 16305#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 16306#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 16307#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 16308#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 16309#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 16310#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 16311#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 16312#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 16313#(<= |foo_#in~size| 7), 16314#(<= main_~i~1 7), 16315#(<= main_~i~1 8), 16316#(<= main_~i~1 9)] [2018-02-02 10:42:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-02-02 10:42:28,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:28,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:28,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:28,571 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-02 10:42:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:28,731 INFO L93 Difference]: Finished difference Result 409 states and 550 transitions. [2018-02-02 10:42:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:42:28,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 523 [2018-02-02 10:42:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:28,733 INFO L225 Difference]: With dead ends: 409 [2018-02-02 10:42:28,733 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 10:42:28,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:42:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 10:42:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 254. [2018-02-02 10:42:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:42:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-02-02 10:42:28,738 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 523 [2018-02-02 10:42:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:28,738 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-02-02 10:42:28,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-02-02 10:42:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-02-02 10:42:28,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:28,740 INFO L351 BasicCegarLoop]: trace histogram [72, 59, 59, 59, 59, 59, 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-02 10:42:28,740 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash 857384506, now seen corresponding path program 32 times [2018-02-02 10:42:28,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:28,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-02-02 10:42:29,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:29,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:42:29,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-02-02 10:42:29,134 INFO L182 omatonBuilderFactory]: Interpolants [16996#true, 16997#false, 16998#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 16999#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 17000#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17001#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17002#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17003#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17004#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17005#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 17006#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 17007#(<= |foo_#in~size| 8), 17008#(<= main_~i~1 8), 17009#(<= main_~i~1 9)] [2018-02-02 10:42:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-02-02 10:42:29,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:42:29,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:42:29,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:42:29,135 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-02-02 10:42:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:29,332 INFO L93 Difference]: Finished difference Result 361 states and 487 transitions. [2018-02-02 10:42:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:42:29,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 529 [2018-02-02 10:42:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:29,334 INFO L225 Difference]: With dead ends: 361 [2018-02-02 10:42:29,334 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 10:42:29,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:42:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 10:42:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 263. [2018-02-02 10:42:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:42:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2018-02-02 10:42:29,340 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 529 [2018-02-02 10:42:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:29,340 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2018-02-02 10:42:29,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:42:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2018-02-02 10:42:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-02-02 10:42:29,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:29,344 INFO L351 BasicCegarLoop]: trace histogram [73, 60, 60, 60, 60, 60, 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-02 10:42:29,344 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1422482050, now seen corresponding path program 33 times [2018-02-02 10:42:29,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:29,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-02-02 10:42:29,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:29,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:29,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2018-02-02 10:42:29,822 INFO L182 omatonBuilderFactory]: Interpolants [17664#(<= main_~i~1 10), 17665#(<= main_~i~1 11), 17666#(<= main_~i~1 12), 17667#(<= main_~i~1 13), 17652#true, 17653#false, 17654#(= main_~i~1 0), 17655#(<= main_~i~1 1), 17656#(<= main_~i~1 2), 17657#(<= main_~i~1 3), 17658#(<= main_~i~1 4), 17659#(<= main_~i~1 5), 17660#(<= main_~i~1 6), 17661#(<= main_~i~1 7), 17662#(<= main_~i~1 8), 17663#(<= main_~i~1 9)] [2018-02-02 10:42:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-02-02 10:42:29,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:29,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:29,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:29,823 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand 16 states. [2018-02-02 10:42:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:29,945 INFO L93 Difference]: Finished difference Result 439 states and 572 transitions. [2018-02-02 10:42:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:42:29,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 535 [2018-02-02 10:42:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:29,947 INFO L225 Difference]: With dead ends: 439 [2018-02-02 10:42:29,947 INFO L226 Difference]: Without dead ends: 439 [2018-02-02 10:42:29,947 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-02 10:42:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-02 10:42:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 274. [2018-02-02 10:42:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:42:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-02 10:42:29,951 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 535 [2018-02-02 10:42:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:29,952 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-02 10:42:29,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-02 10:42:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-02-02 10:42:29,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:29,954 INFO L351 BasicCegarLoop]: trace histogram [79, 65, 65, 65, 65, 65, 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-02 10:42:29,954 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash -688793877, now seen corresponding path program 34 times [2018-02-02 10:42:29,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:29,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-02-02 10:42:30,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:30,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:30,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 200 proven. 128 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:42:30,341 INFO L182 omatonBuilderFactory]: Interpolants [18381#true, 18382#false, 18383#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 18384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 18387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18389#(<= |foo_#in~size| 5), 18390#(<= main_~i~1 5), 18391#(<= main_~i~1 6), 18392#(<= main_~i~1 7), 18393#(<= main_~i~1 8), 18394#(<= main_~i~1 9), 18395#(<= main_~i~1 10)] [2018-02-02 10:42:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-02-02 10:42:30,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:30,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:30,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:30,342 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-02 10:42:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:30,542 INFO L93 Difference]: Finished difference Result 556 states and 830 transitions. [2018-02-02 10:42:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:42:30,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 577 [2018-02-02 10:42:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:30,545 INFO L225 Difference]: With dead ends: 556 [2018-02-02 10:42:30,545 INFO L226 Difference]: Without dead ends: 556 [2018-02-02 10:42:30,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:42:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-02 10:42:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 274. [2018-02-02 10:42:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:42:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-02 10:42:30,557 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 577 [2018-02-02 10:42:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:30,557 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-02 10:42:30,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-02 10:42:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-02-02 10:42:30,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:30,561 INFO L351 BasicCegarLoop]: trace histogram [80, 66, 66, 66, 66, 66, 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-02 10:42:30,561 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1619073677, now seen corresponding path program 35 times [2018-02-02 10:42:30,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:30,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-02-02 10:42:31,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:31,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:31,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 229 proven. 114 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:42:31,039 INFO L182 omatonBuilderFactory]: Interpolants [19238#true, 19239#false, 19240#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 19241#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 19242#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 19243#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 19244#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 19245#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 19246#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 19247#(<= |foo_#in~size| 6), 19248#(<= main_~i~1 6), 19249#(<= main_~i~1 7), 19250#(<= main_~i~1 8), 19251#(<= main_~i~1 9), 19252#(<= main_~i~1 10)] [2018-02-02 10:42:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-02-02 10:42:31,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:31,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:31,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:31,040 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-02 10:42:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:31,210 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2018-02-02 10:42:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:42:31,210 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 583 [2018-02-02 10:42:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:31,212 INFO L225 Difference]: With dead ends: 529 [2018-02-02 10:42:31,212 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 10:42:31,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:42:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 10:42:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 274. [2018-02-02 10:42:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:42:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-02 10:42:31,221 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 583 [2018-02-02 10:42:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:31,221 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-02 10:42:31,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-02 10:42:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-02-02 10:42:31,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:31,225 INFO L351 BasicCegarLoop]: trace histogram [81, 67, 67, 67, 67, 67, 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-02 10:42:31,226 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1912773317, now seen corresponding path program 36 times [2018-02-02 10:42:31,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:31,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-02-02 10:42:31,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:31,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:31,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 273 proven. 88 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:42:31,794 INFO L182 omatonBuilderFactory]: Interpolants [20070#true, 20071#false, 20072#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 20073#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 20074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 20075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 20076#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 20077#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 20078#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 20079#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 20080#(<= |foo_#in~size| 7), 20081#(<= main_~i~1 7), 20082#(<= main_~i~1 8), 20083#(<= main_~i~1 9), 20084#(<= main_~i~1 10)] [2018-02-02 10:42:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-02-02 10:42:31,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:31,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:31,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:31,794 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-02 10:42:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:32,001 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions. [2018-02-02 10:42:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:42:32,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 589 [2018-02-02 10:42:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:32,003 INFO L225 Difference]: With dead ends: 490 [2018-02-02 10:42:32,003 INFO L226 Difference]: Without dead ends: 490 [2018-02-02 10:42:32,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:42:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-02 10:42:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 274. [2018-02-02 10:42:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:42:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-02 10:42:32,012 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 589 [2018-02-02 10:42:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:32,012 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-02 10:42:32,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-02 10:42:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-02-02 10:42:32,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:32,015 INFO L351 BasicCegarLoop]: trace histogram [82, 68, 68, 68, 68, 68, 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-02 10:42:32,015 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1734796867, now seen corresponding path program 37 times [2018-02-02 10:42:32,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:32,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-02-02 10:42:32,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:32,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:32,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 323 proven. 50 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:42:32,523 INFO L182 omatonBuilderFactory]: Interpolants [20865#true, 20866#false, 20867#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 20868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 20869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 20870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 20871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 20872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 20873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 20874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 20875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 20876#(<= |foo_#in~size| 8), 20877#(<= main_~i~1 8), 20878#(<= main_~i~1 9), 20879#(<= main_~i~1 10)] [2018-02-02 10:42:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-02-02 10:42:32,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:32,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:32,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:32,524 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-02 10:42:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:32,699 INFO L93 Difference]: Finished difference Result 443 states and 630 transitions. [2018-02-02 10:42:32,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:42:32,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 595 [2018-02-02 10:42:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:32,701 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:42:32,701 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 10:42:32,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:42:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 10:42:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274. [2018-02-02 10:42:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:42:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-02-02 10:42:32,706 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 595 [2018-02-02 10:42:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:32,706 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-02-02 10:42:32,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-02-02 10:42:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-02-02 10:42:32,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:32,708 INFO L351 BasicCegarLoop]: trace histogram [83, 69, 69, 69, 69, 69, 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-02 10:42:32,708 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1057187979, now seen corresponding path program 38 times [2018-02-02 10:42:32,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:32,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-02-02 10:42:33,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:33,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:42:33,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-02 10:42:33,243 INFO L182 omatonBuilderFactory]: Interpolants [21615#true, 21616#false, 21617#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 21626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 21627#(<= |foo_#in~size| 9), 21628#(<= main_~i~1 9), 21629#(<= main_~i~1 10)] [2018-02-02 10:42:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-02-02 10:42:33,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:42:33,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:42:33,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:42:33,244 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-02-02 10:42:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:33,425 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2018-02-02 10:42:33,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:42:33,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 601 [2018-02-02 10:42:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:33,427 INFO L225 Difference]: With dead ends: 389 [2018-02-02 10:42:33,427 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 10:42:33,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:42:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 10:42:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 283. [2018-02-02 10:42:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 10:42:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 376 transitions. [2018-02-02 10:42:33,432 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 376 transitions. Word has length 601 [2018-02-02 10:42:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:33,432 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 376 transitions. [2018-02-02 10:42:33,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:42:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 376 transitions. [2018-02-02 10:42:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-02-02 10:42:33,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:33,435 INFO L351 BasicCegarLoop]: trace histogram [84, 70, 70, 70, 70, 70, 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-02 10:42:33,435 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 141646867, now seen corresponding path program 39 times [2018-02-02 10:42:33,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:33,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-02-02 10:42:33,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:33,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:33,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 95 proven. 230 refuted. 0 times theorem prover too weak. 1619 trivial. 0 not checked. [2018-02-02 10:42:33,922 INFO L182 omatonBuilderFactory]: Interpolants [22336#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 22337#(<= |foo_#in~size| 5), 22322#true, 22323#false, 22324#(<= 0 main_~i~1), 22325#(<= 1 main_~i~1), 22326#(<= 2 main_~i~1), 22327#(<= 3 main_~i~1), 22328#(<= 4 main_~i~1), 22329#(<= 5 main_~i~1), 22330#(<= 6 main_~i~1), 22331#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 22332#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 22333#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 22334#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 22335#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-02 10:42:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-02-02 10:42:33,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:33,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:33,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:33,923 INFO L87 Difference]: Start difference. First operand 283 states and 376 transitions. Second operand 16 states. [2018-02-02 10:42:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:34,096 INFO L93 Difference]: Finished difference Result 313 states and 392 transitions. [2018-02-02 10:42:34,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:42:34,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 607 [2018-02-02 10:42:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:34,098 INFO L225 Difference]: With dead ends: 313 [2018-02-02 10:42:34,098 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 10:42:34,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:42:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 10:42:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2018-02-02 10:42:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 10:42:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 368 transitions. [2018-02-02 10:42:34,101 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 368 transitions. Word has length 607 [2018-02-02 10:42:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:34,102 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 368 transitions. [2018-02-02 10:42:34,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 368 transitions. [2018-02-02 10:42:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-02-02 10:42:34,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:34,106 INFO L351 BasicCegarLoop]: trace histogram [87, 73, 73, 73, 73, 73, 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-02 10:42:34,106 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1552314325, now seen corresponding path program 40 times [2018-02-02 10:42:34,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:34,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-02-02 10:42:34,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:34,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:42:34,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2018-02-02 10:42:34,551 INFO L182 omatonBuilderFactory]: Interpolants [22946#true, 22947#false, 22948#(= main_~i~1 0), 22949#(<= main_~i~1 1), 22950#(<= main_~i~1 2), 22951#(<= main_~i~1 3), 22952#(<= main_~i~1 4), 22953#(<= main_~i~1 5), 22954#(<= main_~i~1 6), 22955#(<= main_~i~1 7), 22956#(<= main_~i~1 8), 22957#(<= main_~i~1 9), 22958#(<= main_~i~1 10), 22959#(<= main_~i~1 11), 22960#(<= main_~i~1 12), 22961#(<= main_~i~1 13), 22962#(<= main_~i~1 14)] [2018-02-02 10:42:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-02-02 10:42:34,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:42:34,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:42:34,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:34,552 INFO L87 Difference]: Start difference. First operand 283 states and 368 transitions. Second operand 17 states. [2018-02-02 10:42:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:34,701 INFO L93 Difference]: Finished difference Result 464 states and 606 transitions. [2018-02-02 10:42:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:42:34,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 625 [2018-02-02 10:42:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:34,704 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:42:34,704 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:42:34,704 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-02 10:42:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:42:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 294. [2018-02-02 10:42:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:42:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-02 10:42:34,711 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 625 [2018-02-02 10:42:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:34,711 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-02 10:42:34,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:42:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-02 10:42:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2018-02-02 10:42:34,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:34,716 INFO L351 BasicCegarLoop]: trace histogram [94, 79, 79, 79, 79, 79, 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-02 10:42:34,716 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash -971505124, now seen corresponding path program 41 times [2018-02-02 10:42:34,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:34,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-02-02 10:42:35,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:35,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:35,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 256 proven. 152 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-02 10:42:35,287 INFO L182 omatonBuilderFactory]: Interpolants [23721#true, 23722#false, 23723#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 23724#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 23725#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 23726#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 23727#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 23728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 23729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 23730#(<= |foo_#in~size| 6), 23731#(<= main_~i~1 6), 23732#(<= main_~i~1 7), 23733#(<= main_~i~1 8), 23734#(<= main_~i~1 9), 23735#(<= main_~i~1 10), 23736#(<= main_~i~1 11)] [2018-02-02 10:42:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-02-02 10:42:35,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:35,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:35,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:35,288 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-02 10:42:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:35,455 INFO L93 Difference]: Finished difference Result 608 states and 923 transitions. [2018-02-02 10:42:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:42:35,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 673 [2018-02-02 10:42:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:35,458 INFO L225 Difference]: With dead ends: 608 [2018-02-02 10:42:35,458 INFO L226 Difference]: Without dead ends: 608 [2018-02-02 10:42:35,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:42:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-02-02 10:42:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 294. [2018-02-02 10:42:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:42:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-02 10:42:35,467 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 673 [2018-02-02 10:42:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:35,468 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-02 10:42:35,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-02 10:42:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-02-02 10:42:35,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:35,473 INFO L351 BasicCegarLoop]: trace histogram [95, 80, 80, 80, 80, 80, 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-02 10:42:35,473 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2105112604, now seen corresponding path program 42 times [2018-02-02 10:42:35,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:35,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-02-02 10:42:35,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:35,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:35,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 291 proven. 132 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-02 10:42:35,959 INFO L182 omatonBuilderFactory]: Interpolants [24653#true, 24654#false, 24655#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 24656#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 24657#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 24658#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 24659#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 24660#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 24661#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 24662#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 24663#(<= |foo_#in~size| 7), 24664#(<= main_~i~1 7), 24665#(<= main_~i~1 8), 24666#(<= main_~i~1 9), 24667#(<= main_~i~1 10), 24668#(<= main_~i~1 11)] [2018-02-02 10:42:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-02-02 10:42:35,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:35,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:35,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:35,960 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-02 10:42:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:36,174 INFO L93 Difference]: Finished difference Result 575 states and 866 transitions. [2018-02-02 10:42:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:42:36,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 679 [2018-02-02 10:42:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:36,177 INFO L225 Difference]: With dead ends: 575 [2018-02-02 10:42:36,178 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 10:42:36,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:42:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 10:42:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 294. [2018-02-02 10:42:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:42:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-02 10:42:36,184 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 679 [2018-02-02 10:42:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:36,185 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-02 10:42:36,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-02 10:42:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-02-02 10:42:36,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:36,188 INFO L351 BasicCegarLoop]: trace histogram [96, 81, 81, 81, 81, 81, 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-02 10:42:36,188 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -887206164, now seen corresponding path program 43 times [2018-02-02 10:42:36,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:36,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-02-02 10:42:36,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:36,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:36,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 341 proven. 100 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-02 10:42:36,689 INFO L182 omatonBuilderFactory]: Interpolants [25568#(<= main_~i~1 10), 25569#(<= main_~i~1 11), 25554#true, 25555#false, 25556#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25557#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25558#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25559#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25560#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25561#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25562#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25563#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 25564#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 25565#(<= |foo_#in~size| 8), 25566#(<= main_~i~1 8), 25567#(<= main_~i~1 9)] [2018-02-02 10:42:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-02-02 10:42:36,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:36,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:36,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:36,689 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-02 10:42:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:36,887 INFO L93 Difference]: Finished difference Result 530 states and 787 transitions. [2018-02-02 10:42:36,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:42:36,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 685 [2018-02-02 10:42:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:36,889 INFO L225 Difference]: With dead ends: 530 [2018-02-02 10:42:36,889 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 10:42:36,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:42:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 10:42:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 294. [2018-02-02 10:42:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:42:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-02 10:42:36,894 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 685 [2018-02-02 10:42:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:36,894 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-02 10:42:36,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-02 10:42:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-02-02 10:42:36,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:36,897 INFO L351 BasicCegarLoop]: trace histogram [97, 82, 82, 82, 82, 82, 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-02 10:42:36,897 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1895344332, now seen corresponding path program 44 times [2018-02-02 10:42:36,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:36,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-02-02 10:42:37,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:37,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:37,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2517 backedges. 397 proven. 56 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-02 10:42:37,428 INFO L182 omatonBuilderFactory]: Interpolants [26412#true, 26413#false, 26414#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 26415#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 26416#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 26417#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 26418#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 26419#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 26420#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 26421#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 26422#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 26423#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 26424#(<= |foo_#in~size| 9), 26425#(<= main_~i~1 9), 26426#(<= main_~i~1 10), 26427#(<= main_~i~1 11)] [2018-02-02 10:42:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-02-02 10:42:37,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:37,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:37,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:37,429 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-02 10:42:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:37,619 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2018-02-02 10:42:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:42:37,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 691 [2018-02-02 10:42:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:37,621 INFO L225 Difference]: With dead ends: 477 [2018-02-02 10:42:37,621 INFO L226 Difference]: Without dead ends: 477 [2018-02-02 10:42:37,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:42:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-02-02 10:42:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 294. [2018-02-02 10:42:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:42:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-02-02 10:42:37,626 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 691 [2018-02-02 10:42:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:37,626 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-02-02 10:42:37,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-02-02 10:42:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2018-02-02 10:42:37,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:37,629 INFO L351 BasicCegarLoop]: trace histogram [98, 83, 83, 83, 83, 83, 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-02 10:42:37,629 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 80744636, now seen corresponding path program 45 times [2018-02-02 10:42:37,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:37,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-02-02 10:42:38,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:38,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:42:38,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-02-02 10:42:38,171 INFO L182 omatonBuilderFactory]: Interpolants [27232#(<= |foo_#in~size| 10), 27233#(<= main_~i~1 10), 27234#(<= main_~i~1 11), 27219#true, 27220#false, 27221#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 27222#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 27223#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 27224#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 27225#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 27226#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 27227#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 27228#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 27229#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 27230#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 27231#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10))] [2018-02-02 10:42:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-02-02 10:42:38,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:42:38,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:42:38,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:42:38,172 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-02-02 10:42:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:38,345 INFO L93 Difference]: Finished difference Result 417 states and 597 transitions. [2018-02-02 10:42:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:42:38,345 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 697 [2018-02-02 10:42:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:38,347 INFO L225 Difference]: With dead ends: 417 [2018-02-02 10:42:38,347 INFO L226 Difference]: Without dead ends: 417 [2018-02-02 10:42:38,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:42:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-02 10:42:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 303. [2018-02-02 10:42:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 10:42:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 407 transitions. [2018-02-02 10:42:38,352 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 407 transitions. Word has length 697 [2018-02-02 10:42:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:38,352 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 407 transitions. [2018-02-02 10:42:38,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:42:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 407 transitions. [2018-02-02 10:42:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2018-02-02 10:42:38,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:38,356 INFO L351 BasicCegarLoop]: trace histogram [99, 84, 84, 84, 84, 84, 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-02 10:42:38,356 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2083609476, now seen corresponding path program 46 times [2018-02-02 10:42:38,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:38,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-02-02 10:42:38,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:38,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:42:38,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-02-02 10:42:38,933 INFO L182 omatonBuilderFactory]: Interpolants [27977#true, 27978#false, 27979#(= main_~i~1 0), 27980#(<= main_~i~1 1), 27981#(<= main_~i~1 2), 27982#(<= main_~i~1 3), 27983#(<= main_~i~1 4), 27984#(<= main_~i~1 5), 27985#(<= main_~i~1 6), 27986#(<= main_~i~1 7), 27987#(<= main_~i~1 8), 27988#(<= main_~i~1 9), 27989#(<= main_~i~1 10), 27990#(<= main_~i~1 11), 27991#(<= main_~i~1 12), 27992#(<= main_~i~1 13), 27993#(<= main_~i~1 14), 27994#(<= main_~i~1 15)] [2018-02-02 10:42:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-02-02 10:42:38,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:42:38,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:42:38,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:38,933 INFO L87 Difference]: Start difference. First operand 303 states and 407 transitions. Second operand 18 states. [2018-02-02 10:42:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:39,097 INFO L93 Difference]: Finished difference Result 527 states and 737 transitions. [2018-02-02 10:42:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:42:39,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 703 [2018-02-02 10:42:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:39,100 INFO L225 Difference]: With dead ends: 527 [2018-02-02 10:42:39,100 INFO L226 Difference]: Without dead ends: 527 [2018-02-02 10:42:39,100 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-02 10:42:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-02 10:42:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 314. [2018-02-02 10:42:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 10:42:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 425 transitions. [2018-02-02 10:42:39,108 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 425 transitions. Word has length 703 [2018-02-02 10:42:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:39,109 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 425 transitions. [2018-02-02 10:42:39,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:42:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 425 transitions. [2018-02-02 10:42:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-02-02 10:42:39,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:39,115 INFO L351 BasicCegarLoop]: trace histogram [106, 90, 90, 90, 90, 90, 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-02 10:42:39,115 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1951724619, now seen corresponding path program 47 times [2018-02-02 10:42:39,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:39,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-02-02 10:42:39,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:39,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:42:39,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 133 proven. 313 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2018-02-02 10:42:39,767 INFO L182 omatonBuilderFactory]: Interpolants [28836#true, 28837#false, 28838#(<= 0 main_~i~1), 28839#(<= 1 main_~i~1), 28840#(<= 2 main_~i~1), 28841#(<= 3 main_~i~1), 28842#(<= 4 main_~i~1), 28843#(<= 5 main_~i~1), 28844#(<= 6 main_~i~1), 28845#(<= 7 main_~i~1), 28846#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 28847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 28848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 28849#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 28850#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 28851#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 28852#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 28853#(<= |foo_#in~size| 6)] [2018-02-02 10:42:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-02-02 10:42:39,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:42:39,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:42:39,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:39,768 INFO L87 Difference]: Start difference. First operand 314 states and 425 transitions. Second operand 18 states. [2018-02-02 10:42:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:40,075 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2018-02-02 10:42:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:42:40,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 751 [2018-02-02 10:42:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:40,077 INFO L225 Difference]: With dead ends: 349 [2018-02-02 10:42:40,077 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:42:40,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:42:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:42:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2018-02-02 10:42:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 10:42:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 416 transitions. [2018-02-02 10:42:40,081 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 416 transitions. Word has length 751 [2018-02-02 10:42:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:40,082 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 416 transitions. [2018-02-02 10:42:40,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:42:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 416 transitions. [2018-02-02 10:42:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-02-02 10:42:40,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:40,085 INFO L351 BasicCegarLoop]: trace histogram [110, 94, 94, 94, 94, 94, 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-02 10:42:40,085 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -234595499, now seen corresponding path program 48 times [2018-02-02 10:42:40,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:40,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-02-02 10:42:40,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:40,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:42:40,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-02-02 10:42:40,742 INFO L182 omatonBuilderFactory]: Interpolants [29536#(<= main_~i~1 3), 29537#(<= main_~i~1 4), 29538#(<= main_~i~1 5), 29539#(<= main_~i~1 6), 29540#(<= main_~i~1 7), 29541#(<= main_~i~1 8), 29542#(<= main_~i~1 9), 29543#(<= main_~i~1 10), 29544#(<= main_~i~1 11), 29545#(<= main_~i~1 12), 29546#(<= main_~i~1 13), 29547#(<= main_~i~1 14), 29548#(<= main_~i~1 15), 29549#(<= main_~i~1 16), 29531#true, 29532#false, 29533#(= main_~i~1 0), 29534#(<= main_~i~1 1), 29535#(<= main_~i~1 2)] [2018-02-02 10:42:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-02-02 10:42:40,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:42:40,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:42:40,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:40,743 INFO L87 Difference]: Start difference. First operand 314 states and 416 transitions. Second operand 19 states. [2018-02-02 10:42:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:40,870 INFO L93 Difference]: Finished difference Result 505 states and 662 transitions. [2018-02-02 10:42:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:42:40,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 775 [2018-02-02 10:42:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:40,872 INFO L225 Difference]: With dead ends: 505 [2018-02-02 10:42:40,872 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 10:42:40,872 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-02 10:42:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 10:42:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 325. [2018-02-02 10:42:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 10:42:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-02-02 10:42:40,877 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 775 [2018-02-02 10:42:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:40,877 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-02-02 10:42:40,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:42:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-02-02 10:42:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-02-02 10:42:40,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:40,882 INFO L351 BasicCegarLoop]: trace histogram [118, 101, 101, 101, 101, 101, 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-02 10:42:40,882 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1205015410, now seen corresponding path program 49 times [2018-02-02 10:42:40,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:40,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-02 10:42:41,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:41,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:42:41,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-02-02 10:42:41,692 INFO L182 omatonBuilderFactory]: Interpolants [30380#true, 30381#false, 30382#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30383#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30393#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 30394#(<= |foo_#in~size| 11), 30395#(<= main_~i~1 11), 30396#(<= main_~i~1 12)] [2018-02-02 10:42:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-02 10:42:41,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:42:41,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:42:41,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:41,693 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 17 states. [2018-02-02 10:42:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:41,890 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2018-02-02 10:42:41,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:42:41,891 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 829 [2018-02-02 10:42:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:41,893 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:42:41,893 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:42:41,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:42:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:42:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 331. [2018-02-02 10:42:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 10:42:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2018-02-02 10:42:41,898 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 829 [2018-02-02 10:42:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:41,899 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2018-02-02 10:42:41,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:42:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2018-02-02 10:42:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-02-02 10:42:41,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:41,903 INFO L351 BasicCegarLoop]: trace histogram [119, 102, 102, 102, 102, 102, 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-02 10:42:41,903 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:41,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1810198058, now seen corresponding path program 50 times [2018-02-02 10:42:41,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:41,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-02 10:42:42,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:42,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:42:42,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-02-02 10:42:42,690 INFO L182 omatonBuilderFactory]: Interpolants [31232#(<= main_~i~1 12), 31233#(<= main_~i~1 13), 31216#true, 31217#false, 31218#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 31219#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 31220#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 31221#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 31222#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 31223#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 31224#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 31225#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 31226#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 31227#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 31228#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 31229#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 31230#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 31231#(<= |foo_#in~size| 12)] [2018-02-02 10:42:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-02-02 10:42:42,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:42:42,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:42:42,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:42,691 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand 18 states. [2018-02-02 10:42:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:42,934 INFO L93 Difference]: Finished difference Result 473 states and 717 transitions. [2018-02-02 10:42:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:42:42,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 835 [2018-02-02 10:42:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:42,937 INFO L225 Difference]: With dead ends: 473 [2018-02-02 10:42:42,937 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 10:42:42,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:42:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 10:42:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 337. [2018-02-02 10:42:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-02 10:42:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2018-02-02 10:42:42,942 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 835 [2018-02-02 10:42:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:42,942 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2018-02-02 10:42:42,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:42:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2018-02-02 10:42:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-02-02 10:42:42,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:42,946 INFO L351 BasicCegarLoop]: trace histogram [120, 103, 103, 103, 103, 103, 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-02 10:42:42,946 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1329144094, now seen corresponding path program 51 times [2018-02-02 10:42:42,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:42,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-02-02 10:42:43,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:43,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:42:43,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2018-02-02 10:42:43,754 INFO L182 omatonBuilderFactory]: Interpolants [32070#true, 32071#false, 32072#(= main_~i~1 0), 32073#(<= main_~i~1 1), 32074#(<= main_~i~1 2), 32075#(<= main_~i~1 3), 32076#(<= main_~i~1 4), 32077#(<= main_~i~1 5), 32078#(<= main_~i~1 6), 32079#(<= main_~i~1 7), 32080#(<= main_~i~1 8), 32081#(<= main_~i~1 9), 32082#(<= main_~i~1 10), 32083#(<= main_~i~1 11), 32084#(<= main_~i~1 12), 32085#(<= main_~i~1 13), 32086#(<= main_~i~1 14), 32087#(<= main_~i~1 15), 32088#(<= main_~i~1 16), 32089#(<= main_~i~1 17)] [2018-02-02 10:42:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-02-02 10:42:43,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:42:43,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:42:43,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:43,755 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand 20 states. [2018-02-02 10:42:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:43,906 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2018-02-02 10:42:43,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:42:43,906 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 841 [2018-02-02 10:42:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:43,908 INFO L225 Difference]: With dead ends: 533 [2018-02-02 10:42:43,908 INFO L226 Difference]: Without dead ends: 533 [2018-02-02 10:42:43,908 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-02 10:42:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-02 10:42:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 348. [2018-02-02 10:42:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:42:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-02 10:42:43,914 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 841 [2018-02-02 10:42:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:43,914 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-02 10:42:43,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:42:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-02 10:42:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2018-02-02 10:42:43,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:43,921 INFO L351 BasicCegarLoop]: trace histogram [128, 110, 110, 110, 110, 110, 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-02 10:42:43,921 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1888354327, now seen corresponding path program 52 times [2018-02-02 10:42:43,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:43,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:44,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:44,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:42:44,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 544 proven. 62 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:42:44,765 INFO L182 omatonBuilderFactory]: Interpolants [32971#true, 32972#false, 32973#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 32974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 32975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 32976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 32977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 32978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 32979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 32980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 32981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 32982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 32983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 32984#(<= |foo_#in~size| 10), 32985#(<= main_~i~1 10), 32986#(<= main_~i~1 11), 32987#(<= main_~i~1 12)] [2018-02-02 10:42:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:44,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:42:44,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:42:44,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:44,766 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 17 states. [2018-02-02 10:42:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:44,975 INFO L93 Difference]: Finished difference Result 572 states and 890 transitions. [2018-02-02 10:42:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:42:44,975 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 895 [2018-02-02 10:42:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:44,978 INFO L225 Difference]: With dead ends: 572 [2018-02-02 10:42:44,978 INFO L226 Difference]: Without dead ends: 572 [2018-02-02 10:42:44,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:42:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-02-02 10:42:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 348. [2018-02-02 10:42:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:42:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-02 10:42:44,986 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 895 [2018-02-02 10:42:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:44,987 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-02 10:42:44,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:42:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-02 10:42:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2018-02-02 10:42:44,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:44,993 INFO L351 BasicCegarLoop]: trace histogram [129, 111, 111, 111, 111, 111, 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-02 10:42:44,993 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 904827743, now seen corresponding path program 53 times [2018-02-02 10:42:44,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:45,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:45,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:45,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:42:45,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 544 proven. 68 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:42:45,855 INFO L182 omatonBuilderFactory]: Interpolants [33930#true, 33931#false, 33932#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 33933#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 33934#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 33935#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 33936#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 33937#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 33938#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 33939#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 33940#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 33941#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 33942#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 33943#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 33944#(<= |foo_#in~size| 11), 33945#(<= main_~i~1 11), 33946#(<= main_~i~1 12), 33947#(<= main_~i~1 13)] [2018-02-02 10:42:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:45,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:42:45,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:42:45,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:45,856 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 18 states. [2018-02-02 10:42:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:46,103 INFO L93 Difference]: Finished difference Result 575 states and 937 transitions. [2018-02-02 10:42:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:42:46,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 901 [2018-02-02 10:42:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:46,105 INFO L225 Difference]: With dead ends: 575 [2018-02-02 10:42:46,105 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 10:42:46,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:42:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 10:42:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 348. [2018-02-02 10:42:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:42:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-02-02 10:42:46,112 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 901 [2018-02-02 10:42:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:46,112 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-02-02 10:42:46,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:42:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-02-02 10:42:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2018-02-02 10:42:46,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:46,116 INFO L351 BasicCegarLoop]: trace histogram [130, 112, 112, 112, 112, 112, 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-02 10:42:46,117 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2011852633, now seen corresponding path program 54 times [2018-02-02 10:42:46,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:46,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:46,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:46,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:42:46,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 544 proven. 74 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:42:46,994 INFO L182 omatonBuilderFactory]: Interpolants [34912#(<= main_~i~1 13), 34913#(<= main_~i~1 14), 34895#true, 34896#false, 34897#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 34898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 34899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 34900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 34901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 34902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 34903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 34904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 34905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 34906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 34907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 34908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 34909#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 34910#(<= |foo_#in~size| 12), 34911#(<= main_~i~1 12)] [2018-02-02 10:42:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-02-02 10:42:46,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:42:46,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:42:46,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:46,995 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 19 states. [2018-02-02 10:42:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:47,229 INFO L93 Difference]: Finished difference Result 579 states and 941 transitions. [2018-02-02 10:42:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:42:47,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 907 [2018-02-02 10:42:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:47,232 INFO L225 Difference]: With dead ends: 579 [2018-02-02 10:42:47,232 INFO L226 Difference]: Without dead ends: 579 [2018-02-02 10:42:47,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=668, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:42:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-02 10:42:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 345. [2018-02-02 10:42:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 10:42:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 446 transitions. [2018-02-02 10:42:47,238 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 446 transitions. Word has length 907 [2018-02-02 10:42:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:47,239 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 446 transitions. [2018-02-02 10:42:47,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:42:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 446 transitions. [2018-02-02 10:42:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2018-02-02 10:42:47,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:47,243 INFO L351 BasicCegarLoop]: trace histogram [131, 113, 113, 113, 113, 113, 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-02 10:42:47,243 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1895073809, now seen corresponding path program 55 times [2018-02-02 10:42:47,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:47,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-02-02 10:42:48,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:48,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:42:48,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-02 10:42:48,156 INFO L182 omatonBuilderFactory]: Interpolants [35872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 35873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 35874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 35875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 35876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 35877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 35878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 35879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 35880#(<= |foo_#in~size| 13), 35881#(<= main_~i~1 13), 35882#(<= main_~i~1 14), 35864#true, 35865#false, 35866#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 35867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 35868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 35869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 35870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 35871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-02 10:42:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-02-02 10:42:48,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:42:48,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:42:48,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:48,157 INFO L87 Difference]: Start difference. First operand 345 states and 446 transitions. Second operand 19 states. [2018-02-02 10:42:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:48,357 INFO L93 Difference]: Finished difference Result 501 states and 791 transitions. [2018-02-02 10:42:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:42:48,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 913 [2018-02-02 10:42:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:48,360 INFO L225 Difference]: With dead ends: 501 [2018-02-02 10:42:48,360 INFO L226 Difference]: Without dead ends: 501 [2018-02-02 10:42:48,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:42:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-02 10:42:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 354. [2018-02-02 10:42:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 10:42:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-02 10:42:48,366 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 913 [2018-02-02 10:42:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:48,366 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-02 10:42:48,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:42:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-02 10:42:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-02-02 10:42:48,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:48,371 INFO L351 BasicCegarLoop]: trace histogram [132, 114, 114, 114, 114, 114, 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-02 10:42:48,371 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1507938423, now seen corresponding path program 56 times [2018-02-02 10:42:48,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:48,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-02-02 10:42:49,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:49,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:42:49,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4311 backedges. 177 proven. 411 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2018-02-02 10:42:49,309 INFO L182 omatonBuilderFactory]: Interpolants [36768#(<= 0 main_~i~1), 36769#(<= 1 main_~i~1), 36770#(<= 2 main_~i~1), 36771#(<= 3 main_~i~1), 36772#(<= 4 main_~i~1), 36773#(<= 5 main_~i~1), 36774#(<= 6 main_~i~1), 36775#(<= 7 main_~i~1), 36776#(<= 8 main_~i~1), 36777#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36778#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36779#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36780#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36781#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36782#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36783#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36784#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36785#(<= |foo_#in~size| 7), 36766#true, 36767#false] [2018-02-02 10:42:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-02-02 10:42:49,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:42:49,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:42:49,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:49,310 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 20 states. [2018-02-02 10:42:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:49,712 INFO L93 Difference]: Finished difference Result 394 states and 493 transitions. [2018-02-02 10:42:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:42:49,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 919 [2018-02-02 10:42:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:49,713 INFO L225 Difference]: With dead ends: 394 [2018-02-02 10:42:49,713 INFO L226 Difference]: Without dead ends: 394 [2018-02-02 10:42:49,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:42:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-02-02 10:42:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2018-02-02 10:42:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 10:42:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 461 transitions. [2018-02-02 10:42:49,717 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 461 transitions. Word has length 919 [2018-02-02 10:42:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:49,717 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 461 transitions. [2018-02-02 10:42:49,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:42:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2018-02-02 10:42:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-02-02 10:42:49,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:49,722 INFO L351 BasicCegarLoop]: trace histogram [138, 120, 120, 120, 120, 120, 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-02 10:42:49,722 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:49,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1331307801, now seen corresponding path program 57 times [2018-02-02 10:42:49,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:49,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-02-02 10:42:50,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:50,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:42:50,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4545 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4545 trivial. 0 not checked. [2018-02-02 10:42:50,710 INFO L182 omatonBuilderFactory]: Interpolants [37568#(<= main_~i~1 16), 37569#(<= main_~i~1 17), 37570#(<= main_~i~1 18), 37550#true, 37551#false, 37552#(= main_~i~1 0), 37553#(<= main_~i~1 1), 37554#(<= main_~i~1 2), 37555#(<= main_~i~1 3), 37556#(<= main_~i~1 4), 37557#(<= main_~i~1 5), 37558#(<= main_~i~1 6), 37559#(<= main_~i~1 7), 37560#(<= main_~i~1 8), 37561#(<= main_~i~1 9), 37562#(<= main_~i~1 10), 37563#(<= main_~i~1 11), 37564#(<= main_~i~1 12), 37565#(<= main_~i~1 13), 37566#(<= main_~i~1 14), 37567#(<= main_~i~1 15)] [2018-02-02 10:42:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-02-02 10:42:50,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:42:50,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:42:50,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:42:50,711 INFO L87 Difference]: Start difference. First operand 354 states and 461 transitions. Second operand 21 states. [2018-02-02 10:42:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:50,876 INFO L93 Difference]: Finished difference Result 523 states and 649 transitions. [2018-02-02 10:42:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:42:50,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 955 [2018-02-02 10:42:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:50,879 INFO L225 Difference]: With dead ends: 523 [2018-02-02 10:42:50,879 INFO L226 Difference]: Without dead ends: 523 [2018-02-02 10:42:50,879 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-02 10:42:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-02 10:42:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 365. [2018-02-02 10:42:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:42:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-02 10:42:50,884 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 955 [2018-02-02 10:42:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:50,884 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-02 10:42:50,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:42:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-02 10:42:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-02-02 10:42:50,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:50,890 INFO L351 BasicCegarLoop]: trace histogram [147, 128, 128, 128, 128, 128, 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-02 10:42:50,890 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1086056216, now seen corresponding path program 58 times [2018-02-02 10:42:50,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:50,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:51,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:51,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:42:51,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 574 proven. 112 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:51,914 INFO L182 omatonBuilderFactory]: Interpolants [38464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 38465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 38466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 38467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 38468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 38469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 38470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 38471#(<= |foo_#in~size| 9), 38472#(<= main_~i~1 9), 38473#(<= main_~i~1 10), 38474#(<= main_~i~1 11), 38475#(<= main_~i~1 12), 38459#true, 38460#false, 38461#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 38462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 38463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:42:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:51,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:42:51,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:42:51,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:42:51,915 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 17 states. [2018-02-02 10:42:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:52,111 INFO L93 Difference]: Finished difference Result 684 states and 1059 transitions. [2018-02-02 10:42:52,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:42:52,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1015 [2018-02-02 10:42:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:52,159 INFO L225 Difference]: With dead ends: 684 [2018-02-02 10:42:52,159 INFO L226 Difference]: Without dead ends: 684 [2018-02-02 10:42:52,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:42:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-02-02 10:42:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 365. [2018-02-02 10:42:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:42:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-02 10:42:52,167 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1015 [2018-02-02 10:42:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:52,167 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-02 10:42:52,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:42:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-02 10:42:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2018-02-02 10:42:52,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:52,173 INFO L351 BasicCegarLoop]: trace histogram [148, 129, 129, 129, 129, 129, 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-02 10:42:52,173 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -616958928, now seen corresponding path program 59 times [2018-02-02 10:42:52,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:52,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:53,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:53,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:42:53,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 574 proven. 124 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:53,226 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 39553#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 39554#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 39555#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 39556#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 39557#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 39558#(<= |foo_#in~size| 10), 39559#(<= main_~i~1 10), 39560#(<= main_~i~1 11), 39561#(<= main_~i~1 12), 39562#(<= main_~i~1 13), 39545#true, 39546#false, 39547#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 39548#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 39549#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 39550#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 39551#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4))] [2018-02-02 10:42:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:53,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:42:53,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:42:53,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:42:53,228 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 18 states. [2018-02-02 10:42:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:53,420 INFO L93 Difference]: Finished difference Result 687 states and 1122 transitions. [2018-02-02 10:42:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:42:53,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1021 [2018-02-02 10:42:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:53,425 INFO L225 Difference]: With dead ends: 687 [2018-02-02 10:42:53,425 INFO L226 Difference]: Without dead ends: 687 [2018-02-02 10:42:53,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:42:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-02-02 10:42:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 365. [2018-02-02 10:42:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:42:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-02 10:42:53,433 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1021 [2018-02-02 10:42:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:53,433 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-02 10:42:53,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:42:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-02 10:42:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-02-02 10:42:53,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:53,439 INFO L351 BasicCegarLoop]: trace histogram [149, 130, 130, 130, 130, 130, 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-02 10:42:53,439 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1088436600, now seen corresponding path program 60 times [2018-02-02 10:42:53,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:53,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:54,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:54,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:42:54,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5280 backedges. 574 proven. 136 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:54,542 INFO L182 omatonBuilderFactory]: Interpolants [40640#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 40641#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 40642#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 40643#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 40644#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 40645#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 40646#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 40647#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 40648#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 40649#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 40650#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 40651#(<= |foo_#in~size| 11), 40652#(<= main_~i~1 11), 40653#(<= main_~i~1 12), 40654#(<= main_~i~1 13), 40655#(<= main_~i~1 14), 40637#true, 40638#false, 40639#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-02 10:42:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:54,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:42:54,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:42:54,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:42:54,543 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 19 states. [2018-02-02 10:42:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:54,790 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-02-02 10:42:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:42:54,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1027 [2018-02-02 10:42:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:54,793 INFO L225 Difference]: With dead ends: 690 [2018-02-02 10:42:54,793 INFO L226 Difference]: Without dead ends: 690 [2018-02-02 10:42:54,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:42:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-02 10:42:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 365. [2018-02-02 10:42:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:42:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-02-02 10:42:54,801 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1027 [2018-02-02 10:42:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:54,801 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-02-02 10:42:54,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:42:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-02-02 10:42:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2018-02-02 10:42:54,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:54,807 INFO L351 BasicCegarLoop]: trace histogram [150, 131, 131, 131, 131, 131, 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-02 10:42:54,807 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1086286016, now seen corresponding path program 61 times [2018-02-02 10:42:54,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:54,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:55,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:55,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:42:55,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 574 proven. 148 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:55,949 INFO L182 omatonBuilderFactory]: Interpolants [41735#true, 41736#false, 41737#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41738#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 41739#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41740#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41741#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41742#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41743#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 41744#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41745#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41746#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 41747#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 41748#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 41749#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 41750#(<= |foo_#in~size| 12), 41751#(<= main_~i~1 12), 41752#(<= main_~i~1 13), 41753#(<= main_~i~1 14), 41754#(<= main_~i~1 15)] [2018-02-02 10:42:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-02-02 10:42:55,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:42:55,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:42:55,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:55,951 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 20 states. [2018-02-02 10:42:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:56,220 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-02-02 10:42:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:42:56,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1033 [2018-02-02 10:42:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:56,226 INFO L225 Difference]: With dead ends: 690 [2018-02-02 10:42:56,226 INFO L226 Difference]: Without dead ends: 690 [2018-02-02 10:42:56,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:42:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-02 10:42:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 362. [2018-02-02 10:42:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 10:42:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-02-02 10:42:56,236 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1033 [2018-02-02 10:42:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:56,236 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-02-02 10:42:56,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:42:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-02-02 10:42:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-02-02 10:42:56,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:56,243 INFO L351 BasicCegarLoop]: trace histogram [151, 132, 132, 132, 132, 132, 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-02 10:42:56,243 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1023409656, now seen corresponding path program 62 times [2018-02-02 10:42:56,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:56,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-02-02 10:42:57,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:57,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:42:57,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5307 backedges. 657 proven. 80 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:57,416 INFO L182 omatonBuilderFactory]: Interpolants [42848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 42849#(<= |foo_#in~size| 13), 42850#(<= main_~i~1 13), 42851#(<= main_~i~1 14), 42852#(<= main_~i~1 15), 42833#true, 42834#false, 42835#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 42836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 42837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 42838#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 42839#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 42840#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 42841#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 42842#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 42843#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 42844#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 42845#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 42846#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 42847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12))] [2018-02-02 10:42:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-02-02 10:42:57,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:42:57,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:42:57,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:57,417 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-02-02 10:42:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:57,640 INFO L93 Difference]: Finished difference Result 613 states and 1012 transitions. [2018-02-02 10:42:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:42:57,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1039 [2018-02-02 10:42:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:57,644 INFO L225 Difference]: With dead ends: 613 [2018-02-02 10:42:57,645 INFO L226 Difference]: Without dead ends: 613 [2018-02-02 10:42:57,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:42:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-02 10:42:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 362. [2018-02-02 10:42:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 10:42:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-02-02 10:42:57,655 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1039 [2018-02-02 10:42:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:57,655 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-02-02 10:42:57,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:42:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-02-02 10:42:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2018-02-02 10:42:57,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:57,661 INFO L351 BasicCegarLoop]: trace histogram [152, 133, 133, 133, 133, 133, 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-02 10:42:57,661 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1458828144, now seen corresponding path program 63 times [2018-02-02 10:42:57,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:57,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:42:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-02-02 10:42:58,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:42:58,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:42:58,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:42:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-02-02 10:42:58,873 INFO L182 omatonBuilderFactory]: Interpolants [43872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 43873#(<= |foo_#in~size| 14), 43874#(<= main_~i~1 14), 43875#(<= main_~i~1 15), 43856#true, 43857#false, 43858#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 43869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 43870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 43871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13))] [2018-02-02 10:42:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-02-02 10:42:58,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:42:58,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:42:58,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:42:58,874 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-02-02 10:42:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:42:59,091 INFO L93 Difference]: Finished difference Result 529 states and 847 transitions. [2018-02-02 10:42:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:42:59,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1045 [2018-02-02 10:42:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:42:59,095 INFO L225 Difference]: With dead ends: 529 [2018-02-02 10:42:59,095 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 10:42:59,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:42:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 10:42:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2018-02-02 10:42:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-02 10:42:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 484 transitions. [2018-02-02 10:42:59,103 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 484 transitions. Word has length 1045 [2018-02-02 10:42:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:42:59,104 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 484 transitions. [2018-02-02 10:42:59,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:42:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 484 transitions. [2018-02-02 10:42:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2018-02-02 10:42:59,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:42:59,110 INFO L351 BasicCegarLoop]: trace histogram [153, 134, 134, 134, 134, 134, 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-02 10:42:59,110 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:42:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1391339608, now seen corresponding path program 64 times [2018-02-02 10:42:59,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:42:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:42:59,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:43:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-02-02 10:43:00,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:43:00,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:43:00,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:43:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-02-02 10:43:00,333 INFO L182 omatonBuilderFactory]: Interpolants [44806#true, 44807#false, 44808#(= main_~i~1 0), 44809#(<= main_~i~1 1), 44810#(<= main_~i~1 2), 44811#(<= main_~i~1 3), 44812#(<= main_~i~1 4), 44813#(<= main_~i~1 5), 44814#(<= main_~i~1 6), 44815#(<= main_~i~1 7), 44816#(<= main_~i~1 8), 44817#(<= main_~i~1 9), 44818#(<= main_~i~1 10), 44819#(<= main_~i~1 11), 44820#(<= main_~i~1 12), 44821#(<= main_~i~1 13), 44822#(<= main_~i~1 14), 44823#(<= main_~i~1 15), 44824#(<= main_~i~1 16), 44825#(<= main_~i~1 17), 44826#(<= main_~i~1 18), 44827#(<= main_~i~1 19)] [2018-02-02 10:43:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-02-02 10:43:00,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:43:00,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:43:00,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:43:00,334 INFO L87 Difference]: Start difference. First operand 371 states and 484 transitions. Second operand 22 states. [2018-02-02 10:43:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:43:00,519 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2018-02-02 10:43:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:43:00,520 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1051 [2018-02-02 10:43:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:43:00,522 INFO L225 Difference]: With dead ends: 545 [2018-02-02 10:43:00,522 INFO L226 Difference]: Without dead ends: 545 [2018-02-02 10:43:00,523 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-02 10:43:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-02 10:43:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 382. [2018-02-02 10:43:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 10:43:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-02-02 10:43:00,529 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1051 [2018-02-02 10:43:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:43:00,529 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-02-02 10:43:00,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:43:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-02-02 10:43:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-02-02 10:43:00,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:43:00,535 INFO L351 BasicCegarLoop]: trace histogram [162, 142, 142, 142, 142, 142, 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-02 10:43:00,535 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:43:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 131832409, now seen corresponding path program 65 times [2018-02-02 10:43:00,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:43:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:43:00,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:43:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:01,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:43:01,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:43:01,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:43:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 598 proven. 150 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-02 10:43:01,679 INFO L182 omatonBuilderFactory]: Interpolants [45760#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 45761#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 45762#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 45763#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 45764#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 45765#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 45766#(<= |foo_#in~size| 8), 45767#(<= main_~i~1 8), 45768#(<= main_~i~1 9), 45769#(<= main_~i~1 10), 45770#(<= main_~i~1 11), 45771#(<= main_~i~1 12), 45755#true, 45756#false, 45757#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 45758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 45759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:43:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:01,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:43:01,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:43:01,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:43:01,681 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 17 states. [2018-02-02 10:43:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:43:01,875 INFO L93 Difference]: Finished difference Result 796 states and 1255 transitions. [2018-02-02 10:43:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:43:01,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1111 [2018-02-02 10:43:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:43:01,882 INFO L225 Difference]: With dead ends: 796 [2018-02-02 10:43:01,882 INFO L226 Difference]: Without dead ends: 796 [2018-02-02 10:43:01,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:43:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-02-02 10:43:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 385. [2018-02-02 10:43:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:43:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-02 10:43:01,899 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1111 [2018-02-02 10:43:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:43:01,899 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-02 10:43:01,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:43:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-02 10:43:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-02-02 10:43:01,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:43:01,909 INFO L351 BasicCegarLoop]: trace histogram [163, 143, 143, 143, 143, 143, 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-02 10:43:01,909 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:43:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash 215225761, now seen corresponding path program 66 times [2018-02-02 10:43:01,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:43:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:43:01,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:43:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:03,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:43:03,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:43:03,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:43:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 574 proven. 168 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-02 10:43:03,187 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 46977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 46978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 46979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 46980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 46981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 46982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 46983#(<= |foo_#in~size| 9), 46984#(<= main_~i~1 9), 46985#(<= main_~i~1 10), 46986#(<= main_~i~1 11), 46987#(<= main_~i~1 12), 46988#(<= main_~i~1 13), 46971#true, 46972#false, 46973#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 46974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 46975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-02 10:43:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:03,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:43:03,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:43:03,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:43:03,188 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 18 states. [2018-02-02 10:43:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:43:03,411 INFO L93 Difference]: Finished difference Result 799 states and 1334 transitions. [2018-02-02 10:43:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:43:03,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1117 [2018-02-02 10:43:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:43:03,414 INFO L225 Difference]: With dead ends: 799 [2018-02-02 10:43:03,415 INFO L226 Difference]: Without dead ends: 799 [2018-02-02 10:43:03,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:43:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-02-02 10:43:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 385. [2018-02-02 10:43:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:43:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-02 10:43:03,424 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1117 [2018-02-02 10:43:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:43:03,424 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-02 10:43:03,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:43:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-02 10:43:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1124 [2018-02-02 10:43:03,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:43:03,430 INFO L351 BasicCegarLoop]: trace histogram [164, 144, 144, 144, 144, 144, 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-02 10:43:03,430 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:43:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -150668567, now seen corresponding path program 67 times [2018-02-02 10:43:03,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:43:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:43:03,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:43:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:04,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:43:04,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:43:04,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:43:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6087 backedges. 574 proven. 186 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-02 10:43:04,819 INFO L182 omatonBuilderFactory]: Interpolants [48193#true, 48194#false, 48195#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 48196#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 48197#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 48198#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 48199#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 48200#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 48201#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 48202#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 48203#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 48204#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 48205#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 48206#(<= |foo_#in~size| 10), 48207#(<= main_~i~1 10), 48208#(<= main_~i~1 11), 48209#(<= main_~i~1 12), 48210#(<= main_~i~1 13), 48211#(<= main_~i~1 14)] [2018-02-02 10:43:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-02-02 10:43:04,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:43:04,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:43:04,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:43:04,821 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 19 states. [2018-02-02 10:43:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:43:05,083 INFO L93 Difference]: Finished difference Result 802 states and 1413 transitions. [2018-02-02 10:43:05,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:43:05,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1123 [2018-02-02 10:43:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:43:05,086 INFO L225 Difference]: With dead ends: 802 [2018-02-02 10:43:05,086 INFO L226 Difference]: Without dead ends: 802 [2018-02-02 10:43:05,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:43:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-02-02 10:43:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 385. [2018-02-02 10:43:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:43:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-02-02 10:43:05,096 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1123 [2018-02-02 10:43:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:43:05,096 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-02-02 10:43:05,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:43:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-02-02 10:43:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2018-02-02 10:43:05,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:43:05,103 INFO L351 BasicCegarLoop]: trace histogram [165, 145, 145, 145, 145, 145, 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-02 10:43:05,103 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 10:43:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1358350897, now seen corresponding path program 68 times [2018-02-02 10:43:05,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:43:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:43:05,143 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-02 10:43:05,881 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:43:05,883 INFO L168 Benchmark]: Toolchain (without parser) took 51725.02 ms. Allocated memory was 394.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 352.2 MB in the beginning and 634.3 MB in the end (delta: -282.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:43:05,884 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:43:05,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.73 ms. Allocated memory is still 394.3 MB. Free memory was 352.2 MB in the beginning and 344.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:43:05,884 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 394.3 MB. Free memory was 344.3 MB in the beginning and 341.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:43:05,885 INFO L168 Benchmark]: RCFGBuilder took 178.52 ms. Allocated memory is still 394.3 MB. Free memory was 341.6 MB in the beginning and 324.1 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:43:05,885 INFO L168 Benchmark]: TraceAbstraction took 51346.81 ms. Allocated memory was 394.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.1 MB in the beginning and 634.3 MB in the end (delta: -310.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 10:43:05,886 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.12 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.73 ms. Allocated memory is still 394.3 MB. Free memory was 352.2 MB in the beginning and 344.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 394.3 MB. Free memory was 344.3 MB in the beginning and 341.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.52 ms. Allocated memory is still 394.3 MB. Free memory was 341.6 MB in the beginning and 324.1 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51346.81 ms. Allocated memory was 394.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.1 MB in the beginning and 634.3 MB in the end (delta: -310.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-43-05-891.csv Completed graceful shutdown