java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:15:38,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:15:38,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:15:38,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:15:38,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:15:38,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:15:38,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:15:38,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:15:38,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:15:38,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:15:38,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:15:38,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:15:38,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:15:38,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:15:38,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:15:38,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:15:38,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:15:38,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:15:38,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:15:38,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:15:38,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:15:38,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:15:38,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:15:38,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:15:38,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:15:38,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:15:38,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:15:38,939 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:15:38,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:15:38,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:15:38,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:15:38,939 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 16:15:38,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:15:38,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:15:38,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:15:38,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:15:38,949 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:15:38,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:15:38,950 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:15:38,951 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:15:38,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:15:38,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:15:38,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:15:38,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:15:38,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:15:38,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:15:38,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:15:38,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:15:38,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:15:38,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:15:38,987 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:15:38,989 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:15:38,990 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:15:38,990 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:15:38,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-04 16:15:39,087 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:15:39,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:15:39,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:15:39,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:15:39,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:15:39,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102be451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39, skipping insertion in model container [2018-02-04 16:15:39,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,118 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:15:39,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:15:39,231 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:15:39,244 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:15:39,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39 WrapperNode [2018-02-04 16:15:39,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:15:39,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:15:39,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:15:39,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:15:39,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... [2018-02-04 16:15:39,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:15:39,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:15:39,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:15:39,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:15:39,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:15:39,317 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:15:39,318 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:15:39,318 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 16:15:39,318 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:15:39,318 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:15:39,318 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:15:39,318 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:15:39,318 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:15:39,318 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:15:39,319 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 16:15:39,319 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:15:39,319 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:15:39,319 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:15:39,427 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:15:39,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:39 BoogieIcfgContainer [2018-02-04 16:15:39,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:15:39,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:15:39,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:15:39,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:15:39,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:15:39" (1/3) ... [2018-02-04 16:15:39,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc9d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:39, skipping insertion in model container [2018-02-04 16:15:39,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:15:39" (2/3) ... [2018-02-04 16:15:39,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc9d948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:15:39, skipping insertion in model container [2018-02-04 16:15:39,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:15:39" (3/3) ... [2018-02-04 16:15:39,432 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-02-04 16:15:39,436 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:15:39,440 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 16:15:39,474 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:15:39,475 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:15:39,475 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:15:39,475 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:15:39,475 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:15:39,475 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:15:39,475 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:15:39,475 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:15:39,476 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:15:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 16:15:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 16:15:39,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:39,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:39,498 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-04 16:15:39,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:39,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:39,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:15:39,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,647 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-02-04 16:15:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:15:39,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:15:39,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:15:39,661 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 16:15:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:39,747 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 16:15:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:15:39,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 16:15:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:39,758 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:15:39,758 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 16:15:39,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:15:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 16:15:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-04 16:15:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 16:15:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 16:15:39,825 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-04 16:15:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:39,826 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 16:15:39,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:15:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 16:15:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 16:15:39,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:39,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:39,826 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-04 16:15:39,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:39,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:39,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:15:39,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,861 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= foo_~i~0 0)] [2018-02-04 16:15:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:39,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:15:39,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:15:39,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:15:39,864 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-02-04 16:15:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:39,885 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 16:15:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:15:39,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 16:15:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:39,888 INFO L225 Difference]: With dead ends: 60 [2018-02-04 16:15:39,888 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 16:15:39,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:15:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 16:15:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-02-04 16:15:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 16:15:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-04 16:15:39,893 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-02-04 16:15:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:39,894 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-04 16:15:39,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:15:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-04 16:15:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:15:39,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:39,895 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:39,895 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:39,895 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-02-04 16:15:39,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:39,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:40,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:15:40,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,016 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 282#(and (= 0 |foo_#in~b.offset|) (= 32 (select |#length| |foo_#in~b.base|))), 283#(and (= (select |#length| foo_~b.base) 32) (= foo_~b.offset 0)), 284#(and (= (select |#length| foo_~b.base) 32) (<= 0 foo_~i~0) (= foo_~b.offset 0) (<= foo_~i~0 31))] [2018-02-04 16:15:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:15:40,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:15:40,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:15:40,017 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-04 16:15:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,081 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 16:15:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:15:40,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 16:15:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,082 INFO L225 Difference]: With dead ends: 54 [2018-02-04 16:15:40,082 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 16:15:40,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 16:15:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-04 16:15:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 16:15:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-04 16:15:40,085 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-02-04 16:15:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,085 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-04 16:15:40,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:15:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-04 16:15:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:15:40,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,086 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,086 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-02-04 16:15:40,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:40,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:15:40,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,110 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| |main_~#mask~0.base|)), 397#(= 1 (select |#valid| |foo_#in~b.base|)), 398#(= 1 (select |#valid| foo_~b.base))] [2018-02-04 16:15:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:15:40,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:15:40,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:15:40,111 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-02-04 16:15:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,158 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 16:15:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:15:40,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 16:15:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,160 INFO L225 Difference]: With dead ends: 50 [2018-02-04 16:15:40,160 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 16:15:40,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:15:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 16:15:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 16:15:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 16:15:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 16:15:40,164 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-02-04 16:15:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,164 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 16:15:40,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:15:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 16:15:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 16:15:40,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,165 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,165 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-02-04 16:15:40,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:40,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:15:40,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,227 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= 0 main_~i~1), 504#(= 0 |foo_#in~size|), 505#(= foo_~size 0), 506#(and (= foo_~size 0) (<= 0 foo_~i~0)), 507#(and (= foo_~size 0) (<= 1 foo_~i~0))] [2018-02-04 16:15:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:15:40,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:15:40,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:15:40,229 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-04 16:15:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,307 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 16:15:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:15:40,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 16:15:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,308 INFO L225 Difference]: With dead ends: 72 [2018-02-04 16:15:40,308 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 16:15:40,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 16:15:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-02-04 16:15:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 16:15:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 16:15:40,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 22 [2018-02-04 16:15:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,312 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 16:15:40,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:15:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 16:15:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:15:40,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,313 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,313 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-04 16:15:40,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:40,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:15:40,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,352 INFO L182 omatonBuilderFactory]: Interpolants [647#true, 648#false, 649#(<= 0 main_~i~1), 650#(<= 1 main_~i~1), 651#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-02-04 16:15:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:15:40,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:15:40,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:15:40,353 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-02-04 16:15:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,389 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-04 16:15:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:15:40,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 16:15:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,391 INFO L225 Difference]: With dead ends: 72 [2018-02-04 16:15:40,391 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 16:15:40,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:15:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 16:15:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-02-04 16:15:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:15:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 16:15:40,395 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2018-02-04 16:15:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,395 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 16:15:40,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:15:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 16:15:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 16:15:40,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,396 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,396 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-04 16:15:40,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,465 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-04 16:15:40,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:40,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:15:40,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,466 INFO L182 omatonBuilderFactory]: Interpolants [784#true, 785#false, 786#(= main_~i~1 0), 787#(= foo_~i~0 0), 788#(= |foo_#res| 0), 789#(and (= |main_#t~ret3| 0) (= main_~i~1 0)), 790#(= (select main_~b~0 0) 0), 791#(= main_~i~1 (select main_~b~0 main_~i~1))] [2018-02-04 16:15:40,466 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-04 16:15:40,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:15:40,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:15:40,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:40,467 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2018-02-04 16:15:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,576 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-04 16:15:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:15:40,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 16:15:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,578 INFO L225 Difference]: With dead ends: 91 [2018-02-04 16:15:40,578 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 16:15:40,578 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-04 16:15:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 16:15:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-02-04 16:15:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 16:15:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 16:15:40,583 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 31 [2018-02-04 16:15:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,583 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 16:15:40,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:15:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 16:15:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:15:40,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,584 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-04 16:15:40,584 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-02-04 16:15:40,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:15:40,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:15:40,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:15:40,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,652 INFO L182 omatonBuilderFactory]: Interpolants [961#true, 962#false, 963#(= 0 main_~i~1), 964#(and (= foo_~i~0 0) (or (= foo_~size 0) (= |foo_#in~size| foo_~size))), 965#(and (= foo_~i~0 0) (not (= |foo_#in~size| 0))), 966#(not (= |foo_#in~size| 0))] [2018-02-04 16:15:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:15:40,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:15:40,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:15:40,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:15:40,653 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-04 16:15:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,708 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-02-04 16:15:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:15:40,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 16:15:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,709 INFO L225 Difference]: With dead ends: 79 [2018-02-04 16:15:40,709 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 16:15:40,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:15:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 16:15:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-02-04 16:15:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:15:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 16:15:40,712 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2018-02-04 16:15:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,712 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 16:15:40,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:15:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 16:15:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 16:15:40,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,713 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,713 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-02-04 16:15:40,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:15:40,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:40,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 16:15:40,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,745 INFO L182 omatonBuilderFactory]: Interpolants [1108#true, 1109#false, 1110#(= main_~i~1 0), 1111#(<= main_~i~1 1)] [2018-02-04 16:15:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:15:40,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:15:40,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:15:40,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:15:40,745 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2018-02-04 16:15:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,771 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-04 16:15:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:15:40,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-04 16:15:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,772 INFO L225 Difference]: With dead ends: 86 [2018-02-04 16:15:40,772 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 16:15:40,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:15:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 16:15:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2018-02-04 16:15:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 16:15:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 16:15:40,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 37 [2018-02-04 16:15:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,776 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 16:15:40,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:15:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 16:15:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 16:15:40,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,777 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,777 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 2 times [2018-02-04 16:15:40,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 16:15:40,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:40,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:15:40,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,837 INFO L182 omatonBuilderFactory]: Interpolants [1267#true, 1268#false, 1269#(<= main_~i~1 31), 1270#(<= |foo_#in~size| 31), 1271#(<= foo_~size 31), 1272#(and (<= 0 foo_~i~0) (<= foo_~size 31)), 1273#(and (<= 1 foo_~i~0) (<= foo_~size 31)), 1274#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))] [2018-02-04 16:15:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 16:15:40,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:15:40,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:15:40,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:40,838 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2018-02-04 16:15:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:40,916 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-02-04 16:15:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:15:40,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-04 16:15:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:40,917 INFO L225 Difference]: With dead ends: 76 [2018-02-04 16:15:40,917 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 16:15:40,917 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-04 16:15:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 16:15:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-02-04 16:15:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 16:15:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 16:15:40,921 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2018-02-04 16:15:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:40,921 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 16:15:40,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:15:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 16:15:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 16:15:40,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:40,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:40,922 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-02-04 16:15:40,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:40,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:15:40,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:40,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:15:40,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:15:40,963 INFO L182 omatonBuilderFactory]: Interpolants [1424#(= main_~i~1 0), 1425#(<= main_~i~1 1), 1426#(<= main_~i~1 2), 1422#true, 1423#false] [2018-02-04 16:15:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:15:40,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:15:40,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:15:40,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:15:40,964 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2018-02-04 16:15:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,005 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-04 16:15:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:15:41,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-02-04 16:15:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,006 INFO L225 Difference]: With dead ends: 98 [2018-02-04 16:15:41,006 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 16:15:41,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:15:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 16:15:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-02-04 16:15:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:15:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 16:15:41,010 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 49 [2018-02-04 16:15:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,010 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 16:15:41,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:15:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 16:15:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 16:15:41,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,012 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,012 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1217895456, now seen corresponding path program 3 times [2018-02-04 16:15:41,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 16:15:41,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:15:41,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:15:41,077 INFO L182 omatonBuilderFactory]: Interpolants [1601#true, 1602#false, 1603#(= main_~i~1 0), 1604#(<= main_~i~1 1), 1605#(<= main_~i~1 2), 1606#(<= main_~i~1 3)] [2018-02-04 16:15:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 16:15:41,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:15:41,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:15:41,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:15:41,078 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-04 16:15:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,132 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 16:15:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:15:41,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 16:15:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,133 INFO L225 Difference]: With dead ends: 114 [2018-02-04 16:15:41,133 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 16:15:41,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:15:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 16:15:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-02-04 16:15:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 16:15:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-04 16:15:41,136 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 61 [2018-02-04 16:15:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,136 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-04 16:15:41,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:15:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-04 16:15:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 16:15:41,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,138 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,138 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash -354388191, now seen corresponding path program 4 times [2018-02-04 16:15:41,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-04 16:15:41,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:15:41,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:15:41,211 INFO L182 omatonBuilderFactory]: Interpolants [1808#true, 1809#false, 1810#(<= 0 main_~i~1), 1811#(<= 1 main_~i~1), 1812#(<= 2 main_~i~1), 1813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1814#(and (= foo_~i~0 0) (<= (+ |foo_#in~size| 1) foo_~i~0)), 1815#(<= (+ |foo_#in~size| 1) 0)] [2018-02-04 16:15:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-04 16:15:41,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:15:41,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:15:41,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:41,212 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 8 states. [2018-02-04 16:15:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,307 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-02-04 16:15:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:15:41,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-04 16:15:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,308 INFO L225 Difference]: With dead ends: 106 [2018-02-04 16:15:41,308 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 16:15:41,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 16:15:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2018-02-04 16:15:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:15:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 16:15:41,314 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 73 [2018-02-04 16:15:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,315 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 16:15:41,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:15:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 16:15:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 16:15:41,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,317 INFO L351 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,317 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 459321465, now seen corresponding path program 5 times [2018-02-04 16:15:41,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-02-04 16:15:41,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:15:41,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,391 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-04 16:15:41,391 INFO L182 omatonBuilderFactory]: Interpolants [2016#(<= main_~i~1 1), 2017#(<= main_~i~1 2), 2018#(<= main_~i~1 3), 2019#(<= main_~i~1 4), 2013#true, 2014#false, 2015#(= main_~i~1 0)] [2018-02-04 16:15:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-02-04 16:15:41,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:15:41,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:15:41,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:15:41,391 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 7 states. [2018-02-04 16:15:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,444 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-02-04 16:15:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:15:41,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-02-04 16:15:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,445 INFO L225 Difference]: With dead ends: 132 [2018-02-04 16:15:41,445 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 16:15:41,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:15:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 16:15:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-02-04 16:15:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 16:15:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-02-04 16:15:41,449 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 91 [2018-02-04 16:15:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,449 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-02-04 16:15:41,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:15:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-02-04 16:15:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 16:15:41,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,451 INFO L351 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,451 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash 109337218, now seen corresponding path program 6 times [2018-02-04 16:15:41,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 16:15:41,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:15:41,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 16:15:41,512 INFO L182 omatonBuilderFactory]: Interpolants [2256#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 2257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 2258#(<= |foo_#in~size| 0), 2252#true, 2253#false, 2254#(<= 0 main_~i~1), 2255#(<= 1 main_~i~1)] [2018-02-04 16:15:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 16:15:41,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:15:41,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:15:41,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:15:41,513 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-02-04 16:15:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,568 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-02-04 16:15:41,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:15:41,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-02-04 16:15:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,570 INFO L225 Difference]: With dead ends: 118 [2018-02-04 16:15:41,570 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 16:15:41,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 16:15:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-02-04 16:15:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 16:15:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-02-04 16:15:41,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 109 [2018-02-04 16:15:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,575 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-02-04 16:15:41,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:15:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-02-04 16:15:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 16:15:41,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,577 INFO L351 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,577 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1378714658, now seen corresponding path program 7 times [2018-02-04 16:15:41,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 16:15:41,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:15:41,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,667 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-04 16:15:41,667 INFO L182 omatonBuilderFactory]: Interpolants [2485#true, 2486#false, 2487#(= main_~i~1 0), 2488#(<= main_~i~1 1), 2489#(<= main_~i~1 2), 2490#(<= main_~i~1 3), 2491#(<= main_~i~1 4), 2492#(<= main_~i~1 5)] [2018-02-04 16:15:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-02-04 16:15:41,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:15:41,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:15:41,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:41,668 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 8 states. [2018-02-04 16:15:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,762 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 16:15:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:15:41,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2018-02-04 16:15:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,763 INFO L225 Difference]: With dead ends: 154 [2018-02-04 16:15:41,763 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 16:15:41,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 16:15:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-02-04 16:15:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 16:15:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2018-02-04 16:15:41,767 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 133 [2018-02-04 16:15:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,767 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2018-02-04 16:15:41,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:15:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-02-04 16:15:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 16:15:41,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,769 INFO L351 BasicCegarLoop]: trace histogram [17, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,769 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1643945613, now seen corresponding path program 8 times [2018-02-04 16:15:41,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-02-04 16:15:41,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:41,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:15:41,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 16:15:41,855 INFO L182 omatonBuilderFactory]: Interpolants [2768#(<= main_~i~1 2), 2769#(<= main_~i~1 3), 2770#(<= main_~i~1 4), 2771#(<= main_~i~1 5), 2772#(<= main_~i~1 6), 2764#true, 2765#false, 2766#(= main_~i~1 0), 2767#(<= main_~i~1 1)] [2018-02-04 16:15:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-02-04 16:15:41,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:15:41,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:15:41,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:41,855 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 9 states. [2018-02-04 16:15:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:41,961 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-02-04 16:15:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:15:41,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-02-04 16:15:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:41,963 INFO L225 Difference]: With dead ends: 170 [2018-02-04 16:15:41,963 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 16:15:41,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 16:15:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 128. [2018-02-04 16:15:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 16:15:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2018-02-04 16:15:41,966 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 157 [2018-02-04 16:15:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:41,967 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2018-02-04 16:15:41,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:15:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2018-02-04 16:15:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 16:15:41,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:41,968 INFO L351 BasicCegarLoop]: trace histogram [20, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:41,971 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2137351228, now seen corresponding path program 9 times [2018-02-04 16:15:41,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:41,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-02-04 16:15:42,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:42,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:15:42,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-02-04 16:15:42,049 INFO L182 omatonBuilderFactory]: Interpolants [3072#false, 3073#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3074#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 3075#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3076#(<= |foo_#in~size| 1), 3077#(<= main_~i~1 1), 3078#(<= main_~i~1 2), 3071#true] [2018-02-04 16:15:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-02-04 16:15:42,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:15:42,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:15:42,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:15:42,050 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 8 states. [2018-02-04 16:15:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:42,172 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2018-02-04 16:15:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:15:42,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-02-04 16:15:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:42,174 INFO L225 Difference]: With dead ends: 195 [2018-02-04 16:15:42,174 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 16:15:42,174 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-04 16:15:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 16:15:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2018-02-04 16:15:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 16:15:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-02-04 16:15:42,180 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 181 [2018-02-04 16:15:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:42,180 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-02-04 16:15:42,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:15:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-02-04 16:15:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 16:15:42,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:42,183 INFO L351 BasicCegarLoop]: trace histogram [21, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:42,183 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash 567902348, now seen corresponding path program 10 times [2018-02-04 16:15:42,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:42,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 148 proven. 172 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-02-04 16:15:42,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:42,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:15:42,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:42,283 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-04 16:15:42,283 INFO L182 omatonBuilderFactory]: Interpolants [3424#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 3425#(<= |foo_#in~size| 1), 3417#true, 3418#false, 3419#(<= 0 main_~i~1), 3420#(<= 1 main_~i~1), 3421#(<= 2 main_~i~1), 3422#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 3423#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 16:15:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 148 proven. 172 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-02-04 16:15:42,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:15:42,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:15:42,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:42,285 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 9 states. [2018-02-04 16:15:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:42,395 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2018-02-04 16:15:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:15:42,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2018-02-04 16:15:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:42,396 INFO L225 Difference]: With dead ends: 151 [2018-02-04 16:15:42,396 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 16:15:42,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 16:15:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2018-02-04 16:15:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 16:15:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2018-02-04 16:15:42,400 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 187 [2018-02-04 16:15:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:42,400 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2018-02-04 16:15:42,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:15:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2018-02-04 16:15:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-04 16:15:42,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:42,403 INFO L351 BasicCegarLoop]: trace histogram [25, 18, 18, 18, 18, 18, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:42,403 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 564145964, now seen corresponding path program 11 times [2018-02-04 16:15:42,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:42,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-02-04 16:15:42,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:42,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:15:42,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:42,544 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-04 16:15:42,544 INFO L182 omatonBuilderFactory]: Interpolants [3718#true, 3719#false, 3720#(= main_~i~1 0), 3721#(<= main_~i~1 1), 3722#(<= main_~i~1 2), 3723#(<= main_~i~1 3), 3724#(<= main_~i~1 4), 3725#(<= main_~i~1 5), 3726#(<= main_~i~1 6), 3727#(<= main_~i~1 7)] [2018-02-04 16:15:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-02-04 16:15:42,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:15:42,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:15:42,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:15:42,545 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 10 states. [2018-02-04 16:15:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:42,625 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-02-04 16:15:42,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:15:42,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-02-04 16:15:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:42,626 INFO L225 Difference]: With dead ends: 195 [2018-02-04 16:15:42,627 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 16:15:42,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:15:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 16:15:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 148. [2018-02-04 16:15:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 16:15:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2018-02-04 16:15:42,630 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 211 [2018-02-04 16:15:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:42,630 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2018-02-04 16:15:42,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:15:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2018-02-04 16:15:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 16:15:42,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:42,631 INFO L351 BasicCegarLoop]: trace histogram [29, 21, 21, 21, 21, 21, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:42,632 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -250985339, now seen corresponding path program 12 times [2018-02-04 16:15:42,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:42,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-04 16:15:42,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:42,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:15:42,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 16:15:42,835 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= main_~i~1 7), 4081#(<= main_~i~1 8), 4071#true, 4072#false, 4073#(= main_~i~1 0), 4074#(<= main_~i~1 1), 4075#(<= main_~i~1 2), 4076#(<= main_~i~1 3), 4077#(<= main_~i~1 4), 4078#(<= main_~i~1 5), 4079#(<= main_~i~1 6)] [2018-02-04 16:15:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1948 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-02-04 16:15:42,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:15:42,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:15:42,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:42,836 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand 11 states. [2018-02-04 16:15:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:42,944 INFO L93 Difference]: Finished difference Result 211 states and 223 transitions. [2018-02-04 16:15:42,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:15:42,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 241 [2018-02-04 16:15:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:42,945 INFO L225 Difference]: With dead ends: 211 [2018-02-04 16:15:42,945 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 16:15:42,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 16:15:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2018-02-04 16:15:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 16:15:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2018-02-04 16:15:42,951 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 241 [2018-02-04 16:15:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:42,952 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2018-02-04 16:15:42,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:15:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2018-02-04 16:15:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 16:15:42,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:42,954 INFO L351 BasicCegarLoop]: trace histogram [33, 24, 24, 24, 24, 24, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:42,954 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -934332386, now seen corresponding path program 13 times [2018-02-04 16:15:42,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:42,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-04 16:15:43,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:43,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:15:43,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-02-04 16:15:43,118 INFO L182 omatonBuilderFactory]: Interpolants [4452#true, 4453#false, 4454#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4455#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4456#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4457#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4458#(<= |foo_#in~size| 2), 4459#(<= main_~i~1 2), 4460#(<= main_~i~1 3)] [2018-02-04 16:15:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-04 16:15:43,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:15:43,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:15:43,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:15:43,119 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand 9 states. [2018-02-04 16:15:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:43,280 INFO L93 Difference]: Finished difference Result 242 states and 281 transitions. [2018-02-04 16:15:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:15:43,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-02-04 16:15:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:43,284 INFO L225 Difference]: With dead ends: 242 [2018-02-04 16:15:43,284 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 16:15:43,284 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-04 16:15:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 16:15:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 168. [2018-02-04 16:15:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 16:15:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2018-02-04 16:15:43,290 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 271 [2018-02-04 16:15:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:43,290 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2018-02-04 16:15:43,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:15:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2018-02-04 16:15:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 16:15:43,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:43,292 INFO L351 BasicCegarLoop]: trace histogram [34, 25, 25, 25, 25, 25, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:43,292 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1214647962, now seen corresponding path program 14 times [2018-02-04 16:15:43,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:43,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 684 proven. 44 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-04 16:15:43,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:43,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:15:43,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-02-04 16:15:43,473 INFO L182 omatonBuilderFactory]: Interpolants [4880#false, 4881#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 4882#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 4883#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 4884#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 4885#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 4886#(<= |foo_#in~size| 3), 4887#(<= main_~i~1 3), 4888#(<= main_~i~1 4), 4879#true] [2018-02-04 16:15:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 684 proven. 44 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2018-02-04 16:15:43,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:15:43,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:15:43,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:15:43,475 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand 10 states. [2018-02-04 16:15:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:43,605 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2018-02-04 16:15:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:15:43,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 277 [2018-02-04 16:15:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:43,607 INFO L225 Difference]: With dead ends: 251 [2018-02-04 16:15:43,608 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 16:15:43,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 16:15:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 174. [2018-02-04 16:15:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 16:15:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-04 16:15:43,614 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 277 [2018-02-04 16:15:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:43,614 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-04 16:15:43,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:15:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-04 16:15:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-02-04 16:15:43,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:43,615 INFO L351 BasicCegarLoop]: trace histogram [35, 26, 26, 26, 26, 26, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:43,615 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -923364178, now seen corresponding path program 15 times [2018-02-04 16:15:43,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:43,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2868 backedges. 307 proven. 419 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2018-02-04 16:15:43,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:43,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:15:43,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 37 proven. 112 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-02-04 16:15:43,750 INFO L182 omatonBuilderFactory]: Interpolants [5328#(<= 2 main_~i~1), 5329#(<= 3 main_~i~1), 5330#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 5331#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 5332#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 5333#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 5334#(<= |foo_#in~size| 2), 5324#true, 5325#false, 5326#(<= 0 main_~i~1), 5327#(<= 1 main_~i~1)] [2018-02-04 16:15:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2868 backedges. 307 proven. 419 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2018-02-04 16:15:43,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:15:43,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:15:43,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:43,751 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 11 states. [2018-02-04 16:15:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:43,917 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-02-04 16:15:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:15:43,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 283 [2018-02-04 16:15:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:43,918 INFO L225 Difference]: With dead ends: 192 [2018-02-04 16:15:43,918 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 16:15:43,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 16:15:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2018-02-04 16:15:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 16:15:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2018-02-04 16:15:43,922 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 283 [2018-02-04 16:15:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:43,923 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2018-02-04 16:15:43,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:15:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2018-02-04 16:15:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-04 16:15:43,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:43,924 INFO L351 BasicCegarLoop]: trace histogram [40, 31, 31, 31, 31, 31, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:43,924 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2059980374, now seen corresponding path program 16 times [2018-02-04 16:15:43,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:43,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 3564 trivial. 0 not checked. [2018-02-04 16:15:44,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:44,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:15:44,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-02-04 16:15:44,182 INFO L182 omatonBuilderFactory]: Interpolants [5712#(= main_~i~1 0), 5713#(<= main_~i~1 1), 5714#(<= main_~i~1 2), 5715#(<= main_~i~1 3), 5716#(<= main_~i~1 4), 5717#(<= main_~i~1 5), 5718#(<= main_~i~1 6), 5719#(<= main_~i~1 7), 5720#(<= main_~i~1 8), 5721#(<= main_~i~1 9), 5710#true, 5711#false] [2018-02-04 16:15:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 3564 trivial. 0 not checked. [2018-02-04 16:15:44,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:15:44,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:15:44,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:15:44,184 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 12 states. [2018-02-04 16:15:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:44,362 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2018-02-04 16:15:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:15:44,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2018-02-04 16:15:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:44,364 INFO L225 Difference]: With dead ends: 255 [2018-02-04 16:15:44,364 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 16:15:44,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:15:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 16:15:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 188. [2018-02-04 16:15:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 16:15:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-04 16:15:44,368 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 313 [2018-02-04 16:15:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:44,369 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-04 16:15:44,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:15:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-04 16:15:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-02-04 16:15:44,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:44,370 INFO L351 BasicCegarLoop]: trace histogram [45, 35, 35, 35, 35, 35, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:44,370 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1455300087, now seen corresponding path program 17 times [2018-02-04 16:15:44,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:44,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 866 proven. 191 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2018-02-04 16:15:44,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:44,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:15:44,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 179 proven. 26 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2018-02-04 16:15:44,556 INFO L182 omatonBuilderFactory]: Interpolants [6165#true, 6166#false, 6167#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6172#(<= |foo_#in~size| 3), 6173#(<= main_~i~1 3), 6174#(<= main_~i~1 4), 6175#(<= main_~i~1 5)] [2018-02-04 16:15:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 866 proven. 191 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2018-02-04 16:15:44,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:15:44,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:15:44,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:44,557 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 11 states. [2018-02-04 16:15:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:44,700 INFO L93 Difference]: Finished difference Result 315 states and 375 transitions. [2018-02-04 16:15:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:15:44,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 349 [2018-02-04 16:15:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:44,703 INFO L225 Difference]: With dead ends: 315 [2018-02-04 16:15:44,703 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 16:15:44,703 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-04 16:15:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 16:15:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 188. [2018-02-04 16:15:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 16:15:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2018-02-04 16:15:44,710 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 349 [2018-02-04 16:15:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:44,711 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2018-02-04 16:15:44,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:15:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2018-02-04 16:15:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-04 16:15:44,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:44,713 INFO L351 BasicCegarLoop]: trace histogram [46, 36, 36, 36, 36, 36, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:44,713 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1944406335, now seen corresponding path program 18 times [2018-02-04 16:15:44,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:44,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5060 backedges. 1165 proven. 70 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-02-04 16:15:44,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:44,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:15:44,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2018-02-04 16:15:44,984 INFO L182 omatonBuilderFactory]: Interpolants [6689#true, 6690#false, 6691#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 6692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 6693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 6694#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 6695#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 6696#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 6697#(<= |foo_#in~size| 4), 6698#(<= main_~i~1 4), 6699#(<= main_~i~1 5)] [2018-02-04 16:15:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5060 backedges. 1165 proven. 70 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-02-04 16:15:44,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:15:44,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:15:44,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:15:44,985 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 11 states. [2018-02-04 16:15:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:45,159 INFO L93 Difference]: Finished difference Result 279 states and 343 transitions. [2018-02-04 16:15:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:15:45,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 355 [2018-02-04 16:15:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:45,161 INFO L225 Difference]: With dead ends: 279 [2018-02-04 16:15:45,161 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 16:15:45,161 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-04 16:15:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 16:15:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 197. [2018-02-04 16:15:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 16:15:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2018-02-04 16:15:45,166 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 355 [2018-02-04 16:15:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:45,166 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2018-02-04 16:15:45,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:15:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2018-02-04 16:15:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-02-04 16:15:45,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:45,168 INFO L351 BasicCegarLoop]: trace histogram [47, 37, 37, 37, 37, 37, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:45,168 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash -162732601, now seen corresponding path program 19 times [2018-02-04 16:15:45,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:45,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5296 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-02-04 16:15:45,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:45,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:15:45,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-02-04 16:15:45,470 INFO L182 omatonBuilderFactory]: Interpolants [7200#(<= main_~i~1 10), 7188#true, 7189#false, 7190#(= main_~i~1 0), 7191#(<= main_~i~1 1), 7192#(<= main_~i~1 2), 7193#(<= main_~i~1 3), 7194#(<= main_~i~1 4), 7195#(<= main_~i~1 5), 7196#(<= main_~i~1 6), 7197#(<= main_~i~1 7), 7198#(<= main_~i~1 8), 7199#(<= main_~i~1 9)] [2018-02-04 16:15:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5296 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-02-04 16:15:45,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:15:45,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:15:45,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:45,471 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand 13 states. [2018-02-04 16:15:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:45,602 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2018-02-04 16:15:45,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:15:45,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 361 [2018-02-04 16:15:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:45,604 INFO L225 Difference]: With dead ends: 300 [2018-02-04 16:15:45,604 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 16:15:45,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 16:15:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 208. [2018-02-04 16:15:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 16:15:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-04 16:15:45,609 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 361 [2018-02-04 16:15:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:45,609 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-04 16:15:45,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:15:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-04 16:15:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 16:15:45,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:45,611 INFO L351 BasicCegarLoop]: trace histogram [52, 41, 41, 41, 41, 41, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:45,611 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1615990632, now seen corresponding path program 20 times [2018-02-04 16:15:45,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:45,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6504 backedges. 918 proven. 370 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2018-02-04 16:15:45,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:45,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:15:45,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 179 proven. 52 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-04 16:15:45,880 INFO L182 omatonBuilderFactory]: Interpolants [7712#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 7713#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 7714#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 7715#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 7716#(<= |foo_#in~size| 3), 7717#(<= main_~i~1 3), 7718#(<= main_~i~1 4), 7719#(<= main_~i~1 5), 7720#(<= main_~i~1 6), 7709#true, 7710#false, 7711#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 16:15:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6504 backedges. 918 proven. 370 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2018-02-04 16:15:45,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:15:45,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:15:45,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:15:45,881 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-04 16:15:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:46,065 INFO L93 Difference]: Finished difference Result 384 states and 495 transitions. [2018-02-04 16:15:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:15:46,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 397 [2018-02-04 16:15:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:46,069 INFO L225 Difference]: With dead ends: 384 [2018-02-04 16:15:46,069 INFO L226 Difference]: Without dead ends: 384 [2018-02-04 16:15:46,069 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-04 16:15:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-04 16:15:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 208. [2018-02-04 16:15:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 16:15:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-04 16:15:46,078 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 397 [2018-02-04 16:15:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:46,079 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-04 16:15:46,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:15:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-04 16:15:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-02-04 16:15:46,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:46,081 INFO L351 BasicCegarLoop]: trace histogram [53, 42, 42, 42, 42, 42, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:46,082 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -284521808, now seen corresponding path program 21 times [2018-02-04 16:15:46,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:46,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6772 backedges. 1223 proven. 281 refuted. 0 times theorem prover too weak. 5268 trivial. 0 not checked. [2018-02-04 16:15:46,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:46,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:15:46,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 199 proven. 32 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-04 16:15:46,429 INFO L182 omatonBuilderFactory]: Interpolants [8323#true, 8324#false, 8325#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8326#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8327#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8328#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8329#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8330#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 8331#(<= |foo_#in~size| 4), 8332#(<= main_~i~1 4), 8333#(<= main_~i~1 5), 8334#(<= main_~i~1 6)] [2018-02-04 16:15:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6772 backedges. 1223 proven. 281 refuted. 0 times theorem prover too weak. 5268 trivial. 0 not checked. [2018-02-04 16:15:46,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:15:46,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:15:46,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:15:46,430 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-04 16:15:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:46,605 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2018-02-04 16:15:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:15:46,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 403 [2018-02-04 16:15:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:46,607 INFO L225 Difference]: With dead ends: 349 [2018-02-04 16:15:46,607 INFO L226 Difference]: Without dead ends: 349 [2018-02-04 16:15:46,607 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-04 16:15:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-04 16:15:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 208. [2018-02-04 16:15:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 16:15:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2018-02-04 16:15:46,613 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 403 [2018-02-04 16:15:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:46,614 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2018-02-04 16:15:46,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:15:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2018-02-04 16:15:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-02-04 16:15:46,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:46,615 INFO L351 BasicCegarLoop]: trace histogram [54, 43, 43, 43, 43, 43, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:46,616 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 40105784, now seen corresponding path program 22 times [2018-02-04 16:15:46,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:46,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7046 backedges. 1618 proven. 102 refuted. 0 times theorem prover too weak. 5326 trivial. 0 not checked. [2018-02-04 16:15:46,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:46,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:15:46,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-02-04 16:15:46,885 INFO L182 omatonBuilderFactory]: Interpolants [8912#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 8913#(<= |foo_#in~size| 5), 8914#(<= main_~i~1 5), 8915#(<= main_~i~1 6), 8904#true, 8905#false, 8906#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 8907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 8908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 8909#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 8910#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 8911#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 16:15:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7046 backedges. 1618 proven. 102 refuted. 0 times theorem prover too weak. 5326 trivial. 0 not checked. [2018-02-04 16:15:46,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:15:46,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:15:46,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:15:46,887 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 12 states. [2018-02-04 16:15:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:47,057 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2018-02-04 16:15:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:15:47,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 409 [2018-02-04 16:15:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:47,059 INFO L225 Difference]: With dead ends: 307 [2018-02-04 16:15:47,059 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 16:15:47,060 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-04 16:15:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 16:15:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 217. [2018-02-04 16:15:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 16:15:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2018-02-04 16:15:47,069 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 409 [2018-02-04 16:15:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:47,069 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2018-02-04 16:15:47,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:15:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2018-02-04 16:15:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-02-04 16:15:47,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:47,073 INFO L351 BasicCegarLoop]: trace histogram [55, 44, 44, 44, 44, 44, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:47,074 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 944076032, now seen corresponding path program 23 times [2018-02-04 16:15:47,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:47,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 550 proven. 902 refuted. 0 times theorem prover too weak. 5874 trivial. 0 not checked. [2018-02-04 16:15:47,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:47,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:15:47,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 63 proven. 165 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-02-04 16:15:47,494 INFO L182 omatonBuilderFactory]: Interpolants [9454#true, 9455#false, 9456#(<= 0 main_~i~1), 9457#(<= 1 main_~i~1), 9458#(<= 2 main_~i~1), 9459#(<= 3 main_~i~1), 9460#(<= 4 main_~i~1), 9461#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 9462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 9463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 9464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 9465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 9466#(<= |foo_#in~size| 3)] [2018-02-04 16:15:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 550 proven. 902 refuted. 0 times theorem prover too weak. 5874 trivial. 0 not checked. [2018-02-04 16:15:47,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:15:47,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:15:47,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:47,496 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand 13 states. [2018-02-04 16:15:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:47,788 INFO L93 Difference]: Finished difference Result 237 states and 281 transitions. [2018-02-04 16:15:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:15:47,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 415 [2018-02-04 16:15:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:47,790 INFO L225 Difference]: With dead ends: 237 [2018-02-04 16:15:47,790 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 16:15:47,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:15:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 16:15:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2018-02-04 16:15:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 16:15:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2018-02-04 16:15:47,797 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 265 transitions. Word has length 415 [2018-02-04 16:15:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:47,798 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 265 transitions. [2018-02-04 16:15:47,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:15:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 265 transitions. [2018-02-04 16:15:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-02-04 16:15:47,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:47,801 INFO L351 BasicCegarLoop]: trace histogram [59, 48, 48, 48, 48, 48, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:47,801 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1208160864, now seen corresponding path program 24 times [2018-02-04 16:15:47,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:47,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8154 trivial. 0 not checked. [2018-02-04 16:15:48,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:48,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:15:48,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-02-04 16:15:48,181 INFO L182 omatonBuilderFactory]: Interpolants [9929#true, 9930#false, 9931#(= main_~i~1 0), 9932#(<= main_~i~1 1), 9933#(<= main_~i~1 2), 9934#(<= main_~i~1 3), 9935#(<= main_~i~1 4), 9936#(<= main_~i~1 5), 9937#(<= main_~i~1 6), 9938#(<= main_~i~1 7), 9939#(<= main_~i~1 8), 9940#(<= main_~i~1 9), 9941#(<= main_~i~1 10), 9942#(<= main_~i~1 11)] [2018-02-04 16:15:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8154 trivial. 0 not checked. [2018-02-04 16:15:48,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:15:48,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:15:48,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:48,182 INFO L87 Difference]: Start difference. First operand 217 states and 265 transitions. Second operand 14 states. [2018-02-04 16:15:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:48,288 INFO L93 Difference]: Finished difference Result 325 states and 378 transitions. [2018-02-04 16:15:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:15:48,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 439 [2018-02-04 16:15:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:48,291 INFO L225 Difference]: With dead ends: 325 [2018-02-04 16:15:48,291 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 16:15:48,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 16:15:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2018-02-04 16:15:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 16:15:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-04 16:15:48,297 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 439 [2018-02-04 16:15:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:48,298 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-04 16:15:48,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:15:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-04 16:15:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-02-04 16:15:48,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:48,301 INFO L351 BasicCegarLoop]: trace histogram [65, 53, 53, 53, 53, 53, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:48,301 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1519885879, now seen corresponding path program 25 times [2018-02-04 16:15:48,302 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:48,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10356 backedges. 1409 proven. 530 refuted. 0 times theorem prover too weak. 8417 trivial. 0 not checked. [2018-02-04 16:15:48,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:48,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:15:48,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 235 proven. 64 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-04 16:15:48,716 INFO L182 omatonBuilderFactory]: Interpolants [10496#true, 10497#false, 10498#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 10499#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 10500#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 10501#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 10502#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 10503#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 10504#(<= |foo_#in~size| 4), 10505#(<= main_~i~1 4), 10506#(<= main_~i~1 5), 10507#(<= main_~i~1 6), 10508#(<= main_~i~1 7)] [2018-02-04 16:15:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10356 backedges. 1409 proven. 530 refuted. 0 times theorem prover too weak. 8417 trivial. 0 not checked. [2018-02-04 16:15:48,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:15:48,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:15:48,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:48,717 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-04 16:15:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:48,851 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2018-02-04 16:15:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:15:48,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 481 [2018-02-04 16:15:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:48,853 INFO L225 Difference]: With dead ends: 424 [2018-02-04 16:15:48,853 INFO L226 Difference]: Without dead ends: 424 [2018-02-04 16:15:48,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:15:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-04 16:15:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 228. [2018-02-04 16:15:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 16:15:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-04 16:15:48,858 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 481 [2018-02-04 16:15:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:48,858 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-04 16:15:48,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:15:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-04 16:15:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-02-04 16:15:48,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:48,860 INFO L351 BasicCegarLoop]: trace histogram [66, 54, 54, 54, 54, 54, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:48,860 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1863901103, now seen corresponding path program 26 times [2018-02-04 16:15:48,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:48,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10698 backedges. 1834 proven. 389 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2018-02-04 16:15:49,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:49,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:15:49,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 261 proven. 38 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-04 16:15:49,276 INFO L182 omatonBuilderFactory]: Interpolants [11173#true, 11174#false, 11175#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11176#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11177#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11178#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11179#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11180#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11181#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11182#(<= |foo_#in~size| 5), 11183#(<= main_~i~1 5), 11184#(<= main_~i~1 6), 11185#(<= main_~i~1 7)] [2018-02-04 16:15:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10698 backedges. 1834 proven. 389 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2018-02-04 16:15:49,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:15:49,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:15:49,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:49,277 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-04 16:15:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:49,427 INFO L93 Difference]: Finished difference Result 383 states and 493 transitions. [2018-02-04 16:15:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:15:49,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 487 [2018-02-04 16:15:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:49,429 INFO L225 Difference]: With dead ends: 383 [2018-02-04 16:15:49,429 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 16:15:49,429 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-04 16:15:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 16:15:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 228. [2018-02-04 16:15:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 16:15:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2018-02-04 16:15:49,435 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 487 [2018-02-04 16:15:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:49,435 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2018-02-04 16:15:49,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:15:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2018-02-04 16:15:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-02-04 16:15:49,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:49,438 INFO L351 BasicCegarLoop]: trace histogram [67, 55, 55, 55, 55, 55, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:49,438 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 751206425, now seen corresponding path program 27 times [2018-02-04 16:15:49,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:49,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11046 backedges. 2367 proven. 140 refuted. 0 times theorem prover too weak. 8539 trivial. 0 not checked. [2018-02-04 16:15:49,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:49,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:15:49,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2018-02-04 16:15:49,724 INFO L182 omatonBuilderFactory]: Interpolants [11811#true, 11812#false, 11813#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 11814#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 11815#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 11816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 11817#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 11818#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 11819#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 11820#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 11821#(<= |foo_#in~size| 6), 11822#(<= main_~i~1 6), 11823#(<= main_~i~1 7)] [2018-02-04 16:15:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11046 backedges. 2367 proven. 140 refuted. 0 times theorem prover too weak. 8539 trivial. 0 not checked. [2018-02-04 16:15:49,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:15:49,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:15:49,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:15:49,725 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand 13 states. [2018-02-04 16:15:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:49,862 INFO L93 Difference]: Finished difference Result 335 states and 439 transitions. [2018-02-04 16:15:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:15:49,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 493 [2018-02-04 16:15:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:49,864 INFO L225 Difference]: With dead ends: 335 [2018-02-04 16:15:49,864 INFO L226 Difference]: Without dead ends: 335 [2018-02-04 16:15:49,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:15:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-04 16:15:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 237. [2018-02-04 16:15:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-04 16:15:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2018-02-04 16:15:49,868 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 493 [2018-02-04 16:15:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:49,869 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2018-02-04 16:15:49,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:15:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2018-02-04 16:15:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-04 16:15:49,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:49,871 INFO L351 BasicCegarLoop]: trace histogram [68, 56, 56, 56, 56, 56, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:49,871 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1593577761, now seen corresponding path program 28 times [2018-02-04 16:15:49,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:49,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 10980 trivial. 0 not checked. [2018-02-04 16:15:50,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:50,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:50,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2018-02-04 16:15:50,230 INFO L182 omatonBuilderFactory]: Interpolants [12416#(<= main_~i~1 2), 12417#(<= main_~i~1 3), 12418#(<= main_~i~1 4), 12419#(<= main_~i~1 5), 12420#(<= main_~i~1 6), 12421#(<= main_~i~1 7), 12422#(<= main_~i~1 8), 12423#(<= main_~i~1 9), 12424#(<= main_~i~1 10), 12425#(<= main_~i~1 11), 12426#(<= main_~i~1 12), 12412#true, 12413#false, 12414#(= main_~i~1 0), 12415#(<= main_~i~1 1)] [2018-02-04 16:15:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 10980 trivial. 0 not checked. [2018-02-04 16:15:50,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:50,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:50,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:50,231 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand 15 states. [2018-02-04 16:15:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:50,334 INFO L93 Difference]: Finished difference Result 376 states and 464 transitions. [2018-02-04 16:15:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:15:50,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 499 [2018-02-04 16:15:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:50,336 INFO L225 Difference]: With dead ends: 376 [2018-02-04 16:15:50,336 INFO L226 Difference]: Without dead ends: 376 [2018-02-04 16:15:50,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-04 16:15:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 248. [2018-02-04 16:15:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 16:15:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-04 16:15:50,341 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 499 [2018-02-04 16:15:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:50,341 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-04 16:15:50,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-04 16:15:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-02-04 16:15:50,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:50,343 INFO L351 BasicCegarLoop]: trace histogram [74, 61, 61, 61, 61, 61, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:50,343 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash 192428490, now seen corresponding path program 29 times [2018-02-04 16:15:50,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:50,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13528 backedges. 1467 proven. 817 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2018-02-04 16:15:50,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:50,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:15:50,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 235 proven. 96 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-04 16:15:50,677 INFO L182 omatonBuilderFactory]: Interpolants [13056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13059#(<= |foo_#in~size| 4), 13060#(<= main_~i~1 4), 13061#(<= main_~i~1 5), 13062#(<= main_~i~1 6), 13063#(<= main_~i~1 7), 13064#(<= main_~i~1 8), 13051#true, 13052#false, 13053#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:15:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13528 backedges. 1467 proven. 817 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2018-02-04 16:15:50,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:15:50,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:15:50,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:50,677 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-04 16:15:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:50,824 INFO L93 Difference]: Finished difference Result 503 states and 710 transitions. [2018-02-04 16:15:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:15:50,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 541 [2018-02-04 16:15:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:50,826 INFO L225 Difference]: With dead ends: 503 [2018-02-04 16:15:50,826 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 16:15:50,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:15:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 16:15:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 248. [2018-02-04 16:15:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 16:15:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-04 16:15:50,836 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 541 [2018-02-04 16:15:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:50,836 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-04 16:15:50,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:15:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-04 16:15:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-02-04 16:15:50,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:50,840 INFO L351 BasicCegarLoop]: trace histogram [75, 62, 62, 62, 62, 62, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:50,841 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:50,841 INFO L82 PathProgramCache]: Analyzing trace with hash -778879918, now seen corresponding path program 30 times [2018-02-04 16:15:50,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:50,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13920 backedges. 1898 proven. 720 refuted. 0 times theorem prover too weak. 11302 trivial. 0 not checked. [2018-02-04 16:15:51,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:51,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:15:51,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 261 proven. 76 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-04 16:15:51,298 INFO L182 omatonBuilderFactory]: Interpolants [13828#true, 13829#false, 13830#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 13831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 13832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 13833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 13834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 13835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 13836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 13837#(<= |foo_#in~size| 5), 13838#(<= main_~i~1 5), 13839#(<= main_~i~1 6), 13840#(<= main_~i~1 7), 13841#(<= main_~i~1 8)] [2018-02-04 16:15:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13920 backedges. 1898 proven. 720 refuted. 0 times theorem prover too weak. 11302 trivial. 0 not checked. [2018-02-04 16:15:51,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:15:51,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:15:51,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:51,299 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-04 16:15:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:51,494 INFO L93 Difference]: Finished difference Result 464 states and 648 transitions. [2018-02-04 16:15:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:15:51,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 547 [2018-02-04 16:15:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:51,497 INFO L225 Difference]: With dead ends: 464 [2018-02-04 16:15:51,498 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 16:15:51,498 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-04 16:15:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 16:15:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 248. [2018-02-04 16:15:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 16:15:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-04 16:15:51,507 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 547 [2018-02-04 16:15:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:51,508 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-04 16:15:51,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:15:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-04 16:15:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-02-04 16:15:51,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:51,512 INFO L351 BasicCegarLoop]: trace histogram [76, 63, 63, 63, 63, 63, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:51,512 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 258441242, now seen corresponding path program 31 times [2018-02-04 16:15:51,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:51,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 2437 proven. 515 refuted. 0 times theorem prover too weak. 11366 trivial. 0 not checked. [2018-02-04 16:15:51,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:51,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:15:51,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 305 proven. 44 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-04 16:15:51,904 INFO L182 omatonBuilderFactory]: Interpolants [14568#true, 14569#false, 14570#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 14571#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 14572#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 14573#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 14574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 14575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 14576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 14577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 14578#(<= |foo_#in~size| 6), 14579#(<= main_~i~1 6), 14580#(<= main_~i~1 7), 14581#(<= main_~i~1 8)] [2018-02-04 16:15:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 2437 proven. 515 refuted. 0 times theorem prover too weak. 11366 trivial. 0 not checked. [2018-02-04 16:15:51,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:15:51,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:15:51,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:51,904 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-04 16:15:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:52,035 INFO L93 Difference]: Finished difference Result 417 states and 570 transitions. [2018-02-04 16:15:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:15:52,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 553 [2018-02-04 16:15:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:52,037 INFO L225 Difference]: With dead ends: 417 [2018-02-04 16:15:52,037 INFO L226 Difference]: Without dead ends: 417 [2018-02-04 16:15:52,037 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-04 16:15:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-04 16:15:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 248. [2018-02-04 16:15:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 16:15:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2018-02-04 16:15:52,041 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 553 [2018-02-04 16:15:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:52,041 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2018-02-04 16:15:52,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:15:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2018-02-04 16:15:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-02-04 16:15:52,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:52,044 INFO L351 BasicCegarLoop]: trace histogram [77, 64, 64, 64, 64, 64, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:52,044 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:52,044 INFO L82 PathProgramCache]: Analyzing trace with hash -273509086, now seen corresponding path program 32 times [2018-02-04 16:15:52,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:52,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14722 backedges. 3102 proven. 184 refuted. 0 times theorem prover too weak. 11436 trivial. 0 not checked. [2018-02-04 16:15:52,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:52,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:15:52,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2018-02-04 16:15:52,432 INFO L182 omatonBuilderFactory]: Interpolants [15264#false, 15265#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15266#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15267#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15268#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15269#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15270#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15271#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 15272#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 15273#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 15274#(<= |foo_#in~size| 7), 15275#(<= main_~i~1 7), 15276#(<= main_~i~1 8), 15263#true] [2018-02-04 16:15:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14722 backedges. 3102 proven. 184 refuted. 0 times theorem prover too weak. 11436 trivial. 0 not checked. [2018-02-04 16:15:52,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:15:52,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:15:52,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:15:52,432 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 14 states. [2018-02-04 16:15:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:52,584 INFO L93 Difference]: Finished difference Result 363 states and 499 transitions. [2018-02-04 16:15:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:15:52,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 559 [2018-02-04 16:15:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:52,586 INFO L225 Difference]: With dead ends: 363 [2018-02-04 16:15:52,586 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 16:15:52,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:15:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 16:15:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 257. [2018-02-04 16:15:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-04 16:15:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 337 transitions. [2018-02-04 16:15:52,591 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 337 transitions. Word has length 559 [2018-02-04 16:15:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:52,591 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 337 transitions. [2018-02-04 16:15:52,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:15:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 337 transitions. [2018-02-04 16:15:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-02-04 16:15:52,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:52,594 INFO L351 BasicCegarLoop]: trace histogram [78, 65, 65, 65, 65, 65, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:52,594 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2327702, now seen corresponding path program 33 times [2018-02-04 16:15:52,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:52,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15132 backedges. 895 proven. 1615 refuted. 0 times theorem prover too weak. 12622 trivial. 0 not checked. [2018-02-04 16:15:53,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:53,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:53,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 95 proven. 233 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 16:15:53,034 INFO L182 omatonBuilderFactory]: Interpolants [15915#true, 15916#false, 15917#(<= 0 main_~i~1), 15918#(<= 1 main_~i~1), 15919#(<= 2 main_~i~1), 15920#(<= 3 main_~i~1), 15921#(<= 4 main_~i~1), 15922#(<= 5 main_~i~1), 15923#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 15924#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 15925#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 15926#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 15927#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 15928#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 15929#(<= |foo_#in~size| 4)] [2018-02-04 16:15:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15132 backedges. 895 proven. 1615 refuted. 0 times theorem prover too weak. 12622 trivial. 0 not checked. [2018-02-04 16:15:53,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:53,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:53,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:53,035 INFO L87 Difference]: Start difference. First operand 257 states and 337 transitions. Second operand 15 states. [2018-02-04 16:15:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:53,267 INFO L93 Difference]: Finished difference Result 282 states and 349 transitions. [2018-02-04 16:15:53,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:15:53,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 565 [2018-02-04 16:15:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:53,269 INFO L225 Difference]: With dead ends: 282 [2018-02-04 16:15:53,269 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 16:15:53,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:15:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 16:15:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 257. [2018-02-04 16:15:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-04 16:15:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. [2018-02-04 16:15:53,272 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 565 [2018-02-04 16:15:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:53,273 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 329 transitions. [2018-02-04 16:15:53,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 329 transitions. [2018-02-04 16:15:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-02-04 16:15:53,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:53,277 INFO L351 BasicCegarLoop]: trace histogram [82, 69, 69, 69, 69, 69, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:53,277 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 912832778, now seen corresponding path program 34 times [2018-02-04 16:15:53,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:53,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16832 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 16338 trivial. 0 not checked. [2018-02-04 16:15:53,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:53,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:15:53,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2018-02-04 16:15:53,748 INFO L182 omatonBuilderFactory]: Interpolants [16480#false, 16481#(= main_~i~1 0), 16482#(<= main_~i~1 1), 16483#(<= main_~i~1 2), 16484#(<= main_~i~1 3), 16485#(<= main_~i~1 4), 16486#(<= main_~i~1 5), 16487#(<= main_~i~1 6), 16488#(<= main_~i~1 7), 16489#(<= main_~i~1 8), 16490#(<= main_~i~1 9), 16491#(<= main_~i~1 10), 16492#(<= main_~i~1 11), 16493#(<= main_~i~1 12), 16494#(<= main_~i~1 13), 16479#true] [2018-02-04 16:15:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16832 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 16338 trivial. 0 not checked. [2018-02-04 16:15:53,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:15:53,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:15:53,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:53,749 INFO L87 Difference]: Start difference. First operand 257 states and 329 transitions. Second operand 16 states. [2018-02-04 16:15:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:53,876 INFO L93 Difference]: Finished difference Result 401 states and 497 transitions. [2018-02-04 16:15:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:15:53,877 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 589 [2018-02-04 16:15:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:53,878 INFO L225 Difference]: With dead ends: 401 [2018-02-04 16:15:53,878 INFO L226 Difference]: Without dead ends: 401 [2018-02-04 16:15:53,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-04 16:15:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 268. [2018-02-04 16:15:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 16:15:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-04 16:15:53,882 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 589 [2018-02-04 16:15:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:53,882 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-04 16:15:53,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:15:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-04 16:15:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-02-04 16:15:53,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:53,885 INFO L351 BasicCegarLoop]: trace histogram [89, 75, 75, 75, 75, 75, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:53,885 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1858343931, now seen corresponding path program 35 times [2018-02-04 16:15:53,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:53,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19870 backedges. 2114 proven. 1095 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-02-04 16:15:54,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:54,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:54,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 297 proven. 114 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-04 16:15:54,277 INFO L182 omatonBuilderFactory]: Interpolants [17164#true, 17165#false, 17166#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 17167#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 17168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 17169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 17170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 17171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 17172#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 17173#(<= |foo_#in~size| 5), 17174#(<= main_~i~1 5), 17175#(<= main_~i~1 6), 17176#(<= main_~i~1 7), 17177#(<= main_~i~1 8), 17178#(<= main_~i~1 9)] [2018-02-04 16:15:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19870 backedges. 2114 proven. 1095 refuted. 0 times theorem prover too weak. 16661 trivial. 0 not checked. [2018-02-04 16:15:54,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:54,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:54,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:54,278 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-04 16:15:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:54,468 INFO L93 Difference]: Finished difference Result 549 states and 787 transitions. [2018-02-04 16:15:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:15:54,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 637 [2018-02-04 16:15:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:54,506 INFO L225 Difference]: With dead ends: 549 [2018-02-04 16:15:54,506 INFO L226 Difference]: Without dead ends: 549 [2018-02-04 16:15:54,506 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-04 16:15:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-04 16:15:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 268. [2018-02-04 16:15:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 16:15:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-04 16:15:54,511 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 637 [2018-02-04 16:15:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:54,512 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-04 16:15:54,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-04 16:15:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-02-04 16:15:54,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:54,516 INFO L351 BasicCegarLoop]: trace histogram [90, 76, 76, 76, 76, 76, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:54,516 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1904767549, now seen corresponding path program 36 times [2018-02-04 16:15:54,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:54,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20348 backedges. 2683 proven. 940 refuted. 0 times theorem prover too weak. 16725 trivial. 0 not checked. [2018-02-04 16:15:54,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:54,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:54,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2457 backedges. 329 proven. 88 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-04 16:15:54,996 INFO L182 omatonBuilderFactory]: Interpolants [18016#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18017#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18018#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 18019#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 18020#(<= |foo_#in~size| 6), 18021#(<= main_~i~1 6), 18022#(<= main_~i~1 7), 18023#(<= main_~i~1 8), 18024#(<= main_~i~1 9), 18010#true, 18011#false, 18012#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 18013#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18014#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18015#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 16:15:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 20348 backedges. 2683 proven. 940 refuted. 0 times theorem prover too weak. 16725 trivial. 0 not checked. [2018-02-04 16:15:54,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:54,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:54,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:54,997 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-04 16:15:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:55,163 INFO L93 Difference]: Finished difference Result 504 states and 715 transitions. [2018-02-04 16:15:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:15:55,163 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 643 [2018-02-04 16:15:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:55,166 INFO L225 Difference]: With dead ends: 504 [2018-02-04 16:15:55,166 INFO L226 Difference]: Without dead ends: 504 [2018-02-04 16:15:55,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:15:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-04 16:15:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 268. [2018-02-04 16:15:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 16:15:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-04 16:15:55,173 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 643 [2018-02-04 16:15:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:55,173 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-04 16:15:55,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-04 16:15:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-02-04 16:15:55,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:55,176 INFO L351 BasicCegarLoop]: trace histogram [91, 77, 77, 77, 77, 77, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:55,176 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1208842037, now seen corresponding path program 37 times [2018-02-04 16:15:55,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:55,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20832 backedges. 3378 proven. 659 refuted. 0 times theorem prover too weak. 16795 trivial. 0 not checked. [2018-02-04 16:15:55,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:55,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:55,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 379 proven. 50 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-04 16:15:55,657 INFO L182 omatonBuilderFactory]: Interpolants [18816#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 18817#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 18818#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 18819#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 18820#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 18821#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 18822#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 18823#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 18824#(<= |foo_#in~size| 7), 18825#(<= main_~i~1 7), 18826#(<= main_~i~1 8), 18827#(<= main_~i~1 9), 18813#true, 18814#false, 18815#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 16:15:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20832 backedges. 3378 proven. 659 refuted. 0 times theorem prover too weak. 16795 trivial. 0 not checked. [2018-02-04 16:15:55,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:55,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:55,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:55,658 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-04 16:15:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:55,817 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2018-02-04 16:15:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:15:55,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 649 [2018-02-04 16:15:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:55,819 INFO L225 Difference]: With dead ends: 451 [2018-02-04 16:15:55,819 INFO L226 Difference]: Without dead ends: 451 [2018-02-04 16:15:55,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:15:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-04 16:15:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 268. [2018-02-04 16:15:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 16:15:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2018-02-04 16:15:55,825 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 649 [2018-02-04 16:15:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:55,826 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2018-02-04 16:15:55,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2018-02-04 16:15:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-02-04 16:15:55,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:55,830 INFO L351 BasicCegarLoop]: trace histogram [92, 78, 78, 78, 78, 78, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:55,830 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2028141293, now seen corresponding path program 38 times [2018-02-04 16:15:55,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:55,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21322 backedges. 4217 proven. 234 refuted. 0 times theorem prover too weak. 16871 trivial. 0 not checked. [2018-02-04 16:15:56,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:56,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:15:56,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-02-04 16:15:56,286 INFO L182 omatonBuilderFactory]: Interpolants [19565#true, 19566#false, 19567#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 19568#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 19569#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 19570#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 19571#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 19572#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 19573#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 19574#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 19575#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 19576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 19577#(<= |foo_#in~size| 8), 19578#(<= main_~i~1 8), 19579#(<= main_~i~1 9)] [2018-02-04 16:15:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21322 backedges. 4217 proven. 234 refuted. 0 times theorem prover too weak. 16871 trivial. 0 not checked. [2018-02-04 16:15:56,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:15:56,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:15:56,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:15:56,287 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand 15 states. [2018-02-04 16:15:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:56,445 INFO L93 Difference]: Finished difference Result 391 states and 545 transitions. [2018-02-04 16:15:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:15:56,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 655 [2018-02-04 16:15:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:56,446 INFO L225 Difference]: With dead ends: 391 [2018-02-04 16:15:56,446 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 16:15:56,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:15:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 16:15:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 277. [2018-02-04 16:15:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 16:15:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 367 transitions. [2018-02-04 16:15:56,450 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 367 transitions. Word has length 655 [2018-02-04 16:15:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:56,450 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 367 transitions. [2018-02-04 16:15:56,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:15:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 367 transitions. [2018-02-04 16:15:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-02-04 16:15:56,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:56,453 INFO L351 BasicCegarLoop]: trace histogram [93, 79, 79, 79, 79, 79, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:56,453 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2143980901, now seen corresponding path program 39 times [2018-02-04 16:15:56,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:56,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21818 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 21244 trivial. 0 not checked. [2018-02-04 16:15:56,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:56,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:15:56,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2018-02-04 16:15:56,908 INFO L182 omatonBuilderFactory]: Interpolants [20268#true, 20269#false, 20270#(= main_~i~1 0), 20271#(<= main_~i~1 1), 20272#(<= main_~i~1 2), 20273#(<= main_~i~1 3), 20274#(<= main_~i~1 4), 20275#(<= main_~i~1 5), 20276#(<= main_~i~1 6), 20277#(<= main_~i~1 7), 20278#(<= main_~i~1 8), 20279#(<= main_~i~1 9), 20280#(<= main_~i~1 10), 20281#(<= main_~i~1 11), 20282#(<= main_~i~1 12), 20283#(<= main_~i~1 13), 20284#(<= main_~i~1 14)] [2018-02-04 16:15:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21818 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 21244 trivial. 0 not checked. [2018-02-04 16:15:56,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:15:56,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:15:56,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:15:56,909 INFO L87 Difference]: Start difference. First operand 277 states and 367 transitions. Second operand 17 states. [2018-02-04 16:15:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:57,030 INFO L93 Difference]: Finished difference Result 458 states and 605 transitions. [2018-02-04 16:15:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:15:57,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 661 [2018-02-04 16:15:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:57,032 INFO L225 Difference]: With dead ends: 458 [2018-02-04 16:15:57,032 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 16:15:57,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:15:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 16:15:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 288. [2018-02-04 16:15:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 16:15:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-04 16:15:57,037 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 661 [2018-02-04 16:15:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:57,037 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-04 16:15:57,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:15:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-04 16:15:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-02-04 16:15:57,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:57,040 INFO L351 BasicCegarLoop]: trace histogram [100, 85, 85, 85, 85, 85, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:57,040 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1727743116, now seen corresponding path program 40 times [2018-02-04 16:15:57,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:57,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25260 backedges. 2178 proven. 1514 refuted. 0 times theorem prover too weak. 21568 trivial. 0 not checked. [2018-02-04 16:15:57,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:57,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:15:57,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 297 proven. 152 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-04 16:15:57,577 INFO L182 omatonBuilderFactory]: Interpolants [21031#true, 21032#false, 21033#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21034#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21035#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21036#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21037#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21038#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21039#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21040#(<= |foo_#in~size| 5), 21041#(<= main_~i~1 5), 21042#(<= main_~i~1 6), 21043#(<= main_~i~1 7), 21044#(<= main_~i~1 8), 21045#(<= main_~i~1 9), 21046#(<= main_~i~1 10)] [2018-02-04 16:15:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25260 backedges. 2178 proven. 1514 refuted. 0 times theorem prover too weak. 21568 trivial. 0 not checked. [2018-02-04 16:15:57,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:15:57,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:15:57,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:57,578 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-04 16:15:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:57,743 INFO L93 Difference]: Finished difference Result 634 states and 979 transitions. [2018-02-04 16:15:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:15:57,743 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 709 [2018-02-04 16:15:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:57,746 INFO L225 Difference]: With dead ends: 634 [2018-02-04 16:15:57,746 INFO L226 Difference]: Without dead ends: 634 [2018-02-04 16:15:57,747 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-04 16:15:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-04 16:15:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 288. [2018-02-04 16:15:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 16:15:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-04 16:15:57,753 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 709 [2018-02-04 16:15:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:57,754 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-04 16:15:57,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:15:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-04 16:15:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-02-04 16:15:57,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:57,757 INFO L351 BasicCegarLoop]: trace histogram [101, 86, 86, 86, 86, 86, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:57,757 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 757741140, now seen corresponding path program 41 times [2018-02-04 16:15:57,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:57,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25800 backedges. 2753 proven. 1415 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-02-04 16:15:58,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:58,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:15:58,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2946 backedges. 329 proven. 132 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-04 16:15:58,293 INFO L182 omatonBuilderFactory]: Interpolants [21984#false, 21985#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 21986#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 21987#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 21988#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 21989#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 21990#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 21991#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 21992#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 21993#(<= |foo_#in~size| 6), 21994#(<= main_~i~1 6), 21995#(<= main_~i~1 7), 21996#(<= main_~i~1 8), 21997#(<= main_~i~1 9), 21998#(<= main_~i~1 10), 21983#true] [2018-02-04 16:15:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 25800 backedges. 2753 proven. 1415 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2018-02-04 16:15:58,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:15:58,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:15:58,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:58,293 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-04 16:15:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:58,499 INFO L93 Difference]: Finished difference Result 595 states and 911 transitions. [2018-02-04 16:15:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:15:58,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 715 [2018-02-04 16:15:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:58,502 INFO L225 Difference]: With dead ends: 595 [2018-02-04 16:15:58,502 INFO L226 Difference]: Without dead ends: 595 [2018-02-04 16:15:58,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:15:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-04 16:15:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 288. [2018-02-04 16:15:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 16:15:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-04 16:15:58,508 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 715 [2018-02-04 16:15:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:58,509 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-04 16:15:58,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:15:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-04 16:15:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-02-04 16:15:58,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:58,512 INFO L351 BasicCegarLoop]: trace histogram [102, 87, 87, 87, 87, 87, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:58,512 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1350658396, now seen corresponding path program 42 times [2018-02-04 16:15:58,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:58,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26346 backedges. 3454 proven. 1190 refuted. 0 times theorem prover too weak. 21702 trivial. 0 not checked. [2018-02-04 16:15:59,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:59,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:15:59,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 379 proven. 100 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-04 16:15:59,064 INFO L182 omatonBuilderFactory]: Interpolants [22912#(<= main_~i~1 9), 22913#(<= main_~i~1 10), 22898#true, 22899#false, 22900#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 22901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 22902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 22903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 22904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 22905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 22906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 22907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 22908#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 22909#(<= |foo_#in~size| 7), 22910#(<= main_~i~1 7), 22911#(<= main_~i~1 8)] [2018-02-04 16:15:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26346 backedges. 3454 proven. 1190 refuted. 0 times theorem prover too weak. 21702 trivial. 0 not checked. [2018-02-04 16:15:59,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:15:59,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:15:59,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:59,066 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-04 16:15:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:59,258 INFO L93 Difference]: Finished difference Result 544 states and 821 transitions. [2018-02-04 16:15:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:15:59,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 721 [2018-02-04 16:15:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:59,261 INFO L225 Difference]: With dead ends: 544 [2018-02-04 16:15:59,261 INFO L226 Difference]: Without dead ends: 544 [2018-02-04 16:15:59,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:15:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-02-04 16:15:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 288. [2018-02-04 16:15:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 16:15:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-04 16:15:59,268 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 721 [2018-02-04 16:15:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:59,268 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-04 16:15:59,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:15:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-04 16:15:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-02-04 16:15:59,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:59,273 INFO L351 BasicCegarLoop]: trace histogram [103, 88, 88, 88, 88, 88, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:59,273 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash -991371868, now seen corresponding path program 43 times [2018-02-04 16:15:59,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:15:59,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:15:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26898 backedges. 4299 proven. 821 refuted. 0 times theorem prover too weak. 21778 trivial. 0 not checked. [2018-02-04 16:15:59,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:15:59,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:15:59,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:15:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2976 backedges. 435 proven. 56 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-04 16:15:59,798 INFO L182 omatonBuilderFactory]: Interpolants [23776#(<= |foo_#in~size| 8), 23777#(<= main_~i~1 8), 23778#(<= main_~i~1 9), 23779#(<= main_~i~1 10), 23764#true, 23765#false, 23766#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 23767#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 23768#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 23769#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 23770#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 23771#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 23772#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 23773#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 23774#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 23775#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-04 16:15:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26898 backedges. 4299 proven. 821 refuted. 0 times theorem prover too weak. 21778 trivial. 0 not checked. [2018-02-04 16:15:59,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:15:59,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:15:59,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:15:59,798 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-04 16:15:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:15:59,966 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2018-02-04 16:15:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:15:59,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 727 [2018-02-04 16:15:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:15:59,968 INFO L225 Difference]: With dead ends: 485 [2018-02-04 16:15:59,968 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 16:15:59,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:15:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 16:15:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 288. [2018-02-04 16:15:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 16:15:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-02-04 16:15:59,973 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 727 [2018-02-04 16:15:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:15:59,973 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-02-04 16:15:59,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:15:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-02-04 16:15:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-02-04 16:15:59,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:15:59,976 INFO L351 BasicCegarLoop]: trace histogram [104, 89, 89, 89, 89, 89, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:15:59,976 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:15:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 900662060, now seen corresponding path program 44 times [2018-02-04 16:15:59,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:15:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:00,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27456 backedges. 5306 proven. 290 refuted. 0 times theorem prover too weak. 21860 trivial. 0 not checked. [2018-02-04 16:16:00,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:00,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 16:16:00,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2982 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-02-04 16:16:00,513 INFO L182 omatonBuilderFactory]: Interpolants [24576#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 24577#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 24578#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 24579#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 24580#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 24581#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 24582#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 24583#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 24584#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 24585#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 24586#(<= |foo_#in~size| 9), 24587#(<= main_~i~1 9), 24588#(<= main_~i~1 10), 24573#true, 24574#false, 24575#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 16:16:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27456 backedges. 5306 proven. 290 refuted. 0 times theorem prover too weak. 21860 trivial. 0 not checked. [2018-02-04 16:16:00,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:16:00,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:16:00,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:16:00,514 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 16 states. [2018-02-04 16:16:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:00,697 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2018-02-04 16:16:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:16:00,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 733 [2018-02-04 16:16:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:00,699 INFO L225 Difference]: With dead ends: 419 [2018-02-04 16:16:00,699 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 16:16:00,699 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-04 16:16:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 16:16:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 297. [2018-02-04 16:16:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 16:16:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 407 transitions. [2018-02-04 16:16:00,704 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 407 transitions. Word has length 733 [2018-02-04 16:16:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:00,704 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 407 transitions. [2018-02-04 16:16:00,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:16:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 407 transitions. [2018-02-04 16:16:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-02-04 16:16:00,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:00,707 INFO L351 BasicCegarLoop]: trace histogram [105, 90, 90, 90, 90, 90, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:00,708 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash -682837516, now seen corresponding path program 45 times [2018-02-04 16:16:00,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:00,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28020 backedges. 1360 proven. 2632 refuted. 0 times theorem prover too weak. 24028 trivial. 0 not checked. [2018-02-04 16:16:01,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:01,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:16:01,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:01,273 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-04 16:16:01,273 INFO L182 omatonBuilderFactory]: Interpolants [25327#true, 25328#false, 25329#(<= 0 main_~i~1), 25330#(<= 1 main_~i~1), 25331#(<= 2 main_~i~1), 25332#(<= 3 main_~i~1), 25333#(<= 4 main_~i~1), 25334#(<= 5 main_~i~1), 25335#(<= 6 main_~i~1), 25336#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 25337#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 25338#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 25339#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 25340#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 25341#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 25342#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 25343#(<= |foo_#in~size| 5)] [2018-02-04 16:16:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28020 backedges. 1360 proven. 2632 refuted. 0 times theorem prover too weak. 24028 trivial. 0 not checked. [2018-02-04 16:16:01,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:16:01,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:16:01,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:16:01,274 INFO L87 Difference]: Start difference. First operand 297 states and 407 transitions. Second operand 17 states. [2018-02-04 16:16:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:01,652 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2018-02-04 16:16:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:16:01,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 739 [2018-02-04 16:16:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:01,654 INFO L225 Difference]: With dead ends: 327 [2018-02-04 16:16:01,654 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 16:16:01,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:16:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 16:16:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 297. [2018-02-04 16:16:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-04 16:16:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 398 transitions. [2018-02-04 16:16:01,659 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 398 transitions. Word has length 739 [2018-02-04 16:16:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:01,660 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 398 transitions. [2018-02-04 16:16:01,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:16:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 398 transitions. [2018-02-04 16:16:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-02-04 16:16:01,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:01,666 INFO L351 BasicCegarLoop]: trace histogram [109, 94, 94, 94, 94, 94, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:01,666 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash 115276948, now seen corresponding path program 46 times [2018-02-04 16:16:01,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:01,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30336 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 29676 trivial. 0 not checked. [2018-02-04 16:16:02,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:02,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:16:02,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:02,280 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-04 16:16:02,280 INFO L182 omatonBuilderFactory]: Interpolants [25984#(<= main_~i~1 2), 25985#(<= main_~i~1 3), 25986#(<= main_~i~1 4), 25987#(<= main_~i~1 5), 25988#(<= main_~i~1 6), 25989#(<= main_~i~1 7), 25990#(<= main_~i~1 8), 25991#(<= main_~i~1 9), 25992#(<= main_~i~1 10), 25993#(<= main_~i~1 11), 25994#(<= main_~i~1 12), 25995#(<= main_~i~1 13), 25996#(<= main_~i~1 14), 25997#(<= main_~i~1 15), 25980#true, 25981#false, 25982#(= main_~i~1 0), 25983#(<= main_~i~1 1)] [2018-02-04 16:16:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30336 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 29676 trivial. 0 not checked. [2018-02-04 16:16:02,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:16:02,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:16:02,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:02,280 INFO L87 Difference]: Start difference. First operand 297 states and 398 transitions. Second operand 18 states. [2018-02-04 16:16:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:02,433 INFO L93 Difference]: Finished difference Result 483 states and 640 transitions. [2018-02-04 16:16:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:16:02,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 763 [2018-02-04 16:16:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:02,435 INFO L225 Difference]: With dead ends: 483 [2018-02-04 16:16:02,435 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 16:16:02,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 16:16:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 308. [2018-02-04 16:16:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 16:16:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 415 transitions. [2018-02-04 16:16:02,439 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 415 transitions. Word has length 763 [2018-02-04 16:16:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:02,439 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 415 transitions. [2018-02-04 16:16:02,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:16:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 415 transitions. [2018-02-04 16:16:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-02-04 16:16:02,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:02,443 INFO L351 BasicCegarLoop]: trace histogram [117, 101, 101, 101, 101, 101, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:02,443 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:02,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1696216947, now seen corresponding path program 47 times [2018-02-04 16:16:02,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:02,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35004 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 34252 trivial. 0 not checked. [2018-02-04 16:16:03,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:03,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:03,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:03,175 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-04 16:16:03,175 INFO L182 omatonBuilderFactory]: Interpolants [26789#true, 26790#false, 26791#(= main_~i~1 0), 26792#(<= main_~i~1 1), 26793#(<= main_~i~1 2), 26794#(<= main_~i~1 3), 26795#(<= main_~i~1 4), 26796#(<= main_~i~1 5), 26797#(<= main_~i~1 6), 26798#(<= main_~i~1 7), 26799#(<= main_~i~1 8), 26800#(<= main_~i~1 9), 26801#(<= main_~i~1 10), 26802#(<= main_~i~1 11), 26803#(<= main_~i~1 12), 26804#(<= main_~i~1 13), 26805#(<= main_~i~1 14), 26806#(<= main_~i~1 15), 26807#(<= main_~i~1 16)] [2018-02-04 16:16:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35004 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 34252 trivial. 0 not checked. [2018-02-04 16:16:03,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:03,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:03,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:03,176 INFO L87 Difference]: Start difference. First operand 308 states and 415 transitions. Second operand 19 states. [2018-02-04 16:16:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:03,327 INFO L93 Difference]: Finished difference Result 499 states and 661 transitions. [2018-02-04 16:16:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:16:03,328 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 817 [2018-02-04 16:16:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:03,329 INFO L225 Difference]: With dead ends: 499 [2018-02-04 16:16:03,329 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 16:16:03,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 16:16:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 319. [2018-02-04 16:16:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-04 16:16:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 432 transitions. [2018-02-04 16:16:03,335 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 432 transitions. Word has length 817 [2018-02-04 16:16:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:03,335 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 432 transitions. [2018-02-04 16:16:03,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 432 transitions. [2018-02-04 16:16:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-02-04 16:16:03,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:03,342 INFO L351 BasicCegarLoop]: trace histogram [125, 108, 108, 108, 108, 108, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:03,342 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1091387334, now seen corresponding path program 48 times [2018-02-04 16:16:03,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:03,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40006 backedges. 7094 proven. 352 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-04 16:16:04,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:04,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:16:04,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 16:16:04,118 INFO L182 omatonBuilderFactory]: Interpolants [27626#true, 27627#false, 27628#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 27629#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 27630#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 27631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 27632#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 27633#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 27634#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 27635#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 27636#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 27637#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 27638#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 27639#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 27640#(<= |foo_#in~size| 10), 27641#(<= main_~i~1 10), 27642#(<= main_~i~1 11)] [2018-02-04 16:16:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40006 backedges. 7094 proven. 352 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-04 16:16:04,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:16:04,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:16:04,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:16:04,119 INFO L87 Difference]: Start difference. First operand 319 states and 432 transitions. Second operand 17 states. [2018-02-04 16:16:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:04,359 INFO L93 Difference]: Finished difference Result 466 states and 693 transitions. [2018-02-04 16:16:04,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:16:04,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 871 [2018-02-04 16:16:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:04,361 INFO L225 Difference]: With dead ends: 466 [2018-02-04 16:16:04,362 INFO L226 Difference]: Without dead ends: 466 [2018-02-04 16:16:04,362 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-04 16:16:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-02-04 16:16:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 325. [2018-02-04 16:16:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 16:16:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2018-02-04 16:16:04,367 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 871 [2018-02-04 16:16:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:04,367 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2018-02-04 16:16:04,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:16:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2018-02-04 16:16:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-02-04 16:16:04,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:04,372 INFO L351 BasicCegarLoop]: trace histogram [126, 109, 109, 109, 109, 109, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:04,372 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 747477774, now seen corresponding path program 49 times [2018-02-04 16:16:04,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:04,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40688 backedges. 7708 proven. 420 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-04 16:16:05,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:05,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:16:05,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-02-04 16:16:05,208 INFO L182 omatonBuilderFactory]: Interpolants [28458#true, 28459#false, 28460#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 28461#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 28462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 28463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 28464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 28465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 28466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 28467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 28468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 28469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 28470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 28471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 28472#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 28473#(<= |foo_#in~size| 11), 28474#(<= main_~i~1 11), 28475#(<= main_~i~1 12)] [2018-02-04 16:16:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 40688 backedges. 7708 proven. 420 refuted. 0 times theorem prover too weak. 32560 trivial. 0 not checked. [2018-02-04 16:16:05,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:16:05,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:16:05,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:05,209 INFO L87 Difference]: Start difference. First operand 325 states and 439 transitions. Second operand 18 states. [2018-02-04 16:16:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:05,429 INFO L93 Difference]: Finished difference Result 475 states and 733 transitions. [2018-02-04 16:16:05,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:16:05,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 877 [2018-02-04 16:16:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:05,431 INFO L225 Difference]: With dead ends: 475 [2018-02-04 16:16:05,431 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 16:16:05,432 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-04 16:16:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 16:16:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 331. [2018-02-04 16:16:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 16:16:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2018-02-04 16:16:05,437 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 877 [2018-02-04 16:16:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:05,437 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2018-02-04 16:16:05,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:16:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2018-02-04 16:16:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-02-04 16:16:05,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:05,442 INFO L351 BasicCegarLoop]: trace histogram [127, 110, 110, 110, 110, 110, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:05,442 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:05,442 INFO L82 PathProgramCache]: Analyzing trace with hash 803102806, now seen corresponding path program 50 times [2018-02-04 16:16:05,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:05,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 41376 backedges. 1963 proven. 3611 refuted. 0 times theorem prover too weak. 35802 trivial. 0 not checked. [2018-02-04 16:16:06,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:06,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:06,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 177 proven. 411 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2018-02-04 16:16:06,239 INFO L182 omatonBuilderFactory]: Interpolants [29312#(<= 2 main_~i~1), 29313#(<= 3 main_~i~1), 29314#(<= 4 main_~i~1), 29315#(<= 5 main_~i~1), 29316#(<= 6 main_~i~1), 29317#(<= 7 main_~i~1), 29318#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 29319#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 29320#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 29321#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 29322#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 29323#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 29324#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 29325#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 29326#(<= |foo_#in~size| 6), 29308#true, 29309#false, 29310#(<= 0 main_~i~1), 29311#(<= 1 main_~i~1)] [2018-02-04 16:16:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 41376 backedges. 1963 proven. 3611 refuted. 0 times theorem prover too weak. 35802 trivial. 0 not checked. [2018-02-04 16:16:06,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:06,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:06,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:06,240 INFO L87 Difference]: Start difference. First operand 331 states and 446 transitions. Second operand 19 states. [2018-02-04 16:16:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:06,614 INFO L93 Difference]: Finished difference Result 366 states and 464 transitions. [2018-02-04 16:16:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:16:06,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 883 [2018-02-04 16:16:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:06,616 INFO L225 Difference]: With dead ends: 366 [2018-02-04 16:16:06,616 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 16:16:06,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:16:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 16:16:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 331. [2018-02-04 16:16:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 16:16:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 436 transitions. [2018-02-04 16:16:06,621 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 436 transitions. Word has length 883 [2018-02-04 16:16:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:06,621 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 436 transitions. [2018-02-04 16:16:06,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 436 transitions. [2018-02-04 16:16:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-02-04 16:16:06,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:06,626 INFO L351 BasicCegarLoop]: trace histogram [133, 116, 116, 116, 116, 116, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:06,626 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 495732550, now seen corresponding path program 51 times [2018-02-04 16:16:06,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:06,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45630 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 44780 trivial. 0 not checked. [2018-02-04 16:16:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:07,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:07,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4527 trivial. 0 not checked. [2018-02-04 16:16:07,522 INFO L182 omatonBuilderFactory]: Interpolants [30048#(<= main_~i~1 8), 30049#(<= main_~i~1 9), 30050#(<= main_~i~1 10), 30051#(<= main_~i~1 11), 30052#(<= main_~i~1 12), 30053#(<= main_~i~1 13), 30054#(<= main_~i~1 14), 30055#(<= main_~i~1 15), 30056#(<= main_~i~1 16), 30057#(<= main_~i~1 17), 30038#true, 30039#false, 30040#(= main_~i~1 0), 30041#(<= main_~i~1 1), 30042#(<= main_~i~1 2), 30043#(<= main_~i~1 3), 30044#(<= main_~i~1 4), 30045#(<= main_~i~1 5), 30046#(<= main_~i~1 6), 30047#(<= main_~i~1 7)] [2018-02-04 16:16:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 45630 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 44780 trivial. 0 not checked. [2018-02-04 16:16:07,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:07,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:07,523 INFO L87 Difference]: Start difference. First operand 331 states and 436 transitions. Second operand 20 states. [2018-02-04 16:16:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:07,649 INFO L93 Difference]: Finished difference Result 495 states and 620 transitions. [2018-02-04 16:16:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:16:07,650 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 919 [2018-02-04 16:16:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:07,652 INFO L225 Difference]: With dead ends: 495 [2018-02-04 16:16:07,652 INFO L226 Difference]: Without dead ends: 495 [2018-02-04 16:16:07,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-04 16:16:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 342. [2018-02-04 16:16:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 16:16:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-04 16:16:07,656 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 919 [2018-02-04 16:16:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:07,657 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-04 16:16:07,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-04 16:16:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2018-02-04 16:16:07,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:07,662 INFO L351 BasicCegarLoop]: trace histogram [142, 124, 124, 124, 124, 124, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:07,662 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1400240071, now seen corresponding path program 52 times [2018-02-04 16:16:07,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:07,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 52092 backedges. 6828 proven. 1125 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:08,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:08,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:16:08,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5238 backedges. 630 proven. 62 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-04 16:16:08,579 INFO L182 omatonBuilderFactory]: Interpolants [30895#true, 30896#false, 30897#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 30898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 30899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 30900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 30901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 30902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 30903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 30904#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 30905#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 30906#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 30907#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 30908#(<= |foo_#in~size| 9), 30909#(<= main_~i~1 9), 30910#(<= main_~i~1 10), 30911#(<= main_~i~1 11)] [2018-02-04 16:16:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 52092 backedges. 6828 proven. 1125 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:08,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:16:08,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:16:08,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:16:08,581 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 17 states. [2018-02-04 16:16:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:08,774 INFO L93 Difference]: Finished difference Result 580 states and 883 transitions. [2018-02-04 16:16:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:16:08,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 979 [2018-02-04 16:16:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:08,777 INFO L225 Difference]: With dead ends: 580 [2018-02-04 16:16:08,777 INFO L226 Difference]: Without dead ends: 580 [2018-02-04 16:16:08,778 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-04 16:16:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-02-04 16:16:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 342. [2018-02-04 16:16:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 16:16:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-04 16:16:08,784 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 979 [2018-02-04 16:16:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:08,784 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-04 16:16:08,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:16:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-04 16:16:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-02-04 16:16:08,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:08,789 INFO L351 BasicCegarLoop]: trace histogram [143, 125, 125, 125, 125, 125, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:08,789 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1861613809, now seen corresponding path program 53 times [2018-02-04 16:16:08,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:08,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 52872 backedges. 7466 proven. 1267 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:09,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:09,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:16:09,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 630 proven. 68 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-04 16:16:09,746 INFO L182 omatonBuilderFactory]: Interpolants [31872#(<= main_~i~1 11), 31873#(<= main_~i~1 12), 31856#true, 31857#false, 31858#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 31859#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 31860#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 31861#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 31862#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 31863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 31864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 31865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 31866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 31867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 31868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 31869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 31870#(<= |foo_#in~size| 10), 31871#(<= main_~i~1 10)] [2018-02-04 16:16:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 52872 backedges. 7466 proven. 1267 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:09,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:16:09,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:16:09,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:09,748 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 18 states. [2018-02-04 16:16:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:10,031 INFO L93 Difference]: Finished difference Result 583 states and 933 transitions. [2018-02-04 16:16:10,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:16:10,031 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 985 [2018-02-04 16:16:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:10,035 INFO L225 Difference]: With dead ends: 583 [2018-02-04 16:16:10,035 INFO L226 Difference]: Without dead ends: 583 [2018-02-04 16:16:10,035 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-04 16:16:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-02-04 16:16:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 342. [2018-02-04 16:16:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 16:16:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2018-02-04 16:16:10,045 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 985 [2018-02-04 16:16:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:10,045 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2018-02-04 16:16:10,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:16:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2018-02-04 16:16:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 992 [2018-02-04 16:16:10,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:10,054 INFO L351 BasicCegarLoop]: trace histogram [144, 126, 126, 126, 126, 126, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:10,054 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:10,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1378385833, now seen corresponding path program 54 times [2018-02-04 16:16:10,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:10,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 53658 backedges. 8104 proven. 1415 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:11,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:11,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:11,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 630 proven. 74 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-04 16:16:11,080 INFO L182 omatonBuilderFactory]: Interpolants [32832#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 32833#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 32834#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 32835#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 32836#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 32837#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 32838#(<= |foo_#in~size| 11), 32839#(<= main_~i~1 11), 32840#(<= main_~i~1 12), 32841#(<= main_~i~1 13), 32823#true, 32824#false, 32825#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 32826#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 32827#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 32828#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 32829#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 32830#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 32831#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-04 16:16:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 53658 backedges. 8104 proven. 1415 refuted. 0 times theorem prover too weak. 44139 trivial. 0 not checked. [2018-02-04 16:16:11,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:11,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:11,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:11,081 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand 19 states. [2018-02-04 16:16:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:11,297 INFO L93 Difference]: Finished difference Result 587 states and 937 transitions. [2018-02-04 16:16:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 16:16:11,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 991 [2018-02-04 16:16:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:11,300 INFO L225 Difference]: With dead ends: 587 [2018-02-04 16:16:11,300 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 16:16:11,300 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-04 16:16:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 16:16:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 339. [2018-02-04 16:16:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 16:16:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 433 transitions. [2018-02-04 16:16:11,306 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 433 transitions. Word has length 991 [2018-02-04 16:16:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:11,306 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 433 transitions. [2018-02-04 16:16:11,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 433 transitions. [2018-02-04 16:16:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2018-02-04 16:16:11,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:11,312 INFO L351 BasicCegarLoop]: trace histogram [145, 127, 127, 127, 127, 127, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:11,312 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -274275425, now seen corresponding path program 55 times [2018-02-04 16:16:11,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:11,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 54450 backedges. 9717 proven. 494 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-02-04 16:16:12,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:12,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:12,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5259 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 4546 trivial. 0 not checked. [2018-02-04 16:16:12,320 INFO L182 omatonBuilderFactory]: Interpolants [33794#true, 33795#false, 33796#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 33797#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 33798#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 33799#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 33800#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 33801#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 33802#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 33803#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 33804#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 33805#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 33806#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 33807#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 33808#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 33809#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 33810#(<= |foo_#in~size| 12), 33811#(<= main_~i~1 12), 33812#(<= main_~i~1 13)] [2018-02-04 16:16:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 54450 backedges. 9717 proven. 494 refuted. 0 times theorem prover too weak. 44239 trivial. 0 not checked. [2018-02-04 16:16:12,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:12,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:12,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:12,321 INFO L87 Difference]: Start difference. First operand 339 states and 433 transitions. Second operand 19 states. [2018-02-04 16:16:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:12,569 INFO L93 Difference]: Finished difference Result 503 states and 787 transitions. [2018-02-04 16:16:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:16:12,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 997 [2018-02-04 16:16:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:12,572 INFO L225 Difference]: With dead ends: 503 [2018-02-04 16:16:12,572 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 16:16:12,573 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-04 16:16:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 16:16:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 348. [2018-02-04 16:16:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 16:16:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 459 transitions. [2018-02-04 16:16:12,580 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 459 transitions. Word has length 997 [2018-02-04 16:16:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:12,580 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 459 transitions. [2018-02-04 16:16:12,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 459 transitions. [2018-02-04 16:16:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1004 [2018-02-04 16:16:12,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:12,586 INFO L351 BasicCegarLoop]: trace histogram [146, 128, 128, 128, 128, 128, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:12,586 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:12,586 INFO L82 PathProgramCache]: Analyzing trace with hash 860436519, now seen corresponding path program 56 times [2018-02-04 16:16:12,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:12,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 55248 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 54294 trivial. 0 not checked. [2018-02-04 16:16:13,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:13,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:13,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-02-04 16:16:13,595 INFO L182 omatonBuilderFactory]: Interpolants [34692#true, 34693#false, 34694#(= main_~i~1 0), 34695#(<= main_~i~1 1), 34696#(<= main_~i~1 2), 34697#(<= main_~i~1 3), 34698#(<= main_~i~1 4), 34699#(<= main_~i~1 5), 34700#(<= main_~i~1 6), 34701#(<= main_~i~1 7), 34702#(<= main_~i~1 8), 34703#(<= main_~i~1 9), 34704#(<= main_~i~1 10), 34705#(<= main_~i~1 11), 34706#(<= main_~i~1 12), 34707#(<= main_~i~1 13), 34708#(<= main_~i~1 14), 34709#(<= main_~i~1 15), 34710#(<= main_~i~1 16), 34711#(<= main_~i~1 17), 34712#(<= main_~i~1 18)] [2018-02-04 16:16:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55248 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 54294 trivial. 0 not checked. [2018-02-04 16:16:13,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:13,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:13,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:13,596 INFO L87 Difference]: Start difference. First operand 348 states and 459 transitions. Second operand 21 states. [2018-02-04 16:16:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:13,748 INFO L93 Difference]: Finished difference Result 517 states and 647 transitions. [2018-02-04 16:16:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:16:13,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1003 [2018-02-04 16:16:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:13,750 INFO L225 Difference]: With dead ends: 517 [2018-02-04 16:16:13,750 INFO L226 Difference]: Without dead ends: 517 [2018-02-04 16:16:13,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-04 16:16:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 359. [2018-02-04 16:16:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 16:16:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-04 16:16:13,754 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1003 [2018-02-04 16:16:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:13,755 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-04 16:16:13,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-04 16:16:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2018-02-04 16:16:13,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:13,761 INFO L351 BasicCegarLoop]: trace histogram [155, 136, 136, 136, 136, 136, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:13,761 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -870443480, now seen corresponding path program 57 times [2018-02-04 16:16:13,761 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:13,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 62338 backedges. 6234 proven. 1806 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:14,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:14,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:16:14,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6021 backedges. 624 proven. 112 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:14,824 INFO L182 omatonBuilderFactory]: Interpolants [35589#true, 35590#false, 35591#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 35592#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 35593#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 35594#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 35595#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 35596#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 35597#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 35598#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 35599#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 35600#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 35601#(<= |foo_#in~size| 8), 35602#(<= main_~i~1 8), 35603#(<= main_~i~1 9), 35604#(<= main_~i~1 10), 35605#(<= main_~i~1 11)] [2018-02-04 16:16:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 62338 backedges. 6234 proven. 1806 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:14,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:16:14,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:16:14,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:16:14,825 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 17 states. [2018-02-04 16:16:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:15,021 INFO L93 Difference]: Finished difference Result 698 states and 1093 transitions. [2018-02-04 16:16:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:16:15,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1063 [2018-02-04 16:16:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:15,024 INFO L225 Difference]: With dead ends: 698 [2018-02-04 16:16:15,024 INFO L226 Difference]: Without dead ends: 698 [2018-02-04 16:16:15,025 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-04 16:16:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-04 16:16:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 359. [2018-02-04 16:16:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 16:16:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-04 16:16:15,031 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1063 [2018-02-04 16:16:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:15,032 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-04 16:16:15,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:16:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-04 16:16:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2018-02-04 16:16:15,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:15,037 INFO L351 BasicCegarLoop]: trace histogram [156, 137, 137, 137, 137, 137, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:15,037 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -479133328, now seen corresponding path program 58 times [2018-02-04 16:16:15,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:15,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 63192 backedges. 6866 proven. 2028 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:16,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:16,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:16:16,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6033 backedges. 624 proven. 124 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:16,207 INFO L182 omatonBuilderFactory]: Interpolants [36683#true, 36684#false, 36685#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 36686#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 36687#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 36688#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 36689#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 36690#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 36691#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 36692#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 36693#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 36694#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 36695#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 36696#(<= |foo_#in~size| 9), 36697#(<= main_~i~1 9), 36698#(<= main_~i~1 10), 36699#(<= main_~i~1 11), 36700#(<= main_~i~1 12)] [2018-02-04 16:16:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 63192 backedges. 6866 proven. 2028 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:16,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:16:16,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:16:16,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:16,208 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 18 states. [2018-02-04 16:16:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:16,437 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2018-02-04 16:16:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:16:16,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1069 [2018-02-04 16:16:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:16,441 INFO L225 Difference]: With dead ends: 701 [2018-02-04 16:16:16,441 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 16:16:16,441 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-04 16:16:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 16:16:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 359. [2018-02-04 16:16:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 16:16:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-04 16:16:16,449 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1069 [2018-02-04 16:16:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:16,449 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-04 16:16:16,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:16:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-04 16:16:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2018-02-04 16:16:16,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:16,455 INFO L351 BasicCegarLoop]: trace histogram [157, 138, 138, 138, 138, 138, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:16,455 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -295151944, now seen corresponding path program 59 times [2018-02-04 16:16:16,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:16,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 64052 backedges. 7498 proven. 2256 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:17,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:17,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:17,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6045 backedges. 624 proven. 136 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:17,576 INFO L182 omatonBuilderFactory]: Interpolants [37792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 37793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 37794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 37795#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 37796#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 37797#(<= |foo_#in~size| 10), 37798#(<= main_~i~1 10), 37799#(<= main_~i~1 11), 37800#(<= main_~i~1 12), 37801#(<= main_~i~1 13), 37783#true, 37784#false, 37785#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 37786#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 37787#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 37788#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 37789#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 37790#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 37791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-04 16:16:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 64052 backedges. 7498 proven. 2256 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:17,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:17,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:17,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:17,578 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 19 states. [2018-02-04 16:16:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:17,789 INFO L93 Difference]: Finished difference Result 704 states and 1227 transitions. [2018-02-04 16:16:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:16:17,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1075 [2018-02-04 16:16:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:17,793 INFO L225 Difference]: With dead ends: 704 [2018-02-04 16:16:17,793 INFO L226 Difference]: Without dead ends: 704 [2018-02-04 16:16:17,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-04 16:16:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-04 16:16:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 359. [2018-02-04 16:16:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 16:16:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2018-02-04 16:16:17,804 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 1075 [2018-02-04 16:16:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:17,804 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2018-02-04 16:16:17,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2018-02-04 16:16:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2018-02-04 16:16:17,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:17,810 INFO L351 BasicCegarLoop]: trace histogram [158, 139, 139, 139, 139, 139, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:17,810 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash -158558720, now seen corresponding path program 60 times [2018-02-04 16:16:17,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:17,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 64918 backedges. 8130 proven. 2490 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:18,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:18,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:18,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6057 backedges. 624 proven. 148 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:18,995 INFO L182 omatonBuilderFactory]: Interpolants [38889#true, 38890#false, 38891#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 38892#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 38893#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 38894#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 38895#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 38896#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 38897#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 38898#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 38899#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 38900#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 38901#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 38902#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 38903#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 38904#(<= |foo_#in~size| 11), 38905#(<= main_~i~1 11), 38906#(<= main_~i~1 12), 38907#(<= main_~i~1 13), 38908#(<= main_~i~1 14)] [2018-02-04 16:16:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 64918 backedges. 8130 proven. 2490 refuted. 0 times theorem prover too weak. 54298 trivial. 0 not checked. [2018-02-04 16:16:18,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:18,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:18,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:18,996 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 20 states. [2018-02-04 16:16:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:19,248 INFO L93 Difference]: Finished difference Result 704 states and 1227 transitions. [2018-02-04 16:16:19,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:16:19,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1081 [2018-02-04 16:16:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:19,252 INFO L225 Difference]: With dead ends: 704 [2018-02-04 16:16:19,253 INFO L226 Difference]: Without dead ends: 704 [2018-02-04 16:16:19,253 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-04 16:16:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-04 16:16:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 356. [2018-02-04 16:16:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-04 16:16:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2018-02-04 16:16:19,262 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 1081 [2018-02-04 16:16:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:19,262 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2018-02-04 16:16:19,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2018-02-04 16:16:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2018-02-04 16:16:19,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:19,268 INFO L351 BasicCegarLoop]: trace histogram [159, 140, 140, 140, 140, 140, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:19,268 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -586793144, now seen corresponding path program 61 times [2018-02-04 16:16:19,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:19,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 65790 backedges. 9743 proven. 1649 refuted. 0 times theorem prover too weak. 54398 trivial. 0 not checked. [2018-02-04 16:16:20,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:20,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:20,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6072 backedges. 707 proven. 80 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:20,485 INFO L182 omatonBuilderFactory]: Interpolants [40000#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 40001#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 40002#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 40003#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 40004#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 40005#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 40006#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 40007#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 40008#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 40009#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 40010#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 40011#(<= |foo_#in~size| 12), 40012#(<= main_~i~1 12), 40013#(<= main_~i~1 13), 40014#(<= main_~i~1 14), 39995#true, 39996#false, 39997#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 39998#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 39999#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:16:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 65790 backedges. 9743 proven. 1649 refuted. 0 times theorem prover too weak. 54398 trivial. 0 not checked. [2018-02-04 16:16:20,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:20,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:20,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:20,486 INFO L87 Difference]: Start difference. First operand 356 states and 455 transitions. Second operand 20 states. [2018-02-04 16:16:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:20,727 INFO L93 Difference]: Finished difference Result 621 states and 1041 transitions. [2018-02-04 16:16:20,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:16:20,727 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1087 [2018-02-04 16:16:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:20,730 INFO L225 Difference]: With dead ends: 621 [2018-02-04 16:16:20,730 INFO L226 Difference]: Without dead ends: 621 [2018-02-04 16:16:20,731 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-04 16:16:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-04 16:16:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 356. [2018-02-04 16:16:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-04 16:16:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2018-02-04 16:16:20,737 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 1087 [2018-02-04 16:16:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:20,737 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2018-02-04 16:16:20,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2018-02-04 16:16:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2018-02-04 16:16:20,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:20,743 INFO L351 BasicCegarLoop]: trace histogram [160, 141, 141, 141, 141, 141, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:20,743 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1136698928, now seen corresponding path program 62 times [2018-02-04 16:16:20,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:20,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 66668 backedges. 11590 proven. 574 refuted. 0 times theorem prover too weak. 54504 trivial. 0 not checked. [2018-02-04 16:16:22,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:22,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:22,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6078 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2018-02-04 16:16:22,037 INFO L182 omatonBuilderFactory]: Interpolants [41024#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41025#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41026#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41027#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41028#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 41029#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41030#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41031#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 41032#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 41033#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 41034#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 41035#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 41036#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 41037#(<= |foo_#in~size| 13), 41038#(<= main_~i~1 13), 41039#(<= main_~i~1 14), 41020#true, 41021#false, 41022#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41023#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 16:16:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 66668 backedges. 11590 proven. 574 refuted. 0 times theorem prover too weak. 54504 trivial. 0 not checked. [2018-02-04 16:16:22,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:22,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:22,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:22,038 INFO L87 Difference]: Start difference. First operand 356 states and 455 transitions. Second operand 20 states. [2018-02-04 16:16:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:22,262 INFO L93 Difference]: Finished difference Result 531 states and 865 transitions. [2018-02-04 16:16:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:16:22,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1093 [2018-02-04 16:16:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:22,264 INFO L225 Difference]: With dead ends: 531 [2018-02-04 16:16:22,264 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 16:16:22,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:16:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 16:16:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 365. [2018-02-04 16:16:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 16:16:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 482 transitions. [2018-02-04 16:16:22,271 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 482 transitions. Word has length 1093 [2018-02-04 16:16:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:22,271 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 482 transitions. [2018-02-04 16:16:22,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 482 transitions. [2018-02-04 16:16:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2018-02-04 16:16:22,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:22,277 INFO L351 BasicCegarLoop]: trace histogram [161, 142, 142, 142, 142, 142, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:22,277 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1833076120, now seen corresponding path program 63 times [2018-02-04 16:16:22,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:22,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 67552 backedges. 2722 proven. 5294 refuted. 0 times theorem prover too weak. 59536 trivial. 0 not checked. [2018-02-04 16:16:23,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:23,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:23,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 227 proven. 521 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-02-04 16:16:23,530 INFO L182 omatonBuilderFactory]: Interpolants [41984#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 41985#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 41986#(<= |foo_#in~size| 7), 41966#true, 41967#false, 41968#(<= 0 main_~i~1), 41969#(<= 1 main_~i~1), 41970#(<= 2 main_~i~1), 41971#(<= 3 main_~i~1), 41972#(<= 4 main_~i~1), 41973#(<= 5 main_~i~1), 41974#(<= 6 main_~i~1), 41975#(<= 7 main_~i~1), 41976#(<= 8 main_~i~1), 41977#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 41978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 41979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 41980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 41981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 41982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 41983#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6))] [2018-02-04 16:16:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 67552 backedges. 2722 proven. 5294 refuted. 0 times theorem prover too weak. 59536 trivial. 0 not checked. [2018-02-04 16:16:23,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:23,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:23,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:23,531 INFO L87 Difference]: Start difference. First operand 365 states and 482 transitions. Second operand 21 states. [2018-02-04 16:16:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:23,751 INFO L93 Difference]: Finished difference Result 408 states and 523 transitions. [2018-02-04 16:16:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:16:23,751 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1099 [2018-02-04 16:16:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:23,752 INFO L225 Difference]: With dead ends: 408 [2018-02-04 16:16:23,752 INFO L226 Difference]: Without dead ends: 408 [2018-02-04 16:16:23,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-02-04 16:16:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-04 16:16:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 368. [2018-02-04 16:16:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 16:16:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 491 transitions. [2018-02-04 16:16:23,756 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 491 transitions. Word has length 1099 [2018-02-04 16:16:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:23,756 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 491 transitions. [2018-02-04 16:16:23,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 491 transitions. [2018-02-04 16:16:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2018-02-04 16:16:23,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:23,762 INFO L351 BasicCegarLoop]: trace histogram [169, 150, 150, 150, 150, 150, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:23,762 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1868763864, now seen corresponding path program 64 times [2018-02-04 16:16:23,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:23,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 74840 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 73776 trivial. 0 not checked. [2018-02-04 16:16:25,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:25,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:25,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6363 trivial. 0 not checked. [2018-02-04 16:16:25,141 INFO L182 omatonBuilderFactory]: Interpolants [42784#(<= main_~i~1 3), 42785#(<= main_~i~1 4), 42786#(<= main_~i~1 5), 42787#(<= main_~i~1 6), 42788#(<= main_~i~1 7), 42789#(<= main_~i~1 8), 42790#(<= main_~i~1 9), 42791#(<= main_~i~1 10), 42792#(<= main_~i~1 11), 42793#(<= main_~i~1 12), 42794#(<= main_~i~1 13), 42795#(<= main_~i~1 14), 42796#(<= main_~i~1 15), 42797#(<= main_~i~1 16), 42798#(<= main_~i~1 17), 42799#(<= main_~i~1 18), 42800#(<= main_~i~1 19), 42779#true, 42780#false, 42781#(= main_~i~1 0), 42782#(<= main_~i~1 1), 42783#(<= main_~i~1 2)] [2018-02-04 16:16:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 74840 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 73776 trivial. 0 not checked. [2018-02-04 16:16:25,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:25,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:25,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:25,142 INFO L87 Difference]: Start difference. First operand 368 states and 491 transitions. Second operand 22 states. [2018-02-04 16:16:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:25,304 INFO L93 Difference]: Finished difference Result 542 states and 683 transitions. [2018-02-04 16:16:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:16:25,305 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1147 [2018-02-04 16:16:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:25,307 INFO L225 Difference]: With dead ends: 542 [2018-02-04 16:16:25,307 INFO L226 Difference]: Without dead ends: 542 [2018-02-04 16:16:25,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-02-04 16:16:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 379. [2018-02-04 16:16:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 16:16:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 507 transitions. [2018-02-04 16:16:25,311 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 507 transitions. Word has length 1147 [2018-02-04 16:16:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:25,312 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 507 transitions. [2018-02-04 16:16:25,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 507 transitions. [2018-02-04 16:16:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2018-02-04 16:16:25,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:25,320 INFO L351 BasicCegarLoop]: trace histogram [179, 159, 159, 159, 159, 159, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:25,320 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash -131833823, now seen corresponding path program 65 times [2018-02-04 16:16:25,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:25,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 84046 backedges. 6782 proven. 2685 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:26,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:26,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:16:26,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 696 proven. 168 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:26,711 INFO L182 omatonBuilderFactory]: Interpolants [43722#true, 43723#false, 43724#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 43725#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 43726#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 43727#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 43728#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 43729#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 43730#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 43731#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 43732#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 43733#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 43734#(<= |foo_#in~size| 8), 43735#(<= main_~i~1 8), 43736#(<= main_~i~1 9), 43737#(<= main_~i~1 10), 43738#(<= main_~i~1 11), 43739#(<= main_~i~1 12)] [2018-02-04 16:16:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 84046 backedges. 6782 proven. 2685 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:26,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:16:26,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:16:26,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:16:26,712 INFO L87 Difference]: Start difference. First operand 379 states and 507 transitions. Second operand 18 states. [2018-02-04 16:16:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:26,922 INFO L93 Difference]: Finished difference Result 819 states and 1327 transitions. [2018-02-04 16:16:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:16:26,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1213 [2018-02-04 16:16:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:26,926 INFO L225 Difference]: With dead ends: 819 [2018-02-04 16:16:26,926 INFO L226 Difference]: Without dead ends: 819 [2018-02-04 16:16:26,927 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-04 16:16:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-02-04 16:16:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 382. [2018-02-04 16:16:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 16:16:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 528 transitions. [2018-02-04 16:16:26,934 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 528 transitions. Word has length 1213 [2018-02-04 16:16:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:26,935 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 528 transitions. [2018-02-04 16:16:26,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:16:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 528 transitions. [2018-02-04 16:16:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2018-02-04 16:16:26,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:26,941 INFO L351 BasicCegarLoop]: trace histogram [180, 160, 160, 160, 160, 160, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:26,941 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 647193961, now seen corresponding path program 66 times [2018-02-04 16:16:26,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:26,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 85040 backedges. 7462 proven. 2999 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:28,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:28,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:28,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7239 backedges. 672 proven. 186 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:28,439 INFO L182 omatonBuilderFactory]: Interpolants [44961#true, 44962#false, 44963#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 44964#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 44965#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 44966#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 44967#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 44968#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 44969#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 44970#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 44971#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 44972#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 44973#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 44974#(<= |foo_#in~size| 9), 44975#(<= main_~i~1 9), 44976#(<= main_~i~1 10), 44977#(<= main_~i~1 11), 44978#(<= main_~i~1 12), 44979#(<= main_~i~1 13)] [2018-02-04 16:16:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 85040 backedges. 7462 proven. 2999 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:28,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:28,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:28,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:28,441 INFO L87 Difference]: Start difference. First operand 382 states and 528 transitions. Second operand 19 states. [2018-02-04 16:16:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:28,668 INFO L93 Difference]: Finished difference Result 822 states and 1411 transitions. [2018-02-04 16:16:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:16:28,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1219 [2018-02-04 16:16:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:28,673 INFO L225 Difference]: With dead ends: 822 [2018-02-04 16:16:28,673 INFO L226 Difference]: Without dead ends: 822 [2018-02-04 16:16:28,673 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-04 16:16:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-02-04 16:16:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 382. [2018-02-04 16:16:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 16:16:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 528 transitions. [2018-02-04 16:16:28,682 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 528 transitions. Word has length 1219 [2018-02-04 16:16:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:28,682 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 528 transitions. [2018-02-04 16:16:28,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 528 transitions. [2018-02-04 16:16:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2018-02-04 16:16:28,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:28,689 INFO L351 BasicCegarLoop]: trace histogram [181, 161, 161, 161, 161, 161, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:28,689 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -441756495, now seen corresponding path program 67 times [2018-02-04 16:16:28,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:28,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 86040 backedges. 8142 proven. 3319 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:30,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:30,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:30,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7257 backedges. 672 proven. 204 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:30,215 INFO L182 omatonBuilderFactory]: Interpolants [46208#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 46209#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 46210#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 46211#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 46212#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 46213#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 46214#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 46215#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 46216#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 46217#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 46218#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 46219#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 46220#(<= |foo_#in~size| 10), 46221#(<= main_~i~1 10), 46222#(<= main_~i~1 11), 46223#(<= main_~i~1 12), 46224#(<= main_~i~1 13), 46225#(<= main_~i~1 14), 46206#true, 46207#false] [2018-02-04 16:16:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 86040 backedges. 8142 proven. 3319 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:30,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:30,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:30,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:30,217 INFO L87 Difference]: Start difference. First operand 382 states and 528 transitions. Second operand 20 states. [2018-02-04 16:16:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:30,480 INFO L93 Difference]: Finished difference Result 825 states and 1495 transitions. [2018-02-04 16:16:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 16:16:30,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1225 [2018-02-04 16:16:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:30,485 INFO L225 Difference]: With dead ends: 825 [2018-02-04 16:16:30,485 INFO L226 Difference]: Without dead ends: 825 [2018-02-04 16:16:30,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:16:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-02-04 16:16:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 382. [2018-02-04 16:16:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 16:16:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 528 transitions. [2018-02-04 16:16:30,494 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 528 transitions. Word has length 1225 [2018-02-04 16:16:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:30,494 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 528 transitions. [2018-02-04 16:16:30,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 528 transitions. [2018-02-04 16:16:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1232 [2018-02-04 16:16:30,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:30,501 INFO L351 BasicCegarLoop]: trace histogram [182, 162, 162, 162, 162, 162, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:30,501 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1986744839, now seen corresponding path program 68 times [2018-02-04 16:16:30,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:30,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 87046 backedges. 8822 proven. 3645 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:32,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:32,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:32,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7275 backedges. 672 proven. 222 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:32,077 INFO L182 omatonBuilderFactory]: Interpolants [47457#true, 47458#false, 47459#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 47460#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 47461#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 47462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 47463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 47464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 47465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 47466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 47467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 47468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 47469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 47470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 47471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 47472#(<= |foo_#in~size| 11), 47473#(<= main_~i~1 11), 47474#(<= main_~i~1 12), 47475#(<= main_~i~1 13), 47476#(<= main_~i~1 14), 47477#(<= main_~i~1 15)] [2018-02-04 16:16:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 87046 backedges. 8822 proven. 3645 refuted. 0 times theorem prover too weak. 74579 trivial. 0 not checked. [2018-02-04 16:16:32,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:32,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:32,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:32,079 INFO L87 Difference]: Start difference. First operand 382 states and 528 transitions. Second operand 21 states. [2018-02-04 16:16:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:32,376 INFO L93 Difference]: Finished difference Result 825 states and 1495 transitions. [2018-02-04 16:16:32,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:16:32,376 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1231 [2018-02-04 16:16:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:32,380 INFO L225 Difference]: With dead ends: 825 [2018-02-04 16:16:32,380 INFO L226 Difference]: Without dead ends: 825 [2018-02-04 16:16:32,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:16:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-02-04 16:16:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 379. [2018-02-04 16:16:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 16:16:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 507 transitions. [2018-02-04 16:16:32,389 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 507 transitions. Word has length 1231 [2018-02-04 16:16:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:32,390 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 507 transitions. [2018-02-04 16:16:32,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 507 transitions. [2018-02-04 16:16:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2018-02-04 16:16:32,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:32,397 INFO L351 BasicCegarLoop]: trace histogram [183, 163, 163, 163, 163, 163, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:32,397 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -971509439, now seen corresponding path program 69 times [2018-02-04 16:16:32,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:32,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 88058 backedges. 10489 proven. 2890 refuted. 0 times theorem prover too weak. 74679 trivial. 0 not checked. [2018-02-04 16:16:33,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:33,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:33,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 755 proven. 160 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:33,977 INFO L182 omatonBuilderFactory]: Interpolants [48708#true, 48709#false, 48710#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 48711#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 48712#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 48713#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 48714#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 48715#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 48716#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 48717#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 48718#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 48719#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 48720#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 48721#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 48722#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 48723#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 48724#(<= |foo_#in~size| 12), 48725#(<= main_~i~1 12), 48726#(<= main_~i~1 13), 48727#(<= main_~i~1 14), 48728#(<= main_~i~1 15)] [2018-02-04 16:16:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 88058 backedges. 10489 proven. 2890 refuted. 0 times theorem prover too weak. 74679 trivial. 0 not checked. [2018-02-04 16:16:33,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:33,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:33,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:33,978 INFO L87 Difference]: Start difference. First operand 379 states and 507 transitions. Second operand 21 states. [2018-02-04 16:16:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:34,268 INFO L93 Difference]: Finished difference Result 744 states and 1318 transitions. [2018-02-04 16:16:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:16:34,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1237 [2018-02-04 16:16:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:34,272 INFO L225 Difference]: With dead ends: 744 [2018-02-04 16:16:34,272 INFO L226 Difference]: Without dead ends: 744 [2018-02-04 16:16:34,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=374, Invalid=816, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:16:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-02-04 16:16:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 379. [2018-02-04 16:16:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 16:16:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 507 transitions. [2018-02-04 16:16:34,281 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 507 transitions. Word has length 1237 [2018-02-04 16:16:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:34,281 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 507 transitions. [2018-02-04 16:16:34,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 507 transitions. [2018-02-04 16:16:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1244 [2018-02-04 16:16:34,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:34,288 INFO L351 BasicCegarLoop]: trace histogram [184, 164, 164, 164, 164, 164, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:34,288 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash 633714121, now seen corresponding path program 70 times [2018-02-04 16:16:34,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:34,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 89076 backedges. 12390 proven. 1901 refuted. 0 times theorem prover too weak. 74785 trivial. 0 not checked. [2018-02-04 16:16:35,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:35,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:35,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7308 backedges. 841 proven. 86 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:35,959 INFO L182 omatonBuilderFactory]: Interpolants [49888#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 49889#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 49890#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 49891#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 49892#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 49893#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 49894#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 49895#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 49896#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 49897#(<= |foo_#in~size| 13), 49898#(<= main_~i~1 13), 49899#(<= main_~i~1 14), 49900#(<= main_~i~1 15), 49880#true, 49881#false, 49882#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 49883#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 49884#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 49885#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 49886#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 49887#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 16:16:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 89076 backedges. 12390 proven. 1901 refuted. 0 times theorem prover too weak. 74785 trivial. 0 not checked. [2018-02-04 16:16:35,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:35,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:35,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:35,961 INFO L87 Difference]: Start difference. First operand 379 states and 507 transitions. Second operand 21 states. [2018-02-04 16:16:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:36,244 INFO L93 Difference]: Finished difference Result 655 states and 1115 transitions. [2018-02-04 16:16:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 16:16:36,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1243 [2018-02-04 16:16:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:36,247 INFO L225 Difference]: With dead ends: 655 [2018-02-04 16:16:36,247 INFO L226 Difference]: Without dead ends: 655 [2018-02-04 16:16:36,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=417, Invalid=843, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:16:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-02-04 16:16:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 379. [2018-02-04 16:16:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 16:16:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 507 transitions. [2018-02-04 16:16:36,254 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 507 transitions. Word has length 1243 [2018-02-04 16:16:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:36,255 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 507 transitions. [2018-02-04 16:16:36,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 507 transitions. [2018-02-04 16:16:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2018-02-04 16:16:36,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:36,262 INFO L351 BasicCegarLoop]: trace histogram [185, 165, 165, 165, 165, 165, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:36,262 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1733256303, now seen corresponding path program 71 times [2018-02-04 16:16:36,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:36,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90100 backedges. 14543 proven. 660 refuted. 0 times theorem prover too weak. 74897 trivial. 0 not checked. [2018-02-04 16:16:37,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:37,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:37,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7314 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 6381 trivial. 0 not checked. [2018-02-04 16:16:37,894 INFO L182 omatonBuilderFactory]: Interpolants [50976#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 50977#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 50978#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 50979#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 50980#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 50981#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 50982#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 50983#(<= |foo_#in~size| 14), 50984#(<= main_~i~1 14), 50985#(<= main_~i~1 15), 50965#true, 50966#false, 50967#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 50968#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 50969#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 50970#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 50971#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 50972#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 50973#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 50974#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 50975#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8))] [2018-02-04 16:16:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 90100 backedges. 14543 proven. 660 refuted. 0 times theorem prover too weak. 74897 trivial. 0 not checked. [2018-02-04 16:16:37,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:37,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:37,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:37,896 INFO L87 Difference]: Start difference. First operand 379 states and 507 transitions. Second operand 21 states. [2018-02-04 16:16:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:38,116 INFO L93 Difference]: Finished difference Result 559 states and 923 transitions. [2018-02-04 16:16:38,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:16:38,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1249 [2018-02-04 16:16:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:38,119 INFO L225 Difference]: With dead ends: 559 [2018-02-04 16:16:38,119 INFO L226 Difference]: Without dead ends: 559 [2018-02-04 16:16:38,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:16:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-04 16:16:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 388. [2018-02-04 16:16:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 16:16:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 535 transitions. [2018-02-04 16:16:38,128 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 535 transitions. Word has length 1249 [2018-02-04 16:16:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:38,128 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 535 transitions. [2018-02-04 16:16:38,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 535 transitions. [2018-02-04 16:16:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1256 [2018-02-04 16:16:38,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:38,135 INFO L351 BasicCegarLoop]: trace histogram [186, 166, 166, 166, 166, 166, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:38,135 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash -946752871, now seen corresponding path program 72 times [2018-02-04 16:16:38,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:38,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 91130 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 89950 trivial. 0 not checked. [2018-02-04 16:16:39,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:39,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:16:39,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7311 trivial. 0 not checked. [2018-02-04 16:16:39,761 INFO L182 omatonBuilderFactory]: Interpolants [51968#(<= main_~i~1 1), 51969#(<= main_~i~1 2), 51970#(<= main_~i~1 3), 51971#(<= main_~i~1 4), 51972#(<= main_~i~1 5), 51973#(<= main_~i~1 6), 51974#(<= main_~i~1 7), 51975#(<= main_~i~1 8), 51976#(<= main_~i~1 9), 51977#(<= main_~i~1 10), 51978#(<= main_~i~1 11), 51979#(<= main_~i~1 12), 51980#(<= main_~i~1 13), 51981#(<= main_~i~1 14), 51982#(<= main_~i~1 15), 51983#(<= main_~i~1 16), 51984#(<= main_~i~1 17), 51985#(<= main_~i~1 18), 51986#(<= main_~i~1 19), 51987#(<= main_~i~1 20), 51965#true, 51966#false, 51967#(= main_~i~1 0)] [2018-02-04 16:16:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 91130 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 89950 trivial. 0 not checked. [2018-02-04 16:16:39,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:16:39,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:16:39,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:16:39,762 INFO L87 Difference]: Start difference. First operand 388 states and 535 transitions. Second operand 23 states. [2018-02-04 16:16:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:39,941 INFO L93 Difference]: Finished difference Result 599 states and 797 transitions. [2018-02-04 16:16:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:16:39,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1255 [2018-02-04 16:16:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:39,943 INFO L225 Difference]: With dead ends: 599 [2018-02-04 16:16:39,943 INFO L226 Difference]: Without dead ends: 599 [2018-02-04 16:16:39,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:16:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-02-04 16:16:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 399. [2018-02-04 16:16:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 16:16:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2018-02-04 16:16:39,949 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 1255 [2018-02-04 16:16:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:39,950 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2018-02-04 16:16:39,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:16:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2018-02-04 16:16:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2018-02-04 16:16:39,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:39,957 INFO L351 BasicCegarLoop]: trace histogram [196, 175, 175, 175, 175, 175, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:39,957 INFO L371 AbstractCegarLoop]: === Iteration 82 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1156066914, now seen corresponding path program 73 times [2018-02-04 16:16:39,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:40,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 101262 backedges. 6882 proven. 3626 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:41,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:41,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:16:41,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8250 backedges. 696 proven. 224 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:41,659 INFO L182 omatonBuilderFactory]: Interpolants [52992#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 52993#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 52994#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 52995#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 52996#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 52997#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 52998#(<= |foo_#in~size| 8), 52999#(<= main_~i~1 8), 53000#(<= main_~i~1 9), 53001#(<= main_~i~1 10), 53002#(<= main_~i~1 11), 53003#(<= main_~i~1 12), 53004#(<= main_~i~1 13), 52986#true, 52987#false, 52988#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 52989#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 52990#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 52991#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 16:16:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 101262 backedges. 6882 proven. 3626 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:41,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 16:16:41,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 16:16:41,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-02-04 16:16:41,661 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand 19 states. [2018-02-04 16:16:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:41,868 INFO L93 Difference]: Finished difference Result 940 states and 1635 transitions. [2018-02-04 16:16:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:16:41,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1321 [2018-02-04 16:16:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:41,873 INFO L225 Difference]: With dead ends: 940 [2018-02-04 16:16:41,873 INFO L226 Difference]: Without dead ends: 940 [2018-02-04 16:16:41,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2018-02-04 16:16:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-02-04 16:16:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 402. [2018-02-04 16:16:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 16:16:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 574 transitions. [2018-02-04 16:16:41,890 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 574 transitions. Word has length 1321 [2018-02-04 16:16:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:41,891 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 574 transitions. [2018-02-04 16:16:41,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 16:16:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 574 transitions. [2018-02-04 16:16:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1328 [2018-02-04 16:16:41,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:41,904 INFO L351 BasicCegarLoop]: trace histogram [197, 176, 176, 176, 176, 176, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:41,904 INFO L371 AbstractCegarLoop]: === Iteration 83 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1500260266, now seen corresponding path program 74 times [2018-02-04 16:16:41,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:41,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 102354 backedges. 7562 proven. 4038 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:43,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:43,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:16:43,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8250 backedges. 672 proven. 248 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:43,732 INFO L182 omatonBuilderFactory]: Interpolants [54368#false, 54369#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 54370#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 54371#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 54372#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 54373#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 54374#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 54375#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 54376#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 54377#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 54378#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 54379#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 54380#(<= |foo_#in~size| 9), 54381#(<= main_~i~1 9), 54382#(<= main_~i~1 10), 54383#(<= main_~i~1 11), 54384#(<= main_~i~1 12), 54385#(<= main_~i~1 13), 54386#(<= main_~i~1 14), 54367#true] [2018-02-04 16:16:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 102354 backedges. 7562 proven. 4038 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:43,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:16:43,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:16:43,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:16:43,733 INFO L87 Difference]: Start difference. First operand 402 states and 574 transitions. Second operand 20 states. [2018-02-04 16:16:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:43,980 INFO L93 Difference]: Finished difference Result 943 states and 1736 transitions. [2018-02-04 16:16:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:16:43,981 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1327 [2018-02-04 16:16:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:43,986 INFO L225 Difference]: With dead ends: 943 [2018-02-04 16:16:43,986 INFO L226 Difference]: Without dead ends: 943 [2018-02-04 16:16:43,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-02-04 16:16:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-02-04 16:16:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 402. [2018-02-04 16:16:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 16:16:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 574 transitions. [2018-02-04 16:16:43,997 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 574 transitions. Word has length 1327 [2018-02-04 16:16:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:43,997 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 574 transitions. [2018-02-04 16:16:43,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:16:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 574 transitions. [2018-02-04 16:16:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1334 [2018-02-04 16:16:44,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:44,005 INFO L351 BasicCegarLoop]: trace histogram [198, 177, 177, 177, 177, 177, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:44,005 INFO L371 AbstractCegarLoop]: === Iteration 84 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1877865742, now seen corresponding path program 75 times [2018-02-04 16:16:44,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:44,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 103452 backedges. 8242 proven. 4456 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:45,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:45,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:16:45,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8274 backedges. 672 proven. 272 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:45,879 INFO L182 omatonBuilderFactory]: Interpolants [55754#true, 55755#false, 55756#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 55757#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 55758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 55759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 55760#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 55761#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 55762#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 55763#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 55764#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 55765#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 55766#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 55767#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 55768#(<= |foo_#in~size| 10), 55769#(<= main_~i~1 10), 55770#(<= main_~i~1 11), 55771#(<= main_~i~1 12), 55772#(<= main_~i~1 13), 55773#(<= main_~i~1 14), 55774#(<= main_~i~1 15)] [2018-02-04 16:16:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 103452 backedges. 8242 proven. 4456 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:45,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:16:45,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:16:45,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:16:45,881 INFO L87 Difference]: Start difference. First operand 402 states and 574 transitions. Second operand 21 states. [2018-02-04 16:16:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:46,173 INFO L93 Difference]: Finished difference Result 946 states and 1837 transitions. [2018-02-04 16:16:46,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:16:46,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1333 [2018-02-04 16:16:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:46,180 INFO L225 Difference]: With dead ends: 946 [2018-02-04 16:16:46,180 INFO L226 Difference]: Without dead ends: 946 [2018-02-04 16:16:46,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 16:16:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-02-04 16:16:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 402. [2018-02-04 16:16:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 16:16:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 574 transitions. [2018-02-04 16:16:46,200 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 574 transitions. Word has length 1333 [2018-02-04 16:16:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:46,201 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 574 transitions. [2018-02-04 16:16:46,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:16:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 574 transitions. [2018-02-04 16:16:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2018-02-04 16:16:46,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:46,214 INFO L351 BasicCegarLoop]: trace histogram [199, 178, 178, 178, 178, 178, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:46,214 INFO L371 AbstractCegarLoop]: === Iteration 85 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2118277178, now seen corresponding path program 76 times [2018-02-04 16:16:46,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:46,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 104556 backedges. 8922 proven. 4880 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:48,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:48,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:48,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8298 backedges. 672 proven. 296 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:48,122 INFO L182 omatonBuilderFactory]: Interpolants [57152#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 57153#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 57154#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 57155#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 57156#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 57157#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 57158#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 57159#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 57160#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 57161#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 57162#(<= |foo_#in~size| 11), 57163#(<= main_~i~1 11), 57164#(<= main_~i~1 12), 57165#(<= main_~i~1 13), 57166#(<= main_~i~1 14), 57167#(<= main_~i~1 15), 57168#(<= main_~i~1 16), 57147#true, 57148#false, 57149#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 57150#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 57151#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:16:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 104556 backedges. 8922 proven. 4880 refuted. 0 times theorem prover too weak. 90754 trivial. 0 not checked. [2018-02-04 16:16:48,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:48,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:48,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:48,124 INFO L87 Difference]: Start difference. First operand 402 states and 574 transitions. Second operand 22 states. [2018-02-04 16:16:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:48,406 INFO L93 Difference]: Finished difference Result 946 states and 1837 transitions. [2018-02-04 16:16:48,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:16:48,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1339 [2018-02-04 16:16:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:48,411 INFO L225 Difference]: With dead ends: 946 [2018-02-04 16:16:48,411 INFO L226 Difference]: Without dead ends: 946 [2018-02-04 16:16:48,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=342, Invalid=848, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:16:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-02-04 16:16:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 399. [2018-02-04 16:16:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 16:16:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2018-02-04 16:16:48,426 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 1339 [2018-02-04 16:16:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:48,426 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2018-02-04 16:16:48,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2018-02-04 16:16:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1346 [2018-02-04 16:16:48,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:48,434 INFO L351 BasicCegarLoop]: trace histogram [200, 179, 179, 179, 179, 179, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:48,435 INFO L371 AbstractCegarLoop]: === Iteration 86 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 688230274, now seen corresponding path program 77 times [2018-02-04 16:16:48,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:48,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 105666 backedges. 10595 proven. 4217 refuted. 0 times theorem prover too weak. 90854 trivial. 0 not checked. [2018-02-04 16:16:50,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:50,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:50,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 755 proven. 240 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:50,336 INFO L182 omatonBuilderFactory]: Interpolants [58560#(<= main_~i~1 15), 58561#(<= main_~i~1 16), 58540#true, 58541#false, 58542#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 58543#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 58544#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 58545#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 58546#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 58547#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 58548#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 58549#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 58550#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 58551#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 58552#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 58553#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 58554#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 58555#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 58556#(<= |foo_#in~size| 12), 58557#(<= main_~i~1 12), 58558#(<= main_~i~1 13), 58559#(<= main_~i~1 14)] [2018-02-04 16:16:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 105666 backedges. 10595 proven. 4217 refuted. 0 times theorem prover too weak. 90854 trivial. 0 not checked. [2018-02-04 16:16:50,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:50,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:50,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:50,337 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand 22 states. [2018-02-04 16:16:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:50,651 INFO L93 Difference]: Finished difference Result 871 states and 1664 transitions. [2018-02-04 16:16:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 16:16:50,651 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1345 [2018-02-04 16:16:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:50,654 INFO L225 Difference]: With dead ends: 871 [2018-02-04 16:16:50,655 INFO L226 Difference]: Without dead ends: 871 [2018-02-04 16:16:50,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=380, Invalid=880, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:16:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-02-04 16:16:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 399. [2018-02-04 16:16:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 16:16:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2018-02-04 16:16:50,666 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 1345 [2018-02-04 16:16:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:50,666 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2018-02-04 16:16:50,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2018-02-04 16:16:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2018-02-04 16:16:50,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:50,674 INFO L351 BasicCegarLoop]: trace histogram [201, 180, 180, 180, 180, 180, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:50,674 INFO L371 AbstractCegarLoop]: === Iteration 87 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2088527882, now seen corresponding path program 78 times [2018-02-04 16:16:50,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:50,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 106782 backedges. 12502 proven. 3320 refuted. 0 times theorem prover too weak. 90960 trivial. 0 not checked. [2018-02-04 16:16:52,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:52,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:52,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8343 backedges. 841 proven. 172 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:52,610 INFO L182 omatonBuilderFactory]: Interpolants [59872#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 59873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 59874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 59875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 59876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 59877#(<= |foo_#in~size| 13), 59878#(<= main_~i~1 13), 59879#(<= main_~i~1 14), 59880#(<= main_~i~1 15), 59881#(<= main_~i~1 16), 59860#true, 59861#false, 59862#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 59863#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 59864#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 59865#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 59866#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 59867#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 59868#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 59869#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 59870#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 59871#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-04 16:16:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 106782 backedges. 12502 proven. 3320 refuted. 0 times theorem prover too weak. 90960 trivial. 0 not checked. [2018-02-04 16:16:52,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:52,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:52,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:52,612 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand 22 states. [2018-02-04 16:16:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:52,883 INFO L93 Difference]: Finished difference Result 784 states and 1460 transitions. [2018-02-04 16:16:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:16:52,884 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1351 [2018-02-04 16:16:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:52,887 INFO L225 Difference]: With dead ends: 784 [2018-02-04 16:16:52,887 INFO L226 Difference]: Without dead ends: 784 [2018-02-04 16:16:52,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=422, Invalid=910, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:16:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-02-04 16:16:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 399. [2018-02-04 16:16:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 16:16:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2018-02-04 16:16:52,896 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 1351 [2018-02-04 16:16:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:52,896 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2018-02-04 16:16:52,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2018-02-04 16:16:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1358 [2018-02-04 16:16:52,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:52,904 INFO L351 BasicCegarLoop]: trace histogram [202, 181, 181, 181, 181, 181, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:52,904 INFO L371 AbstractCegarLoop]: === Iteration 88 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 709460434, now seen corresponding path program 79 times [2018-02-04 16:16:52,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:52,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 107904 backedges. 14661 proven. 2171 refuted. 0 times theorem prover too weak. 91072 trivial. 0 not checked. [2018-02-04 16:16:54,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:54,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:54,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8355 backedges. 933 proven. 92 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:54,867 INFO L182 omatonBuilderFactory]: Interpolants [61095#true, 61096#false, 61097#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 61098#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 61099#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 61100#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 61101#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 61102#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 61103#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 61104#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 61105#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 61106#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 61107#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 61108#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 61109#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 61110#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 61111#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 61112#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 61113#(<= |foo_#in~size| 14), 61114#(<= main_~i~1 14), 61115#(<= main_~i~1 15), 61116#(<= main_~i~1 16)] [2018-02-04 16:16:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 107904 backedges. 14661 proven. 2171 refuted. 0 times theorem prover too weak. 91072 trivial. 0 not checked. [2018-02-04 16:16:54,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:54,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:54,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:54,869 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand 22 states. [2018-02-04 16:16:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:55,191 INFO L93 Difference]: Finished difference Result 689 states and 1228 transitions. [2018-02-04 16:16:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 16:16:55,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1357 [2018-02-04 16:16:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:55,195 INFO L225 Difference]: With dead ends: 689 [2018-02-04 16:16:55,195 INFO L226 Difference]: Without dead ends: 689 [2018-02-04 16:16:55,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=468, Invalid=938, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:16:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-02-04 16:16:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 399. [2018-02-04 16:16:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 16:16:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2018-02-04 16:16:55,202 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 1357 [2018-02-04 16:16:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:55,203 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2018-02-04 16:16:55,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2018-02-04 16:16:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-02-04 16:16:55,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:55,212 INFO L351 BasicCegarLoop]: trace histogram [203, 182, 182, 182, 182, 182, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:55,212 INFO L371 AbstractCegarLoop]: === Iteration 89 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash -447877926, now seen corresponding path program 80 times [2018-02-04 16:16:55,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:55,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 109032 backedges. 17090 proven. 752 refuted. 0 times theorem prover too weak. 91190 trivial. 0 not checked. [2018-02-04 16:16:57,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:57,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:16:57,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8361 backedges. 1031 proven. 0 refuted. 0 times theorem prover too weak. 7330 trivial. 0 not checked. [2018-02-04 16:16:57,209 INFO L182 omatonBuilderFactory]: Interpolants [62240#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 62241#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 62242#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 62243#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 62244#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 62245#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 62246#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 62247#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 62248#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 62249#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 62250#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 62251#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 62252#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 62253#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 62254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 62255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 62256#(<= |foo_#in~size| 15), 62257#(<= main_~i~1 15), 62258#(<= main_~i~1 16), 62237#true, 62238#false, 62239#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 16:16:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 109032 backedges. 17090 proven. 752 refuted. 0 times theorem prover too weak. 91190 trivial. 0 not checked. [2018-02-04 16:16:57,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:16:57,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:16:57,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:16:57,211 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand 22 states. [2018-02-04 16:16:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:57,488 INFO L93 Difference]: Finished difference Result 587 states and 1007 transitions. [2018-02-04 16:16:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:16:57,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1363 [2018-02-04 16:16:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:57,491 INFO L225 Difference]: With dead ends: 587 [2018-02-04 16:16:57,491 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 16:16:57,491 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:16:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 16:16:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 408. [2018-02-04 16:16:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 16:16:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 581 transitions. [2018-02-04 16:16:57,497 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 581 transitions. Word has length 1363 [2018-02-04 16:16:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:57,497 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 581 transitions. [2018-02-04 16:16:57,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:16:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 581 transitions. [2018-02-04 16:16:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1370 [2018-02-04 16:16:57,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:16:57,506 INFO L351 BasicCegarLoop]: trace histogram [204, 183, 183, 183, 183, 183, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:16:57,506 INFO L371 AbstractCegarLoop]: === Iteration 90 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:16:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1490364706, now seen corresponding path program 81 times [2018-02-04 16:16:57,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:16:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:16:57,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:16:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 110166 backedges. 3655 proven. 7711 refuted. 0 times theorem prover too weak. 98800 trivial. 0 not checked. [2018-02-04 16:16:59,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:16:59,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:16:59,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:16:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8358 backedges. 283 proven. 634 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-02-04 16:16:59,489 INFO L182 omatonBuilderFactory]: Interpolants [63296#(<= 6 main_~i~1), 63297#(<= 7 main_~i~1), 63298#(<= 8 main_~i~1), 63299#(<= 9 main_~i~1), 63300#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 63301#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 63302#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 63303#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 63304#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 63305#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 63306#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 63307#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 63308#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 63309#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 63310#(<= |foo_#in~size| 8), 63288#true, 63289#false, 63290#(<= 0 main_~i~1), 63291#(<= 1 main_~i~1), 63292#(<= 2 main_~i~1), 63293#(<= 3 main_~i~1), 63294#(<= 4 main_~i~1), 63295#(<= 5 main_~i~1)] [2018-02-04 16:16:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 110166 backedges. 3655 proven. 7711 refuted. 0 times theorem prover too weak. 98800 trivial. 0 not checked. [2018-02-04 16:16:59,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:16:59,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:16:59,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:16:59,491 INFO L87 Difference]: Start difference. First operand 408 states and 581 transitions. Second operand 23 states. [2018-02-04 16:16:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:16:59,987 INFO L93 Difference]: Finished difference Result 456 states and 627 transitions. [2018-02-04 16:16:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:16:59,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1369 [2018-02-04 16:16:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:16:59,988 INFO L225 Difference]: With dead ends: 456 [2018-02-04 16:16:59,988 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 16:16:59,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:16:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 16:16:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 411. [2018-02-04 16:16:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 16:16:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 591 transitions. [2018-02-04 16:16:59,995 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 591 transitions. Word has length 1369 [2018-02-04 16:16:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:16:59,995 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 591 transitions. [2018-02-04 16:16:59,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:16:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 591 transitions. [2018-02-04 16:17:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-02-04 16:17:00,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:00,004 INFO L351 BasicCegarLoop]: trace histogram [211, 190, 190, 190, 190, 190, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:00,004 INFO L371 AbstractCegarLoop]: === Iteration 91 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash 883233050, now seen corresponding path program 82 times [2018-02-04 16:17:00,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:00,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 118272 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 116970 trivial. 0 not checked. [2018-02-04 16:17:02,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:02,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:02,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-02-04 16:17:02,161 INFO L182 omatonBuilderFactory]: Interpolants [64196#true, 64197#false, 64198#(= main_~i~1 0), 64199#(<= main_~i~1 1), 64200#(<= main_~i~1 2), 64201#(<= main_~i~1 3), 64202#(<= main_~i~1 4), 64203#(<= main_~i~1 5), 64204#(<= main_~i~1 6), 64205#(<= main_~i~1 7), 64206#(<= main_~i~1 8), 64207#(<= main_~i~1 9), 64208#(<= main_~i~1 10), 64209#(<= main_~i~1 11), 64210#(<= main_~i~1 12), 64211#(<= main_~i~1 13), 64212#(<= main_~i~1 14), 64213#(<= main_~i~1 15), 64214#(<= main_~i~1 16), 64215#(<= main_~i~1 17), 64216#(<= main_~i~1 18), 64217#(<= main_~i~1 19), 64218#(<= main_~i~1 20), 64219#(<= main_~i~1 21)] [2018-02-04 16:17:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 118272 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 116970 trivial. 0 not checked. [2018-02-04 16:17:02,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:02,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:02,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:02,164 INFO L87 Difference]: Start difference. First operand 411 states and 591 transitions. Second operand 24 states. [2018-02-04 16:17:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:02,380 INFO L93 Difference]: Finished difference Result 665 states and 945 transitions. [2018-02-04 16:17:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:17:02,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1411 [2018-02-04 16:17:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:02,383 INFO L225 Difference]: With dead ends: 665 [2018-02-04 16:17:02,383 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 16:17:02,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 16:17:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 422. [2018-02-04 16:17:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:02,388 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1411 [2018-02-04 16:17:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:02,389 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:02,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2018-02-04 16:17:02,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:02,398 INFO L351 BasicCegarLoop]: trace histogram [222, 200, 200, 200, 200, 200, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:02,398 INFO L371 AbstractCegarLoop]: === Iteration 92 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1481703445, now seen corresponding path program 83 times [2018-02-04 16:17:02,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:02,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 131016 backedges. 8096 proven. 5145 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:04,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:04,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:17:04,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9738 backedges. 735 proven. 310 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:04,601 INFO L182 omatonBuilderFactory]: Interpolants [65312#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 65313#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 65314#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 65315#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 65316#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 65317#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 65318#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 65319#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 65320#(<= |foo_#in~size| 9), 65321#(<= main_~i~1 9), 65322#(<= main_~i~1 10), 65323#(<= main_~i~1 11), 65324#(<= main_~i~1 12), 65325#(<= main_~i~1 13), 65326#(<= main_~i~1 14), 65327#(<= main_~i~1 15), 65307#true, 65308#false, 65309#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 65310#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 65311#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:17:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 131016 backedges. 8096 proven. 5145 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:04,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 16:17:04,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 16:17:04,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:17:04,602 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 21 states. [2018-02-04 16:17:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:04,867 INFO L93 Difference]: Finished difference Result 1064 states and 2012 transitions. [2018-02-04 16:17:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 16:17:04,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1483 [2018-02-04 16:17:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:04,872 INFO L225 Difference]: With dead ends: 1064 [2018-02-04 16:17:04,873 INFO L226 Difference]: Without dead ends: 1064 [2018-02-04 16:17:04,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:17:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2018-02-04 16:17:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 425. [2018-02-04 16:17:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 16:17:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 632 transitions. [2018-02-04 16:17:04,885 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 632 transitions. Word has length 1483 [2018-02-04 16:17:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:04,885 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 632 transitions. [2018-02-04 16:17:04,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 16:17:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 632 transitions. [2018-02-04 16:17:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1490 [2018-02-04 16:17:04,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:04,894 INFO L351 BasicCegarLoop]: trace histogram [223, 201, 201, 201, 201, 201, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:04,894 INFO L371 AbstractCegarLoop]: === Iteration 93 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1301125325, now seen corresponding path program 84 times [2018-02-04 16:17:04,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:04,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 132260 backedges. 8818 proven. 5667 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:07,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:07,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:17:07,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9747 backedges. 714 proven. 340 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:07,194 INFO L182 omatonBuilderFactory]: Interpolants [66849#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 66848#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 66851#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 66850#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 66853#(<= |foo_#in~size| 10), 66852#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 66855#(<= main_~i~1 11), 66854#(<= main_~i~1 10), 66857#(<= main_~i~1 13), 66856#(<= main_~i~1 12), 66859#(<= main_~i~1 15), 66858#(<= main_~i~1 14), 66860#(<= main_~i~1 16), 66839#true, 66841#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 66840#false, 66843#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 66842#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 66845#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 66844#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 66847#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 66846#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5))] [2018-02-04 16:17:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 132260 backedges. 8818 proven. 5667 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:07,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:17:07,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:17:07,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:17:07,196 INFO L87 Difference]: Start difference. First operand 425 states and 632 transitions. Second operand 22 states. [2018-02-04 16:17:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:07,450 INFO L93 Difference]: Finished difference Result 1067 states and 2130 transitions. [2018-02-04 16:17:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:17:07,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1489 [2018-02-04 16:17:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:07,455 INFO L225 Difference]: With dead ends: 1067 [2018-02-04 16:17:07,455 INFO L226 Difference]: Without dead ends: 1067 [2018-02-04 16:17:07,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:17:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-02-04 16:17:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 425. [2018-02-04 16:17:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 16:17:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 632 transitions. [2018-02-04 16:17:07,469 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 632 transitions. Word has length 1489 [2018-02-04 16:17:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:07,469 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 632 transitions. [2018-02-04 16:17:07,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:17:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 632 transitions. [2018-02-04 16:17:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2018-02-04 16:17:07,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:07,479 INFO L351 BasicCegarLoop]: trace histogram [224, 202, 202, 202, 202, 202, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:07,479 INFO L371 AbstractCegarLoop]: === Iteration 94 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -510838661, now seen corresponding path program 85 times [2018-02-04 16:17:07,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:07,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 133510 backedges. 9540 proven. 6195 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:09,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:09,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:09,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 714 proven. 370 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:09,846 INFO L182 omatonBuilderFactory]: Interpolants [68385#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 68384#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 68387#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 68386#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 68389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 68388#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 68391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 68390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 68393#(<= main_~i~1 11), 68392#(<= |foo_#in~size| 11), 68395#(<= main_~i~1 13), 68394#(<= main_~i~1 12), 68397#(<= main_~i~1 15), 68396#(<= main_~i~1 14), 68399#(<= main_~i~1 17), 68398#(<= main_~i~1 16), 68377#true, 68379#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 68378#false, 68381#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 68380#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 68383#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 68382#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 16:17:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 133510 backedges. 9540 proven. 6195 refuted. 0 times theorem prover too weak. 117775 trivial. 0 not checked. [2018-02-04 16:17:09,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:09,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:09,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:09,848 INFO L87 Difference]: Start difference. First operand 425 states and 632 transitions. Second operand 23 states. [2018-02-04 16:17:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:10,139 INFO L93 Difference]: Finished difference Result 1067 states and 2130 transitions. [2018-02-04 16:17:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 16:17:10,139 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1495 [2018-02-04 16:17:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:10,143 INFO L225 Difference]: With dead ends: 1067 [2018-02-04 16:17:10,144 INFO L226 Difference]: Without dead ends: 1067 [2018-02-04 16:17:10,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:17:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-02-04 16:17:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 422. [2018-02-04 16:17:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:10,157 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1495 [2018-02-04 16:17:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:10,158 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:10,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1502 [2018-02-04 16:17:10,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:10,167 INFO L351 BasicCegarLoop]: trace histogram [225, 203, 203, 203, 203, 203, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:10,167 INFO L371 AbstractCegarLoop]: === Iteration 95 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1404570685, now seen corresponding path program 86 times [2018-02-04 16:17:10,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:10,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 134766 backedges. 11261 proven. 5630 refuted. 0 times theorem prover too weak. 117875 trivial. 0 not checked. [2018-02-04 16:17:12,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:12,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:12,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9810 backedges. 797 proven. 320 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:12,542 INFO L182 omatonBuilderFactory]: Interpolants [69921#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 69920#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 69923#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 69922#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 69925#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 69924#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 69927#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 69926#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 69929#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 69928#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 69931#(<= |foo_#in~size| 12), 69930#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 69933#(<= main_~i~1 13), 69932#(<= main_~i~1 12), 69935#(<= main_~i~1 15), 69934#(<= main_~i~1 14), 69937#(<= main_~i~1 17), 69936#(<= main_~i~1 16), 69915#true, 69917#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 69916#false, 69919#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 69918#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1))] [2018-02-04 16:17:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 134766 backedges. 11261 proven. 5630 refuted. 0 times theorem prover too weak. 117875 trivial. 0 not checked. [2018-02-04 16:17:12,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:12,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:12,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:12,544 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 23 states. [2018-02-04 16:17:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:12,827 INFO L93 Difference]: Finished difference Result 998 states and 1971 transitions. [2018-02-04 16:17:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:17:12,827 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1501 [2018-02-04 16:17:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:12,832 INFO L225 Difference]: With dead ends: 998 [2018-02-04 16:17:12,832 INFO L226 Difference]: Without dead ends: 998 [2018-02-04 16:17:12,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=387, Invalid=945, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:17:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-02-04 16:17:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 422. [2018-02-04 16:17:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:12,844 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1501 [2018-02-04 16:17:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:12,845 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:12,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1508 [2018-02-04 16:17:12,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:12,854 INFO L351 BasicCegarLoop]: trace histogram [226, 204, 204, 204, 204, 204, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:12,854 INFO L371 AbstractCegarLoop]: === Iteration 96 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1448411211, now seen corresponding path program 87 times [2018-02-04 16:17:12,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:12,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 136028 backedges. 13216 proven. 4831 refuted. 0 times theorem prover too weak. 117981 trivial. 0 not checked. [2018-02-04 16:17:15,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:15,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:15,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9834 backedges. 883 proven. 258 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:15,301 INFO L182 omatonBuilderFactory]: Interpolants [71393#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 71392#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 71395#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 71394#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 71397#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 71396#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 71399#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 71398#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 71401#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 71400#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 71403#(<= |foo_#in~size| 13), 71402#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 71405#(<= main_~i~1 14), 71404#(<= main_~i~1 13), 71407#(<= main_~i~1 16), 71406#(<= main_~i~1 15), 71408#(<= main_~i~1 17), 71387#false, 71386#true, 71389#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 71388#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 71391#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 71390#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:17:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 136028 backedges. 13216 proven. 4831 refuted. 0 times theorem prover too weak. 117981 trivial. 0 not checked. [2018-02-04 16:17:15,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:15,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:15,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:15,303 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 23 states. [2018-02-04 16:17:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:15,582 INFO L93 Difference]: Finished difference Result 917 states and 1781 transitions. [2018-02-04 16:17:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 16:17:15,582 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1507 [2018-02-04 16:17:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:15,587 INFO L225 Difference]: With dead ends: 917 [2018-02-04 16:17:15,587 INFO L226 Difference]: Without dead ends: 917 [2018-02-04 16:17:15,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:17:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-02-04 16:17:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 422. [2018-02-04 16:17:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:15,598 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1507 [2018-02-04 16:17:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:15,598 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:15,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1514 [2018-02-04 16:17:15,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:15,607 INFO L351 BasicCegarLoop]: trace histogram [227, 205, 205, 205, 205, 205, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:15,607 INFO L371 AbstractCegarLoop]: === Iteration 97 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1680933357, now seen corresponding path program 88 times [2018-02-04 16:17:15,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:15,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 137296 backedges. 15423 proven. 3780 refuted. 0 times theorem prover too weak. 118093 trivial. 0 not checked. [2018-02-04 16:17:18,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:18,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:18,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9852 backedges. 975 proven. 184 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:18,015 INFO L182 omatonBuilderFactory]: Interpolants [72800#(<= main_~i~1 17), 72779#false, 72778#true, 72781#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 72780#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 72783#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 72782#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 72785#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 72784#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 72787#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 72786#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 72789#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 72788#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 72791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 72790#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 72793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 72792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 72795#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 72794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 72797#(<= main_~i~1 14), 72796#(<= |foo_#in~size| 14), 72799#(<= main_~i~1 16), 72798#(<= main_~i~1 15)] [2018-02-04 16:17:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 137296 backedges. 15423 proven. 3780 refuted. 0 times theorem prover too weak. 118093 trivial. 0 not checked. [2018-02-04 16:17:18,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:18,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:18,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:18,017 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 23 states. [2018-02-04 16:17:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:18,295 INFO L93 Difference]: Finished difference Result 824 states and 1559 transitions. [2018-02-04 16:17:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:17:18,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1513 [2018-02-04 16:17:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:18,299 INFO L225 Difference]: With dead ends: 824 [2018-02-04 16:17:18,299 INFO L226 Difference]: Without dead ends: 824 [2018-02-04 16:17:18,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=473, Invalid=1009, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:17:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-02-04 16:17:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 422. [2018-02-04 16:17:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:18,309 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1513 [2018-02-04 16:17:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:18,309 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:18,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1520 [2018-02-04 16:17:18,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:18,318 INFO L351 BasicCegarLoop]: trace histogram [228, 206, 206, 206, 206, 206, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:18,318 INFO L371 AbstractCegarLoop]: === Iteration 98 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 940768539, now seen corresponding path program 89 times [2018-02-04 16:17:18,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:18,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 138570 backedges. 17900 proven. 2459 refuted. 0 times theorem prover too weak. 118211 trivial. 0 not checked. [2018-02-04 16:17:20,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:20,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:20,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9864 backedges. 1073 proven. 98 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:20,775 INFO L182 omatonBuilderFactory]: Interpolants [74081#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 74080#false, 74083#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 74082#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 74085#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 74084#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 74087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 74086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 74089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 74088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 74091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 74090#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 74093#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 74092#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 74095#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 74094#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 74097#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 74096#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 74099#(<= main_~i~1 15), 74098#(<= |foo_#in~size| 15), 74101#(<= main_~i~1 17), 74100#(<= main_~i~1 16), 74079#true] [2018-02-04 16:17:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 138570 backedges. 17900 proven. 2459 refuted. 0 times theorem prover too weak. 118211 trivial. 0 not checked. [2018-02-04 16:17:20,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:20,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:20,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:20,777 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 23 states. [2018-02-04 16:17:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:21,064 INFO L93 Difference]: Finished difference Result 723 states and 1308 transitions. [2018-02-04 16:17:21,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 16:17:21,064 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1519 [2018-02-04 16:17:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:21,068 INFO L225 Difference]: With dead ends: 723 [2018-02-04 16:17:21,068 INFO L226 Difference]: Without dead ends: 723 [2018-02-04 16:17:21,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=522, Invalid=1038, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:17:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-02-04 16:17:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 422. [2018-02-04 16:17:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 16:17:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2018-02-04 16:17:21,076 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 1519 [2018-02-04 16:17:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:21,076 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2018-02-04 16:17:21,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2018-02-04 16:17:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1526 [2018-02-04 16:17:21,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:21,086 INFO L351 BasicCegarLoop]: trace histogram [229, 207, 207, 207, 207, 207, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:21,086 INFO L371 AbstractCegarLoop]: === Iteration 99 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash -638812829, now seen corresponding path program 90 times [2018-02-04 16:17:21,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:21,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 139850 backedges. 20665 proven. 850 refuted. 0 times theorem prover too weak. 118335 trivial. 0 not checked. [2018-02-04 16:17:23,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:23,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:23,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 1177 proven. 0 refuted. 0 times theorem prover too weak. 8693 trivial. 0 not checked. [2018-02-04 16:17:23,582 INFO L182 omatonBuilderFactory]: Interpolants [75297#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 75296#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 75299#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 75298#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 75301#(<= |foo_#in~size| 16), 75300#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 75303#(<= main_~i~1 17), 75302#(<= main_~i~1 16), 75281#true, 75283#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 75282#false, 75285#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 75284#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 75287#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 75286#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 75289#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 75288#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 75291#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 75290#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 75293#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 75292#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 75295#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 75294#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11))] [2018-02-04 16:17:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 139850 backedges. 20665 proven. 850 refuted. 0 times theorem prover too weak. 118335 trivial. 0 not checked. [2018-02-04 16:17:23,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:23,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:23,584 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand 23 states. [2018-02-04 16:17:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:23,877 INFO L93 Difference]: Finished difference Result 615 states and 1069 transitions. [2018-02-04 16:17:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 16:17:23,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1525 [2018-02-04 16:17:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:23,879 INFO L225 Difference]: With dead ends: 615 [2018-02-04 16:17:23,879 INFO L226 Difference]: Without dead ends: 615 [2018-02-04 16:17:23,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:17:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-04 16:17:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 431. [2018-02-04 16:17:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-04 16:17:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 639 transitions. [2018-02-04 16:17:23,886 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 639 transitions. Word has length 1525 [2018-02-04 16:17:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:23,886 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 639 transitions. [2018-02-04 16:17:23,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 639 transitions. [2018-02-04 16:17:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1532 [2018-02-04 16:17:23,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:23,896 INFO L351 BasicCegarLoop]: trace histogram [230, 208, 208, 208, 208, 208, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:23,896 INFO L371 AbstractCegarLoop]: === Iteration 100 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1350734101, now seen corresponding path program 91 times [2018-02-04 16:17:23,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:23,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 141136 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 139706 trivial. 0 not checked. [2018-02-04 16:17:26,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:26,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:17:26,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9867 trivial. 0 not checked. [2018-02-04 16:17:26,456 INFO L182 omatonBuilderFactory]: Interpolants [76387#false, 76386#true, 76389#(<= main_~i~1 1), 76388#(= main_~i~1 0), 76391#(<= main_~i~1 3), 76390#(<= main_~i~1 2), 76393#(<= main_~i~1 5), 76392#(<= main_~i~1 4), 76395#(<= main_~i~1 7), 76394#(<= main_~i~1 6), 76397#(<= main_~i~1 9), 76396#(<= main_~i~1 8), 76399#(<= main_~i~1 11), 76398#(<= main_~i~1 10), 76401#(<= main_~i~1 13), 76400#(<= main_~i~1 12), 76403#(<= main_~i~1 15), 76402#(<= main_~i~1 14), 76405#(<= main_~i~1 17), 76404#(<= main_~i~1 16), 76407#(<= main_~i~1 19), 76406#(<= main_~i~1 18), 76409#(<= main_~i~1 21), 76408#(<= main_~i~1 20), 76410#(<= main_~i~1 22)] [2018-02-04 16:17:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 141136 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 139706 trivial. 0 not checked. [2018-02-04 16:17:26,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:17:26,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:17:26,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:17:26,457 INFO L87 Difference]: Start difference. First operand 431 states and 639 transitions. Second operand 25 states. [2018-02-04 16:17:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:26,669 INFO L93 Difference]: Finished difference Result 734 states and 1110 transitions. [2018-02-04 16:17:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:17:26,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1531 [2018-02-04 16:17:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:26,672 INFO L225 Difference]: With dead ends: 734 [2018-02-04 16:17:26,672 INFO L226 Difference]: Without dead ends: 734 [2018-02-04 16:17:26,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:17:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-02-04 16:17:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 442. [2018-02-04 16:17:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:26,678 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1531 [2018-02-04 16:17:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:26,679 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:26,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:17:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1604 [2018-02-04 16:17:26,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:26,688 INFO L351 BasicCegarLoop]: trace histogram [241, 218, 218, 218, 218, 218, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:26,688 INFO L371 AbstractCegarLoop]: === Iteration 101 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1118196036, now seen corresponding path program 92 times [2018-02-04 16:17:26,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:26,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 155028 backedges. 8196 proven. 6320 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:29,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:29,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:17:29,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10995 backedges. 735 proven. 372 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:29,282 INFO L182 omatonBuilderFactory]: Interpolants [77601#(<= main_~i~1 9), 77600#(<= |foo_#in~size| 9), 77603#(<= main_~i~1 11), 77602#(<= main_~i~1 10), 77605#(<= main_~i~1 13), 77604#(<= main_~i~1 12), 77607#(<= main_~i~1 15), 77606#(<= main_~i~1 14), 77608#(<= main_~i~1 16), 77587#true, 77589#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 77588#false, 77591#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 77590#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 77593#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 77592#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 77595#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 77594#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 77597#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 77596#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 77599#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 77598#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9))] [2018-02-04 16:17:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 155028 backedges. 8196 proven. 6320 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:29,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:17:29,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:17:29,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:17:29,284 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 22 states. [2018-02-04 16:17:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:29,569 INFO L93 Difference]: Finished difference Result 1185 states and 2386 transitions. [2018-02-04 16:17:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:17:29,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1603 [2018-02-04 16:17:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:29,575 INFO L225 Difference]: With dead ends: 1185 [2018-02-04 16:17:29,575 INFO L226 Difference]: Without dead ends: 1185 [2018-02-04 16:17:29,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 16:17:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-02-04 16:17:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 445. [2018-02-04 16:17:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 16:17:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 682 transitions. [2018-02-04 16:17:29,591 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 682 transitions. Word has length 1603 [2018-02-04 16:17:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:29,592 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 682 transitions. [2018-02-04 16:17:29,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:17:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 682 transitions. [2018-02-04 16:17:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1610 [2018-02-04 16:17:29,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:29,602 INFO L351 BasicCegarLoop]: trace histogram [242, 219, 219, 219, 219, 219, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:29,602 INFO L371 AbstractCegarLoop]: === Iteration 102 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1128291844, now seen corresponding path program 93 times [2018-02-04 16:17:29,603 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:29,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 156382 backedges. 8918 proven. 6952 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:32,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:32,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:17:32,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11010 backedges. 714 proven. 408 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:32,330 INFO L182 omatonBuilderFactory]: Interpolants [79265#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 79264#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 79267#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 79266#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 79269#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 79268#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 79271#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 79270#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 79273#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 79272#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 79275#(<= |foo_#in~size| 10), 79274#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 79277#(<= main_~i~1 11), 79276#(<= main_~i~1 10), 79279#(<= main_~i~1 13), 79278#(<= main_~i~1 12), 79281#(<= main_~i~1 15), 79280#(<= main_~i~1 14), 79283#(<= main_~i~1 17), 79282#(<= main_~i~1 16), 79261#true, 79263#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 79262#false] [2018-02-04 16:17:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 156382 backedges. 8918 proven. 6952 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:32,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:17:32,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:17:32,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:17:32,332 INFO L87 Difference]: Start difference. First operand 445 states and 682 transitions. Second operand 23 states. [2018-02-04 16:17:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:32,609 INFO L93 Difference]: Finished difference Result 1188 states and 2521 transitions. [2018-02-04 16:17:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:17:32,609 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1609 [2018-02-04 16:17:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:32,614 INFO L225 Difference]: With dead ends: 1188 [2018-02-04 16:17:32,615 INFO L226 Difference]: Without dead ends: 1188 [2018-02-04 16:17:32,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:17:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-02-04 16:17:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 445. [2018-02-04 16:17:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 16:17:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 682 transitions. [2018-02-04 16:17:32,630 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 682 transitions. Word has length 1609 [2018-02-04 16:17:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:32,631 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 682 transitions. [2018-02-04 16:17:32,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:17:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 682 transitions. [2018-02-04 16:17:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1616 [2018-02-04 16:17:32,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:32,641 INFO L351 BasicCegarLoop]: trace histogram [243, 220, 220, 220, 220, 220, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:32,641 INFO L371 AbstractCegarLoop]: === Iteration 103 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2014808244, now seen corresponding path program 94 times [2018-02-04 16:17:32,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:32,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 157742 backedges. 9640 proven. 7590 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:35,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:35,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:35,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11046 backedges. 714 proven. 444 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:35,459 INFO L182 omatonBuilderFactory]: Interpolants [80961#(<= main_~i~1 15), 80960#(<= main_~i~1 14), 80963#(<= main_~i~1 17), 80962#(<= main_~i~1 16), 80964#(<= main_~i~1 18), 80941#true, 80943#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 80942#false, 80945#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 80944#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 80947#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 80946#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 80949#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 80948#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 80951#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 80950#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 80953#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 80952#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 80955#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 80954#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 80957#(<= main_~i~1 11), 80956#(<= |foo_#in~size| 11), 80959#(<= main_~i~1 13), 80958#(<= main_~i~1 12)] [2018-02-04 16:17:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 157742 backedges. 9640 proven. 7590 refuted. 0 times theorem prover too weak. 140512 trivial. 0 not checked. [2018-02-04 16:17:35,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:35,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:35,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:35,462 INFO L87 Difference]: Start difference. First operand 445 states and 682 transitions. Second operand 24 states. [2018-02-04 16:17:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:35,771 INFO L93 Difference]: Finished difference Result 1188 states and 2521 transitions. [2018-02-04 16:17:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:17:35,771 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1615 [2018-02-04 16:17:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:35,777 INFO L225 Difference]: With dead ends: 1188 [2018-02-04 16:17:35,777 INFO L226 Difference]: Without dead ends: 1188 [2018-02-04 16:17:35,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:17:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-02-04 16:17:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 442. [2018-02-04 16:17:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:35,794 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1615 [2018-02-04 16:17:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:35,794 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:35,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-02-04 16:17:35,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:35,805 INFO L351 BasicCegarLoop]: trace histogram [244, 221, 221, 221, 221, 221, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:35,805 INFO L371 AbstractCegarLoop]: === Iteration 104 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 186284692, now seen corresponding path program 95 times [2018-02-04 16:17:35,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:35,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 159108 backedges. 11367 proven. 7129 refuted. 0 times theorem prover too weak. 140612 trivial. 0 not checked. [2018-02-04 16:17:38,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:38,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:38,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11085 backedges. 797 proven. 400 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:38,911 INFO L182 omatonBuilderFactory]: Interpolants [82625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 82624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 82627#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 82626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 82629#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 82628#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 82631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 82630#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 82633#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 82632#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 82635#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 82634#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 82637#(<= |foo_#in~size| 12), 82636#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 82639#(<= main_~i~1 13), 82638#(<= main_~i~1 12), 82641#(<= main_~i~1 15), 82640#(<= main_~i~1 14), 82643#(<= main_~i~1 17), 82642#(<= main_~i~1 16), 82644#(<= main_~i~1 18), 82621#true, 82623#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 82622#false] [2018-02-04 16:17:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 159108 backedges. 11367 proven. 7129 refuted. 0 times theorem prover too weak. 140612 trivial. 0 not checked. [2018-02-04 16:17:38,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:38,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:38,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:38,913 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:39,190 INFO L93 Difference]: Finished difference Result 1125 states and 2368 transitions. [2018-02-04 16:17:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 16:17:39,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1621 [2018-02-04 16:17:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:39,196 INFO L225 Difference]: With dead ends: 1125 [2018-02-04 16:17:39,196 INFO L226 Difference]: Without dead ends: 1125 [2018-02-04 16:17:39,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:17:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-02-04 16:17:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 442. [2018-02-04 16:17:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:39,212 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1621 [2018-02-04 16:17:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:39,213 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:39,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1628 [2018-02-04 16:17:39,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:39,223 INFO L351 BasicCegarLoop]: trace histogram [245, 222, 222, 222, 222, 222, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:39,223 INFO L371 AbstractCegarLoop]: === Iteration 105 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2041573604, now seen corresponding path program 96 times [2018-02-04 16:17:39,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:39,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 160480 backedges. 13328 proven. 6434 refuted. 0 times theorem prover too weak. 140718 trivial. 0 not checked. [2018-02-04 16:17:42,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:42,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:42,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11115 backedges. 883 proven. 344 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:42,080 INFO L182 omatonBuilderFactory]: Interpolants [84257#(<= |foo_#in~size| 13), 84256#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 84259#(<= main_~i~1 14), 84258#(<= main_~i~1 13), 84261#(<= main_~i~1 16), 84260#(<= main_~i~1 15), 84263#(<= main_~i~1 18), 84262#(<= main_~i~1 17), 84241#false, 84240#true, 84243#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 84242#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 84245#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 84244#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 84247#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 84246#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 84249#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 84248#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 84251#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 84250#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 84253#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 84252#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 84255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 84254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12))] [2018-02-04 16:17:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 160480 backedges. 13328 proven. 6434 refuted. 0 times theorem prover too weak. 140718 trivial. 0 not checked. [2018-02-04 16:17:42,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:42,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:42,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:42,082 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:42,348 INFO L93 Difference]: Finished difference Result 1050 states and 2183 transitions. [2018-02-04 16:17:42,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:17:42,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1627 [2018-02-04 16:17:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:42,353 INFO L225 Difference]: With dead ends: 1050 [2018-02-04 16:17:42,353 INFO L226 Difference]: Without dead ends: 1050 [2018-02-04 16:17:42,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:17:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2018-02-04 16:17:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 442. [2018-02-04 16:17:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:42,367 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1627 [2018-02-04 16:17:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:42,368 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:42,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1634 [2018-02-04 16:17:42,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:42,378 INFO L351 BasicCegarLoop]: trace histogram [246, 223, 223, 223, 223, 223, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:42,378 INFO L371 AbstractCegarLoop]: === Iteration 106 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash 4445412, now seen corresponding path program 97 times [2018-02-04 16:17:42,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:42,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 161858 backedges. 15541 proven. 5487 refuted. 0 times theorem prover too weak. 140830 trivial. 0 not checked. [2018-02-04 16:17:45,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:45,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:45,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 975 proven. 276 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:45,277 INFO L182 omatonBuilderFactory]: Interpolants [85793#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 85792#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 85795#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 85794#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 85797#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 85796#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 85799#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 85798#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 85801#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 85800#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 85803#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 85802#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 85805#(<= main_~i~1 14), 85804#(<= |foo_#in~size| 14), 85807#(<= main_~i~1 16), 85806#(<= main_~i~1 15), 85809#(<= main_~i~1 18), 85808#(<= main_~i~1 17), 85787#false, 85786#true, 85789#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 85788#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 85791#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 85790#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2))] [2018-02-04 16:17:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 161858 backedges. 15541 proven. 5487 refuted. 0 times theorem prover too weak. 140830 trivial. 0 not checked. [2018-02-04 16:17:45,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:45,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:45,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:45,279 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:45,605 INFO L93 Difference]: Finished difference Result 963 states and 1965 transitions. [2018-02-04 16:17:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 16:17:45,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1633 [2018-02-04 16:17:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:45,610 INFO L225 Difference]: With dead ends: 963 [2018-02-04 16:17:45,610 INFO L226 Difference]: Without dead ends: 963 [2018-02-04 16:17:45,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=479, Invalid=1081, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:17:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-02-04 16:17:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 442. [2018-02-04 16:17:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:45,622 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1633 [2018-02-04 16:17:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:45,623 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:45,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1640 [2018-02-04 16:17:45,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:45,633 INFO L351 BasicCegarLoop]: trace histogram [247, 224, 224, 224, 224, 224, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:45,633 INFO L371 AbstractCegarLoop]: === Iteration 107 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -916268052, now seen corresponding path program 98 times [2018-02-04 16:17:45,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:45,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 163242 backedges. 18024 proven. 4270 refuted. 0 times theorem prover too weak. 140948 trivial. 0 not checked. [2018-02-04 16:17:48,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:48,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:48,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11157 backedges. 1073 proven. 196 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:48,548 INFO L182 omatonBuilderFactory]: Interpolants [87265#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 87264#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 87267#(<= main_~i~1 15), 87266#(<= |foo_#in~size| 15), 87269#(<= main_~i~1 17), 87268#(<= main_~i~1 16), 87270#(<= main_~i~1 18), 87247#true, 87249#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 87248#false, 87251#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 87250#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 87253#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 87252#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 87255#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 87254#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 87257#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 87256#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 87259#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 87258#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 87261#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 87260#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 87263#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 87262#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13))] [2018-02-04 16:17:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 163242 backedges. 18024 proven. 4270 refuted. 0 times theorem prover too weak. 140948 trivial. 0 not checked. [2018-02-04 16:17:48,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:48,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:48,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:48,550 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:48,825 INFO L93 Difference]: Finished difference Result 864 states and 1713 transitions. [2018-02-04 16:17:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 16:17:48,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1639 [2018-02-04 16:17:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:48,829 INFO L225 Difference]: With dead ends: 864 [2018-02-04 16:17:48,829 INFO L226 Difference]: Without dead ends: 864 [2018-02-04 16:17:48,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=1113, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:17:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-02-04 16:17:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 442. [2018-02-04 16:17:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:48,844 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1639 [2018-02-04 16:17:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:48,845 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:48,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2018-02-04 16:17:48,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:48,862 INFO L351 BasicCegarLoop]: trace histogram [248, 225, 225, 225, 225, 225, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:48,862 INFO L371 AbstractCegarLoop]: === Iteration 108 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1678203852, now seen corresponding path program 99 times [2018-02-04 16:17:48,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:48,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 164632 backedges. 20795 proven. 2765 refuted. 0 times theorem prover too weak. 141072 trivial. 0 not checked. [2018-02-04 16:17:51,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:51,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:51,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11169 backedges. 1177 proven. 104 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:51,769 INFO L182 omatonBuilderFactory]: Interpolants [88611#true, 88613#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 88612#false, 88615#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 88614#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 88617#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 88616#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 88619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 88618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 88621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 88620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 88623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 88622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 88625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 88624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 88627#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 88626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 88629#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 88628#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 88631#(<= |foo_#in~size| 16), 88630#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 88633#(<= main_~i~1 17), 88632#(<= main_~i~1 16), 88634#(<= main_~i~1 18)] [2018-02-04 16:17:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 164632 backedges. 20795 proven. 2765 refuted. 0 times theorem prover too weak. 141072 trivial. 0 not checked. [2018-02-04 16:17:51,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:51,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:51,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=351, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:51,771 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:52,046 INFO L93 Difference]: Finished difference Result 757 states and 1430 transitions. [2018-02-04 16:17:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 16:17:52,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1645 [2018-02-04 16:17:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:52,049 INFO L225 Difference]: With dead ends: 757 [2018-02-04 16:17:52,049 INFO L226 Difference]: Without dead ends: 757 [2018-02-04 16:17:52,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=579, Invalid=1143, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:17:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-02-04 16:17:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 442. [2018-02-04 16:17:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 16:17:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 658 transitions. [2018-02-04 16:17:52,058 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 658 transitions. Word has length 1645 [2018-02-04 16:17:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:52,059 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 658 transitions. [2018-02-04 16:17:52,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 658 transitions. [2018-02-04 16:17:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2018-02-04 16:17:52,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:52,070 INFO L351 BasicCegarLoop]: trace histogram [249, 226, 226, 226, 226, 226, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:52,070 INFO L371 AbstractCegarLoop]: === Iteration 109 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash 269950396, now seen corresponding path program 100 times [2018-02-04 16:17:52,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:52,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 166028 backedges. 23872 proven. 954 refuted. 0 times theorem prover too weak. 141202 trivial. 0 not checked. [2018-02-04 16:17:54,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:54,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:17:54,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2018-02-04 16:17:54,982 INFO L182 omatonBuilderFactory]: Interpolants [89889#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 89888#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 89891#(<= |foo_#in~size| 17), 89890#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 89893#(<= main_~i~1 18), 89892#(<= main_~i~1 17), 89871#false, 89870#true, 89873#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 89872#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 89875#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 89874#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 89877#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 89876#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 89879#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 89878#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 89881#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 89880#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 89883#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 89882#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 89885#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 89884#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 89887#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 89886#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14))] [2018-02-04 16:17:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 166028 backedges. 23872 proven. 954 refuted. 0 times theorem prover too weak. 141202 trivial. 0 not checked. [2018-02-04 16:17:54,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:17:54,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:17:54,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:17:54,984 INFO L87 Difference]: Start difference. First operand 442 states and 658 transitions. Second operand 24 states. [2018-02-04 16:17:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:55,257 INFO L93 Difference]: Finished difference Result 643 states and 1159 transitions. [2018-02-04 16:17:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 16:17:55,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1651 [2018-02-04 16:17:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:55,260 INFO L225 Difference]: With dead ends: 643 [2018-02-04 16:17:55,260 INFO L226 Difference]: Without dead ends: 643 [2018-02-04 16:17:55,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:17:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-04 16:17:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 451. [2018-02-04 16:17:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-02-04 16:17:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 689 transitions. [2018-02-04 16:17:55,268 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 689 transitions. Word has length 1651 [2018-02-04 16:17:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:55,268 INFO L432 AbstractCegarLoop]: Abstraction has 451 states and 689 transitions. [2018-02-04 16:17:55,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:17:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 689 transitions. [2018-02-04 16:17:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1658 [2018-02-04 16:17:55,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:55,279 INFO L351 BasicCegarLoop]: trace histogram [250, 227, 227, 227, 227, 227, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:55,279 INFO L371 AbstractCegarLoop]: === Iteration 110 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1731897476, now seen corresponding path program 101 times [2018-02-04 16:17:55,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:55,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:17:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 167430 backedges. 4780 proven. 10634 refuted. 0 times theorem prover too weak. 152016 trivial. 0 not checked. [2018-02-04 16:17:58,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:17:58,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:17:58,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:17:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11172 backedges. 345 proven. 759 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-02-04 16:17:58,295 INFO L182 omatonBuilderFactory]: Interpolants [91027#false, 91026#true, 91029#(<= 1 main_~i~1), 91028#(<= 0 main_~i~1), 91031#(<= 3 main_~i~1), 91030#(<= 2 main_~i~1), 91033#(<= 5 main_~i~1), 91032#(<= 4 main_~i~1), 91035#(<= 7 main_~i~1), 91034#(<= 6 main_~i~1), 91037#(<= 9 main_~i~1), 91036#(<= 8 main_~i~1), 91039#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 91038#(<= 10 main_~i~1), 91041#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 91040#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 91043#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 91042#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 91045#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 91044#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 91047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 91046#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 91049#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 91048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 91050#(<= |foo_#in~size| 9)] [2018-02-04 16:17:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 167430 backedges. 4780 proven. 10634 refuted. 0 times theorem prover too weak. 152016 trivial. 0 not checked. [2018-02-04 16:17:58,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:17:58,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:17:58,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:17:58,297 INFO L87 Difference]: Start difference. First operand 451 states and 689 transitions. Second operand 25 states. [2018-02-04 16:17:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:17:58,676 INFO L93 Difference]: Finished difference Result 504 states and 740 transitions. [2018-02-04 16:17:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:17:58,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1657 [2018-02-04 16:17:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:17:58,678 INFO L225 Difference]: With dead ends: 504 [2018-02-04 16:17:58,678 INFO L226 Difference]: Without dead ends: 504 [2018-02-04 16:17:58,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:17:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-04 16:17:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 454. [2018-02-04 16:17:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-04 16:17:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 700 transitions. [2018-02-04 16:17:58,682 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 700 transitions. Word has length 1657 [2018-02-04 16:17:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:17:58,682 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 700 transitions. [2018-02-04 16:17:58,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:17:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 700 transitions. [2018-02-04 16:17:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-02-04 16:17:58,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:17:58,693 INFO L351 BasicCegarLoop]: trace histogram [256, 233, 233, 233, 233, 233, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:17:58,693 INFO L371 AbstractCegarLoop]: === Iteration 111 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:17:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -553193996, now seen corresponding path program 102 times [2018-02-04 16:17:58,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:17:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:17:58,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 175968 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 174404 trivial. 0 not checked. [2018-02-04 16:18:01,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:01,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:18:01,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11496 trivial. 0 not checked. [2018-02-04 16:18:01,823 INFO L182 omatonBuilderFactory]: Interpolants [92033#(<= main_~i~1 2), 92032#(<= main_~i~1 1), 92035#(<= main_~i~1 4), 92034#(<= main_~i~1 3), 92037#(<= main_~i~1 6), 92036#(<= main_~i~1 5), 92039#(<= main_~i~1 8), 92038#(<= main_~i~1 7), 92041#(<= main_~i~1 10), 92040#(<= main_~i~1 9), 92043#(<= main_~i~1 12), 92042#(<= main_~i~1 11), 92045#(<= main_~i~1 14), 92044#(<= main_~i~1 13), 92047#(<= main_~i~1 16), 92046#(<= main_~i~1 15), 92049#(<= main_~i~1 18), 92048#(<= main_~i~1 17), 92051#(<= main_~i~1 20), 92050#(<= main_~i~1 19), 92053#(<= main_~i~1 22), 92052#(<= main_~i~1 21), 92054#(<= main_~i~1 23), 92029#true, 92031#(= main_~i~1 0), 92030#false] [2018-02-04 16:18:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 175968 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 174404 trivial. 0 not checked. [2018-02-04 16:18:01,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:18:01,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:18:01,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:18:01,825 INFO L87 Difference]: Start difference. First operand 454 states and 700 transitions. Second operand 26 states. [2018-02-04 16:18:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:02,049 INFO L93 Difference]: Finished difference Result 812 states and 1316 transitions. [2018-02-04 16:18:02,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:18:02,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1693 [2018-02-04 16:18:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:02,053 INFO L225 Difference]: With dead ends: 812 [2018-02-04 16:18:02,053 INFO L226 Difference]: Without dead ends: 812 [2018-02-04 16:18:02,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:18:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-02-04 16:18:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 465. [2018-02-04 16:18:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:02,066 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1693 [2018-02-04 16:18:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:02,067 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:02,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:18:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2018-02-04 16:18:02,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:02,080 INFO L351 BasicCegarLoop]: trace histogram [268, 244, 244, 244, 244, 244, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:02,080 INFO L371 AbstractCegarLoop]: === Iteration 112 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash -387155123, now seen corresponding path program 103 times [2018-02-04 16:18:02,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:02,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 192948 backedges. 9426 proven. 8311 refuted. 0 times theorem prover too weak. 175211 trivial. 0 not checked. [2018-02-04 16:18:05,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:05,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:18:05,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 768 proven. 476 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:05,579 INFO L182 omatonBuilderFactory]: Interpolants [93345#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 93344#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 93347#(<= main_~i~1 10), 93346#(<= |foo_#in~size| 10), 93349#(<= main_~i~1 12), 93348#(<= main_~i~1 11), 93351#(<= main_~i~1 14), 93350#(<= main_~i~1 13), 93353#(<= main_~i~1 16), 93352#(<= main_~i~1 15), 93355#(<= main_~i~1 18), 93354#(<= main_~i~1 17), 93333#false, 93332#true, 93335#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 93334#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 93337#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 93336#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 93339#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 93338#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 93341#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 93340#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 93343#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 93342#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8))] [2018-02-04 16:18:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 192948 backedges. 9426 proven. 8311 refuted. 0 times theorem prover too weak. 175211 trivial. 0 not checked. [2018-02-04 16:18:05,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:18:05,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:18:05,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:18:05,582 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 24 states. [2018-02-04 16:18:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:05,848 INFO L93 Difference]: Finished difference Result 1309 states and 2840 transitions. [2018-02-04 16:18:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 16:18:05,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1771 [2018-02-04 16:18:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:05,856 INFO L225 Difference]: With dead ends: 1309 [2018-02-04 16:18:05,857 INFO L226 Difference]: Without dead ends: 1309 [2018-02-04 16:18:05,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:18:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-02-04 16:18:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 468. [2018-02-04 16:18:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 16:18:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 745 transitions. [2018-02-04 16:18:05,878 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 745 transitions. Word has length 1771 [2018-02-04 16:18:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:05,879 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 745 transitions. [2018-02-04 16:18:05,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:18:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 745 transitions. [2018-02-04 16:18:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1778 [2018-02-04 16:18:05,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:05,891 INFO L351 BasicCegarLoop]: trace histogram [269, 245, 245, 245, 245, 245, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:05,891 INFO L371 AbstractCegarLoop]: === Iteration 113 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash 418574997, now seen corresponding path program 104 times [2018-02-04 16:18:05,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:05,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 194460 backedges. 10184 proven. 9065 refuted. 0 times theorem prover too weak. 175211 trivial. 0 not checked. [2018-02-04 16:18:09,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:09,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:09,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12786 backedges. 750 proven. 518 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:09,372 INFO L182 omatonBuilderFactory]: Interpolants [95169#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 95168#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 95171#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 95170#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 95173#(<= main_~i~1 11), 95172#(<= |foo_#in~size| 11), 95175#(<= main_~i~1 13), 95174#(<= main_~i~1 12), 95177#(<= main_~i~1 15), 95176#(<= main_~i~1 14), 95179#(<= main_~i~1 17), 95178#(<= main_~i~1 16), 95181#(<= main_~i~1 19), 95180#(<= main_~i~1 18), 95157#true, 95159#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 95158#false, 95161#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 95160#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 95163#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 95162#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 95165#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 95164#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 95167#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 95166#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7))] [2018-02-04 16:18:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 194460 backedges. 10184 proven. 9065 refuted. 0 times theorem prover too weak. 175211 trivial. 0 not checked. [2018-02-04 16:18:09,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:09,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:09,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:09,375 INFO L87 Difference]: Start difference. First operand 468 states and 745 transitions. Second operand 25 states. [2018-02-04 16:18:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:09,644 INFO L93 Difference]: Finished difference Result 1309 states and 2840 transitions. [2018-02-04 16:18:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 16:18:09,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1777 [2018-02-04 16:18:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:09,651 INFO L225 Difference]: With dead ends: 1309 [2018-02-04 16:18:09,651 INFO L226 Difference]: Without dead ends: 1309 [2018-02-04 16:18:09,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:18:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-02-04 16:18:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 465. [2018-02-04 16:18:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:09,669 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1777 [2018-02-04 16:18:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:09,669 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:09,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1784 [2018-02-04 16:18:09,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:09,682 INFO L351 BasicCegarLoop]: trace histogram [270, 246, 246, 246, 246, 246, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:09,682 INFO L371 AbstractCegarLoop]: === Iteration 114 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1832594467, now seen corresponding path program 105 times [2018-02-04 16:18:09,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:09,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 195978 backedges. 11953 proven. 8714 refuted. 0 times theorem prover too weak. 175311 trivial. 0 not checked. [2018-02-04 16:18:13,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:13,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:13,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12831 backedges. 833 proven. 480 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:13,182 INFO L182 omatonBuilderFactory]: Interpolants [96983#false, 96982#true, 96985#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 96984#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 96987#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 96986#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 96989#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 96988#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 96991#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 96990#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 96993#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 96992#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 96995#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 96994#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 96997#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 96996#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 96999#(<= main_~i~1 12), 96998#(<= |foo_#in~size| 12), 97001#(<= main_~i~1 14), 97000#(<= main_~i~1 13), 97003#(<= main_~i~1 16), 97002#(<= main_~i~1 15), 97005#(<= main_~i~1 18), 97004#(<= main_~i~1 17), 97006#(<= main_~i~1 19)] [2018-02-04 16:18:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 195978 backedges. 11953 proven. 8714 refuted. 0 times theorem prover too weak. 175311 trivial. 0 not checked. [2018-02-04 16:18:13,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:13,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:13,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:13,185 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:13,481 INFO L93 Difference]: Finished difference Result 1252 states and 2702 transitions. [2018-02-04 16:18:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:18:13,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1783 [2018-02-04 16:18:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:13,489 INFO L225 Difference]: With dead ends: 1252 [2018-02-04 16:18:13,489 INFO L226 Difference]: Without dead ends: 1252 [2018-02-04 16:18:13,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=404, Invalid=1078, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 16:18:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-02-04 16:18:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 465. [2018-02-04 16:18:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:13,506 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1783 [2018-02-04 16:18:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:13,507 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:13,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1790 [2018-02-04 16:18:13,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:13,519 INFO L351 BasicCegarLoop]: trace histogram [271, 247, 247, 247, 247, 247, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:13,519 INFO L371 AbstractCegarLoop]: === Iteration 115 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash -156723611, now seen corresponding path program 106 times [2018-02-04 16:18:13,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:13,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 197502 backedges. 13956 proven. 8129 refuted. 0 times theorem prover too weak. 175417 trivial. 0 not checked. [2018-02-04 16:18:17,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:17,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:17,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12867 backedges. 919 proven. 430 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:17,079 INFO L182 omatonBuilderFactory]: Interpolants [98753#false, 98752#true, 98755#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 98754#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 98757#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 98756#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 98759#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 98758#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 98761#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 98760#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 98763#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 98762#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 98765#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 98764#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 98767#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 98766#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 98769#(<= |foo_#in~size| 13), 98768#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 98771#(<= main_~i~1 14), 98770#(<= main_~i~1 13), 98773#(<= main_~i~1 16), 98772#(<= main_~i~1 15), 98775#(<= main_~i~1 18), 98774#(<= main_~i~1 17), 98776#(<= main_~i~1 19)] [2018-02-04 16:18:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 197502 backedges. 13956 proven. 8129 refuted. 0 times theorem prover too weak. 175417 trivial. 0 not checked. [2018-02-04 16:18:17,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:17,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:17,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:17,081 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:17,435 INFO L93 Difference]: Finished difference Result 1183 states and 2532 transitions. [2018-02-04 16:18:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 16:18:17,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1789 [2018-02-04 16:18:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:17,441 INFO L225 Difference]: With dead ends: 1183 [2018-02-04 16:18:17,441 INFO L226 Difference]: Without dead ends: 1183 [2018-02-04 16:18:17,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1117, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:18:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-02-04 16:18:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 465. [2018-02-04 16:18:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:17,458 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1789 [2018-02-04 16:18:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:17,458 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:17,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1796 [2018-02-04 16:18:17,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:17,471 INFO L351 BasicCegarLoop]: trace histogram [272, 248, 248, 248, 248, 248, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:17,471 INFO L371 AbstractCegarLoop]: === Iteration 116 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash -801056211, now seen corresponding path program 107 times [2018-02-04 16:18:17,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:17,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 199032 backedges. 16211 proven. 7292 refuted. 0 times theorem prover too weak. 175529 trivial. 0 not checked. [2018-02-04 16:18:21,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:21,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:21,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12897 backedges. 1011 proven. 368 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:21,104 INFO L182 omatonBuilderFactory]: Interpolants [100455#true, 100457#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 100456#false, 100459#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 100458#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 100461#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 100460#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 100463#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 100462#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 100465#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 100464#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 100467#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 100466#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 100469#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 100468#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 100471#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 100470#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 100473#(<= |foo_#in~size| 14), 100472#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 100475#(<= main_~i~1 15), 100474#(<= main_~i~1 14), 100477#(<= main_~i~1 17), 100476#(<= main_~i~1 16), 100479#(<= main_~i~1 19), 100478#(<= main_~i~1 18)] [2018-02-04 16:18:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 199032 backedges. 16211 proven. 7292 refuted. 0 times theorem prover too weak. 175529 trivial. 0 not checked. [2018-02-04 16:18:21,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:21,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:21,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:21,107 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:21,448 INFO L93 Difference]: Finished difference Result 1102 states and 2329 transitions. [2018-02-04 16:18:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 16:18:21,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1795 [2018-02-04 16:18:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:21,453 INFO L225 Difference]: With dead ends: 1102 [2018-02-04 16:18:21,454 INFO L226 Difference]: Without dead ends: 1102 [2018-02-04 16:18:21,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=1154, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:18:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2018-02-04 16:18:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 465. [2018-02-04 16:18:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:21,468 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1795 [2018-02-04 16:18:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:21,468 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:21,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1802 [2018-02-04 16:18:21,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:21,481 INFO L351 BasicCegarLoop]: trace histogram [273, 249, 249, 249, 249, 249, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:21,481 INFO L371 AbstractCegarLoop]: === Iteration 117 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:21,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1212240075, now seen corresponding path program 108 times [2018-02-04 16:18:21,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:21,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 200568 backedges. 18736 proven. 6185 refuted. 0 times theorem prover too weak. 175647 trivial. 0 not checked. [2018-02-04 16:18:25,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:25,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:25,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12921 backedges. 1109 proven. 294 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:25,058 INFO L182 omatonBuilderFactory]: Interpolants [102081#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 102080#false, 102083#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 102082#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 102085#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 102084#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 102087#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 102086#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 102089#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 102088#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 102091#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 102090#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 102093#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 102092#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 102095#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 102094#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 102097#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 102096#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 102099#(<= main_~i~1 15), 102098#(<= |foo_#in~size| 15), 102101#(<= main_~i~1 17), 102100#(<= main_~i~1 16), 102103#(<= main_~i~1 19), 102102#(<= main_~i~1 18), 102079#true] [2018-02-04 16:18:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 200568 backedges. 18736 proven. 6185 refuted. 0 times theorem prover too weak. 175647 trivial. 0 not checked. [2018-02-04 16:18:25,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:25,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:25,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:25,060 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:25,404 INFO L93 Difference]: Finished difference Result 1009 states and 2092 transitions. [2018-02-04 16:18:25,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 16:18:25,404 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1801 [2018-02-04 16:18:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:25,410 INFO L225 Difference]: With dead ends: 1009 [2018-02-04 16:18:25,410 INFO L226 Difference]: Without dead ends: 1009 [2018-02-04 16:18:25,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=533, Invalid=1189, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:18:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-02-04 16:18:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 465. [2018-02-04 16:18:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:25,429 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1801 [2018-02-04 16:18:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:25,430 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:25,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1808 [2018-02-04 16:18:25,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:25,444 INFO L351 BasicCegarLoop]: trace histogram [274, 250, 250, 250, 250, 250, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:25,444 INFO L371 AbstractCegarLoop]: === Iteration 118 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash -854747779, now seen corresponding path program 109 times [2018-02-04 16:18:25,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:25,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 202110 backedges. 21549 proven. 4790 refuted. 0 times theorem prover too weak. 175771 trivial. 0 not checked. [2018-02-04 16:18:29,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:29,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:29,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12939 backedges. 1213 proven. 208 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:29,029 INFO L182 omatonBuilderFactory]: Interpolants [103617#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 103616#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 103619#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 103618#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 103621#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 103620#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 103623#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 103622#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 103625#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 103624#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 103627#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 103626#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 103629#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 103628#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 103631#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 103630#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 103633#(<= main_~i~1 16), 103632#(<= |foo_#in~size| 16), 103635#(<= main_~i~1 18), 103634#(<= main_~i~1 17), 103636#(<= main_~i~1 19), 103613#false, 103612#true, 103615#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 103614#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size))] [2018-02-04 16:18:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 202110 backedges. 21549 proven. 4790 refuted. 0 times theorem prover too weak. 175771 trivial. 0 not checked. [2018-02-04 16:18:29,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:29,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:29,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:29,032 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:29,344 INFO L93 Difference]: Finished difference Result 904 states and 1820 transitions. [2018-02-04 16:18:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 16:18:29,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1807 [2018-02-04 16:18:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:29,348 INFO L225 Difference]: With dead ends: 904 [2018-02-04 16:18:29,348 INFO L226 Difference]: Without dead ends: 904 [2018-02-04 16:18:29,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=584, Invalid=1222, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:18:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-02-04 16:18:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 465. [2018-02-04 16:18:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:29,358 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1807 [2018-02-04 16:18:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:29,359 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:29,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2018-02-04 16:18:29,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:29,371 INFO L351 BasicCegarLoop]: trace histogram [275, 251, 251, 251, 251, 251, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:29,371 INFO L371 AbstractCegarLoop]: === Iteration 119 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2051310331, now seen corresponding path program 110 times [2018-02-04 16:18:29,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:29,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 203658 backedges. 24668 proven. 3089 refuted. 0 times theorem prover too weak. 175901 trivial. 0 not checked. [2018-02-04 16:18:33,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:33,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:33,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12951 backedges. 1323 proven. 110 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:33,074 INFO L182 omatonBuilderFactory]: Interpolants [105043#false, 105042#true, 105045#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 105044#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 105047#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3)), 105046#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 105049#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 105048#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 105051#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 105050#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 105053#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 105052#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 105055#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 105054#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 105057#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 105056#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 105059#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 105058#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 105061#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 105060#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 105063#(<= |foo_#in~size| 17), 105062#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 105065#(<= main_~i~1 18), 105064#(<= main_~i~1 17), 105066#(<= main_~i~1 19)] [2018-02-04 16:18:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 203658 backedges. 24668 proven. 3089 refuted. 0 times theorem prover too weak. 175901 trivial. 0 not checked. [2018-02-04 16:18:33,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:33,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:33,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=379, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:33,076 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:33,356 INFO L93 Difference]: Finished difference Result 791 states and 1516 transitions. [2018-02-04 16:18:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 16:18:33,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1813 [2018-02-04 16:18:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:33,360 INFO L225 Difference]: With dead ends: 791 [2018-02-04 16:18:33,360 INFO L226 Difference]: Without dead ends: 791 [2018-02-04 16:18:33,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=639, Invalid=1253, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 16:18:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-02-04 16:18:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 465. [2018-02-04 16:18:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-02-04 16:18:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2018-02-04 16:18:33,369 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 1813 [2018-02-04 16:18:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:33,369 INFO L432 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2018-02-04 16:18:33,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2018-02-04 16:18:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1820 [2018-02-04 16:18:33,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:33,382 INFO L351 BasicCegarLoop]: trace histogram [276, 252, 252, 252, 252, 252, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:33,382 INFO L371 AbstractCegarLoop]: === Iteration 120 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash -778254899, now seen corresponding path program 111 times [2018-02-04 16:18:33,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:33,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 205212 backedges. 28111 proven. 1064 refuted. 0 times theorem prover too weak. 176037 trivial. 0 not checked. [2018-02-04 16:18:37,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:37,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:18:37,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12957 backedges. 1439 proven. 0 refuted. 0 times theorem prover too weak. 11518 trivial. 0 not checked. [2018-02-04 16:18:37,050 INFO L182 omatonBuilderFactory]: Interpolants [106369#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 6)), 106368#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 5)), 106371#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 8)), 106370#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 7)), 106373#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 10)), 106372#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 9)), 106375#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 12)), 106374#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 11)), 106377#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 14)), 106376#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 13)), 106379#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 16)), 106378#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 15)), 106381#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 18)), 106380#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 17)), 106383#(<= |foo_#in~size| 18), 106382#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 19)), 106385#(<= main_~i~1 19), 106384#(<= main_~i~1 18), 106361#true, 106363#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 106362#false, 106365#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 2)), 106364#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 1)), 106367#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 4)), 106366#(<= (+ foo_~i~0 |foo_#in~size|) (+ foo_~size 3))] [2018-02-04 16:18:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 205212 backedges. 28111 proven. 1064 refuted. 0 times theorem prover too weak. 176037 trivial. 0 not checked. [2018-02-04 16:18:37,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:18:37,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:18:37,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:18:37,053 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand 25 states. [2018-02-04 16:18:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:37,328 INFO L93 Difference]: Finished difference Result 671 states and 1225 transitions. [2018-02-04 16:18:37,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 16:18:37,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1819 [2018-02-04 16:18:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:37,331 INFO L225 Difference]: With dead ends: 671 [2018-02-04 16:18:37,331 INFO L226 Difference]: Without dead ends: 671 [2018-02-04 16:18:37,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 16:18:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-02-04 16:18:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 474. [2018-02-04 16:18:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-02-04 16:18:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 752 transitions. [2018-02-04 16:18:37,338 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 752 transitions. Word has length 1819 [2018-02-04 16:18:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:37,339 INFO L432 AbstractCegarLoop]: Abstraction has 474 states and 752 transitions. [2018-02-04 16:18:37,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:18:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 752 transitions. [2018-02-04 16:18:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1826 [2018-02-04 16:18:37,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:37,352 INFO L351 BasicCegarLoop]: trace histogram [277, 253, 253, 253, 253, 253, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:37,352 INFO L371 AbstractCegarLoop]: === Iteration 121 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash -886292523, now seen corresponding path program 112 times [2018-02-04 16:18:37,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:37,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:18:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 206772 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 205068 trivial. 0 not checked. [2018-02-04 16:18:41,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:18:41,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:18:41,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:18:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12954 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12954 trivial. 0 not checked. [2018-02-04 16:18:41,178 INFO L182 omatonBuilderFactory]: Interpolants [107585#(<= main_~i~1 12), 107584#(<= main_~i~1 11), 107587#(<= main_~i~1 14), 107586#(<= main_~i~1 13), 107589#(<= main_~i~1 16), 107588#(<= main_~i~1 15), 107591#(<= main_~i~1 18), 107590#(<= main_~i~1 17), 107593#(<= main_~i~1 20), 107592#(<= main_~i~1 19), 107595#(<= main_~i~1 22), 107594#(<= main_~i~1 21), 107597#(<= main_~i~1 24), 107596#(<= main_~i~1 23), 107571#true, 107573#(= main_~i~1 0), 107572#false, 107575#(<= main_~i~1 2), 107574#(<= main_~i~1 1), 107577#(<= main_~i~1 4), 107576#(<= main_~i~1 3), 107579#(<= main_~i~1 6), 107578#(<= main_~i~1 5), 107581#(<= main_~i~1 8), 107580#(<= main_~i~1 7), 107583#(<= main_~i~1 10), 107582#(<= main_~i~1 9)] [2018-02-04 16:18:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 206772 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 205068 trivial. 0 not checked. [2018-02-04 16:18:41,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:18:41,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:18:41,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:18:41,180 INFO L87 Difference]: Start difference. First operand 474 states and 752 transitions. Second operand 27 states. [2018-02-04 16:18:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:18:41,380 INFO L93 Difference]: Finished difference Result 893 states and 1544 transitions. [2018-02-04 16:18:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:18:41,380 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1825 [2018-02-04 16:18:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:18:41,383 INFO L225 Difference]: With dead ends: 893 [2018-02-04 16:18:41,383 INFO L226 Difference]: Without dead ends: 893 [2018-02-04 16:18:41,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:18:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-02-04 16:18:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 485. [2018-02-04 16:18:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-04 16:18:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 773 transitions. [2018-02-04 16:18:41,391 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 773 transitions. Word has length 1825 [2018-02-04 16:18:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:18:41,391 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 773 transitions. [2018-02-04 16:18:41,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:18:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 773 transitions. [2018-02-04 16:18:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2018-02-04 16:18:41,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:18:41,405 INFO L351 BasicCegarLoop]: trace histogram [289, 264, 264, 264, 264, 264, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:18:41,405 INFO L371 AbstractCegarLoop]: === Iteration 122 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-04 16:18:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash 599976110, now seen corresponding path program 113 times [2018-02-04 16:18:41,406 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:18:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:18:41,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 16:18:43,074 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 16:18:43,077 INFO L168 Benchmark]: Toolchain (without parser) took 183990.24 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 360.9 MB in the beginning and 1.1 GB in the end (delta: -752.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-04 16:18:43,078 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:18:43,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.59 ms. Allocated memory is still 402.7 MB. Free memory was 360.9 MB in the beginning and 352.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 16:18:43,079 INFO L168 Benchmark]: Boogie Preprocessor took 26.45 ms. Allocated memory is still 402.7 MB. Free memory was 352.8 MB in the beginning and 351.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:18:43,079 INFO L168 Benchmark]: RCFGBuilder took 150.05 ms. Allocated memory is still 402.7 MB. Free memory was 350.1 MB in the beginning and 334.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:18:43,079 INFO L168 Benchmark]: TraceAbstraction took 183648.86 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.3 MB in the beginning and 1.1 GB in the end (delta: -780.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-04 16:18:43,080 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.59 ms. Allocated memory is still 402.7 MB. Free memory was 360.9 MB in the beginning and 352.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.45 ms. Allocated memory is still 402.7 MB. Free memory was 352.8 MB in the beginning and 351.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 150.05 ms. Allocated memory is still 402.7 MB. Free memory was 350.1 MB in the beginning and 334.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183648.86 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.3 MB in the beginning and 1.1 GB in the end (delta: -780.0 MB). Peak memory consumption was 2.2 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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-18-43-084.csv Completed graceful shutdown