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/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:27:35,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:27:35,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:27:35,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:27:35,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:27:35,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:27:35,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:27:35,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:27:35,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:27:35,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:27:35,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:27:35,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:27:35,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:27:35,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:27:35,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:27:35,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:27:35,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:27:35,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:27:35,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:27:35,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:27:35,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:27:35,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:27:35,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:27:35,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:27:35,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:27:35,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:27:35,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:27:35,345 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:27:35,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:27:35,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:27:35,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:27:35,346 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-02 20:27:35,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:27:35,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:27:35,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:27:35,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:27:35,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:27:35,356 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:27:35,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:27:35,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:27:35,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:27:35,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:27:35,394 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:27:35,397 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:27:35,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:27:35,398 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:27:35,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-02-02 20:27:35,472 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:27:35,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:27:35,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:27:35,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:27:35,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:27:35,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3678a328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35, skipping insertion in model container [2018-02-02 20:27:35,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,492 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:27:35,506 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:27:35,597 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:27:35,609 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:27:35,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35 WrapperNode [2018-02-02 20:27:35,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:27:35,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:27:35,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:27:35,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:27:35,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... [2018-02-02 20:27:35,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:27:35,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:27:35,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:27:35,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:27:35,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:27:35,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:27:35,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:27:35,684 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 20:27:35,685 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:27:35,685 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:27:35,826 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:27:35,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:27:35 BoogieIcfgContainer [2018-02-02 20:27:35,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:27:35,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:27:35,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:27:35,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:27:35,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:27:35" (1/3) ... [2018-02-02 20:27:35,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85dac99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:27:35, skipping insertion in model container [2018-02-02 20:27:35,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:27:35" (2/3) ... [2018-02-02 20:27:35,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85dac99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:27:35, skipping insertion in model container [2018-02-02 20:27:35,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:27:35" (3/3) ... [2018-02-02 20:27:35,832 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-02-02 20:27:35,840 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:27:35,848 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-02-02 20:27:35,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:27:35,873 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:27:35,873 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:27:35,873 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:27:35,873 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:27:35,873 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:27:35,873 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:27:35,873 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:27:35,874 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:27:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-02 20:27:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:27:35,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:35,896 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:35,896 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-02-02 20:27:35,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:35,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:27:36,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,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-02 20:27:36,015 INFO L182 omatonBuilderFactory]: Interpolants [52#true, 53#false] [2018-02-02 20:27:36,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-02 20:27:36,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:27:36,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:27:36,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:27:36,030 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-02-02 20:27:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,046 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-02 20:27:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:27:36,048 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 20:27:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,055 INFO L225 Difference]: With dead ends: 49 [2018-02-02 20:27:36,055 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 20:27:36,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:27:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 20:27:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 20:27:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 20:27:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-02 20:27:36,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-02-02 20:27:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,087 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-02 20:27:36,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:27:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-02 20:27:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:27:36,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,088 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-02-02 20:27:36,089 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:27:36,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,130 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(= main_~i~1 0)] [2018-02-02 20:27:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:27:36,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:27:36,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:27:36,133 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-02-02 20:27:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,196 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-02 20:27:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:27:36,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-02 20:27:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,198 INFO L225 Difference]: With dead ends: 67 [2018-02-02 20:27:36,199 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 20:27:36,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:27:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 20:27:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-02-02 20:27:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 20:27:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-02 20:27:36,254 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-02-02 20:27:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,254 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-02 20:27:36,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:27:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-02 20:27:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:27:36,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,254 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,255 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-02-02 20:27:36,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:27:36,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,313 INFO L182 omatonBuilderFactory]: Interpolants [272#(= 0 |foo_#in~size|), 273#(and (= foo_~size 0) (= foo_~i~0 0)), 269#true, 270#false, 271#(= 0 main_~i~1)] [2018-02-02 20:27:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:27:36,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:27:36,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:27:36,314 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-02-02 20:27:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,413 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-02-02 20:27:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:27:36,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:27:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,414 INFO L225 Difference]: With dead ends: 73 [2018-02-02 20:27:36,415 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 20:27:36,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 20:27:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-02-02 20:27:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 20:27:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-02 20:27:36,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-02-02 20:27:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,420 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-02 20:27:36,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:27:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-02 20:27:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:27:36,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,421 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-02-02 20:27:36,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:27:36,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,454 INFO L182 omatonBuilderFactory]: Interpolants [406#true, 407#false, 408#(= 1 (select |#valid| |main_~#b~0.base|))] [2018-02-02 20:27:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:27:36,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:27:36,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:27:36,455 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-02-02 20:27:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,471 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 20:27:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:27:36,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-02-02 20:27:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,473 INFO L225 Difference]: With dead ends: 55 [2018-02-02 20:27:36,473 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 20:27:36,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:27:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 20:27:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 20:27:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 20:27:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-02 20:27:36,476 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-02-02 20:27:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,476 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-02 20:27:36,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:27:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-02 20:27:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:27:36,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,477 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-02-02 20:27:36,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:27:36,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,539 INFO L182 omatonBuilderFactory]: Interpolants [519#true, 520#false, 521#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 522#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= main_~i~1 0))] [2018-02-02 20:27:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:27:36,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:27:36,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:27:36,540 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-02-02 20:27:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,608 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 20:27:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:27:36,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 20:27:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,609 INFO L225 Difference]: With dead ends: 65 [2018-02-02 20:27:36,609 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 20:27:36,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02 20:27:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 20:27:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-02-02 20:27:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 20:27:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-02 20:27:36,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-02-02 20:27:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,614 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-02 20:27:36,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:27:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-02 20:27:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:27:36,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,615 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,615 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-02-02 20:27:36,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:27:36,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:27:36,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,663 INFO L182 omatonBuilderFactory]: Interpolants [646#true, 647#false, 648#(<= |foo_#in~size| |foo_#in~n|), 649#(and (= foo_~i~0 0) (<= foo_~size foo_~n)), 650#(and (= foo_~i~0 0) (<= (+ foo_~i~0 1) foo_~n))] [2018-02-02 20:27:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:27:36,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:27:36,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:27:36,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:27:36,663 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-02-02 20:27:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,697 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-02 20:27:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:27:36,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 20:27:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,698 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:27:36,698 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:27:36,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:27:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:27:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-02-02 20:27:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 20:27:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-02 20:27:36,703 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-02-02 20:27:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,703 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-02 20:27:36,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:27:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-02 20:27:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:27:36,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,704 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,704 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-02-02 20:27:36,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:36,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:27:36,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,823 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(and (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 788#(and (<= main_~i~1 99) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 789#(and (<= main_~i~1 100) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 790#(and (= 0 |foo_#in~b.offset|) (<= |foo_#in~n| 100) (= 400 (select |#length| |foo_#in~b.base|))), 791#(and (= (select |#length| foo_~b.base) 400) (<= foo_~n 100) (= foo_~b.offset 0)), 792#(and (<= foo_~i~0 99) (= (select |#length| foo_~b.base) 400) (<= 0 foo_~i~0) (= foo_~b.offset 0))] [2018-02-02 20:27:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:27:36,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:27:36,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:27:36,824 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-02-02 20:27:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,922 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-02-02 20:27:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:27:36,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-02 20:27:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:36,923 INFO L225 Difference]: With dead ends: 63 [2018-02-02 20:27:36,923 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 20:27:36,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:27:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 20:27:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-02-02 20:27:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 20:27:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-02 20:27:36,927 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-02-02 20:27:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:36,927 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-02 20:27:36,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:27:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-02 20:27:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:27:36,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:36,928 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:36,928 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-02-02 20:27:36,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:36,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:36,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:27:36,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,962 INFO L182 omatonBuilderFactory]: Interpolants [922#true, 923#false, 924#(= 1 (select |#valid| |main_~#b~0.base|)), 925#(= 1 (select |#valid| |foo_#in~b.base|)), 926#(= 1 (select |#valid| foo_~b.base))] [2018-02-02 20:27:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:36,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:27:36,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:27:36,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:27:36,963 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-02-02 20:27:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:36,999 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-02 20:27:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:27:37,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:27:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,002 INFO L225 Difference]: With dead ends: 59 [2018-02-02 20:27:37,002 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 20:27:37,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 20:27:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 20:27:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 20:27:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-02 20:27:37,006 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-02-02 20:27:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,006 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-02 20:27:37,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:27:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-02 20:27:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:27:37,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,008 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:37,008 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-02-02 20:27:37,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:27:37,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:27:37,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:27:37,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,120 INFO L182 omatonBuilderFactory]: Interpolants [1048#true, 1049#false, 1050#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)), 1051#(and (= |main_~#b~0.offset| 0) (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (= (select |#length| |main_~#b~0.base|) 400)), 1052#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|))), 1053#(and (<= main_~i~1 99) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)))] [2018-02-02 20:27:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:27:37,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:27:37,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:27:37,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:37,121 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-02-02 20:27:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,176 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 20:27:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:27:37,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 20:27:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,176 INFO L225 Difference]: With dead ends: 64 [2018-02-02 20:27:37,177 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 20:27:37,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 20:27:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-02 20:27:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 20:27:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-02 20:27:37,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-02-02 20:27:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,182 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-02 20:27:37,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:27:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-02 20:27:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:27:37,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,183 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, 1] [2018-02-02 20:27:37,183 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-02-02 20:27:37,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:27:37,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,219 INFO L182 omatonBuilderFactory]: Interpolants [1172#true, 1173#false, 1174#(= main_~i~1 0), 1175#(<= main_~i~1 1)] [2018-02-02 20:27:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:27:37,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:27:37,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:27:37,220 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-02 20:27:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,244 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-02-02 20:27:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:27:37,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-02 20:27:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,245 INFO L225 Difference]: With dead ends: 83 [2018-02-02 20:27:37,245 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:27:37,245 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-02 20:27:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:27:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-02-02 20:27:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 20:27:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-02 20:27:37,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-02 20:27:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,249 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-02 20:27:37,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:27:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-02 20:27:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:27:37,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,250 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:27:37,251 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-02-02 20:27:37,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:27:37,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,307 INFO L182 omatonBuilderFactory]: Interpolants [1328#(<= |foo_#in~size| 1), 1329#(<= foo_~size 1), 1330#(<= foo_~size (+ foo_~i~0 1)), 1331#(<= foo_~size foo_~i~0), 1324#true, 1325#false, 1326#(= main_~i~1 0), 1327#(<= main_~i~1 1)] [2018-02-02 20:27:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:27:37,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:27:37,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:27:37,308 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 8 states. [2018-02-02 20:27:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,420 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 20:27:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:27:37,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 20:27:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,421 INFO L225 Difference]: With dead ends: 95 [2018-02-02 20:27:37,421 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 20:27:37,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:27:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 20:27:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-02-02 20:27:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:27:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-02 20:27:37,424 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-02-02 20:27:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,424 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-02 20:27:37,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:27:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-02 20:27:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:27:37,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,425 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:37,425 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-02-02 20:27:37,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:27:37,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:27:37,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,476 INFO L182 omatonBuilderFactory]: Interpolants [1511#true, 1512#false, 1513#(= main_~i~1 0), 1514#(<= main_~i~1 1), 1515#(<= main_~i~1 2)] [2018-02-02 20:27:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:27:37,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:27:37,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:27:37,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:27:37,477 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states. [2018-02-02 20:27:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,523 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-02-02 20:27:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:27:37,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 20:27:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,524 INFO L225 Difference]: With dead ends: 112 [2018-02-02 20:27:37,524 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 20:27:37,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:27:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 20:27:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2018-02-02 20:27:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 20:27:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-02-02 20:27:37,528 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 45 [2018-02-02 20:27:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,529 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-02-02 20:27:37,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:27:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-02-02 20:27:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:27:37,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,530 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:37,530 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-02-02 20:27:37,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:27:37,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:27:37,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,618 INFO L182 omatonBuilderFactory]: Interpolants [1717#true, 1718#false, 1719#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~size)), 1720#(and (= foo_~i~0 0) (<= |foo_#in~size| foo_~i~0)), 1721#(<= |foo_#in~size| 0), 1722#(<= main_~i~1 0), 1723#(<= main_~i~1 1), 1724#(<= |foo_#in~size| 1), 1725#(<= foo_~size 1), 1726#(<= foo_~size (+ foo_~i~0 1)), 1727#(<= foo_~size foo_~i~0)] [2018-02-02 20:27:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:27:37,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:27:37,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:27:37,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:27:37,619 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 11 states. [2018-02-02 20:27:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,774 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-02-02 20:27:37,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:27:37,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 20:27:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,776 INFO L225 Difference]: With dead ends: 137 [2018-02-02 20:27:37,776 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 20:27:37,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:27:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 20:27:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-02-02 20:27:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:27:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-02 20:27:37,781 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 47 [2018-02-02 20:27:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,781 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-02 20:27:37,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:27:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-02 20:27:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:27:37,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,784 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:37,784 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-02-02 20:27:37,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:27:37,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:27:37,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,844 INFO L182 omatonBuilderFactory]: Interpolants [1987#true, 1988#false, 1989#(<= |foo_#in~size| |foo_#in~n|), 1990#(<= foo_~size foo_~n), 1991#(and (<= 0 foo_~i~0) (<= foo_~size foo_~n)), 1992#(and (<= 1 foo_~i~0) (<= foo_~size foo_~n)), 1993#(and (<= 1 foo_~i~0) (<= (+ foo_~i~0 1) foo_~n))] [2018-02-02 20:27:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:27:37,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:27:37,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:27:37,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:27:37,845 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-02-02 20:27:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,887 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-02-02 20:27:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:27:37,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-02 20:27:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,888 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:27:37,888 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:27:37,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:27:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:27:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 20:27:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 20:27:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-02-02 20:27:37,891 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 53 [2018-02-02 20:27:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,891 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-02-02 20:27:37,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:27:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-02-02 20:27:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:27:37,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,895 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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-02 20:27:37,895 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 17999059, now seen corresponding path program 1 times [2018-02-02 20:27:37,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:37,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:27:37,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:37,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:27:37,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:27:37,927 INFO L182 omatonBuilderFactory]: Interpolants [2228#true, 2229#false, 2230#(= main_~i~1 0), 2231#(<= main_~i~1 1), 2232#(<= main_~i~1 2), 2233#(<= main_~i~1 3)] [2018-02-02 20:27:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:27:37,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:27:37,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:27:37,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:37,927 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 6 states. [2018-02-02 20:27:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:37,983 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-02 20:27:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:27:37,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-02-02 20:27:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:37,984 INFO L225 Difference]: With dead ends: 170 [2018-02-02 20:27:37,985 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 20:27:37,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:27:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 20:27:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2018-02-02 20:27:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 20:27:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-02-02 20:27:37,991 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 64 [2018-02-02 20:27:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:37,991 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-02-02 20:27:37,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:27:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-02-02 20:27:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:27:37,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:37,993 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:37,993 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1865253668, now seen corresponding path program 2 times [2018-02-02 20:27:37,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:27:38,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:27:38,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:27:38,076 INFO L182 omatonBuilderFactory]: Interpolants [2535#true, 2536#false, 2537#(= main_~i~1 0), 2538#(<= main_~i~1 1), 2539#(<= main_~i~1 2), 2540#(<= main_~i~1 3), 2541#(<= main_~i~1 4)] [2018-02-02 20:27:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:27:38,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:27:38,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:27:38,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:27:38,077 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 7 states. [2018-02-02 20:27:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:38,161 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2018-02-02 20:27:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:27:38,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-02-02 20:27:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:38,162 INFO L225 Difference]: With dead ends: 194 [2018-02-02 20:27:38,163 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 20:27:38,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:27:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 20:27:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-02-02 20:27:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:27:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-02-02 20:27:38,168 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 77 [2018-02-02 20:27:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:38,168 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-02-02 20:27:38,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:27:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-02-02 20:27:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 20:27:38,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:38,170 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:38,170 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 123220083, now seen corresponding path program 3 times [2018-02-02 20:27:38,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 20:27:38,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:27:38,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:27:38,238 INFO L182 omatonBuilderFactory]: Interpolants [2886#true, 2887#false, 2888#(= main_~i~1 0), 2889#(<= main_~i~1 1), 2890#(<= main_~i~1 2), 2891#(<= main_~i~1 3), 2892#(<= main_~i~1 4), 2893#(<= main_~i~1 5)] [2018-02-02 20:27:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 20:27:38,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:27:38,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:27:38,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:27:38,239 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states. [2018-02-02 20:27:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:38,312 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-02-02 20:27:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:27:38,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-02-02 20:27:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:38,313 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:27:38,313 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:27:38,314 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-02 20:27:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:27:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-02-02 20:27:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:27:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 193 transitions. [2018-02-02 20:27:38,320 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 193 transitions. Word has length 90 [2018-02-02 20:27:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:38,320 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 193 transitions. [2018-02-02 20:27:38,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:27:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions. [2018-02-02 20:27:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:27:38,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:38,323 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:38,323 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash 404740996, now seen corresponding path program 4 times [2018-02-02 20:27:38,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-02 20:27:38,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:27:38,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 20:27:38,406 INFO L182 omatonBuilderFactory]: Interpolants [3281#true, 3282#false, 3283#(= main_~i~1 0), 3284#(<= main_~i~1 1), 3285#(<= main_~i~1 2), 3286#(<= main_~i~1 3), 3287#(<= main_~i~1 4), 3288#(<= main_~i~1 5), 3289#(<= main_~i~1 6)] [2018-02-02 20:27:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-02 20:27:38,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:27:38,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:27:38,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:27:38,407 INFO L87 Difference]: Start difference. First operand 169 states and 193 transitions. Second operand 9 states. [2018-02-02 20:27:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:38,479 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2018-02-02 20:27:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:27:38,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-02-02 20:27:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:38,480 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:27:38,480 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:27:38,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:27:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:27:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 188. [2018-02-02 20:27:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:27:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2018-02-02 20:27:38,487 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 103 [2018-02-02 20:27:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:38,487 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2018-02-02 20:27:38,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:27:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2018-02-02 20:27:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 20:27:38,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:38,488 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:38,488 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash -400526317, now seen corresponding path program 5 times [2018-02-02 20:27:38,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-02 20:27:38,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:27:38,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-02 20:27:38,557 INFO L182 omatonBuilderFactory]: Interpolants [3728#(<= main_~i~1 6), 3729#(<= main_~i~1 7), 3720#true, 3721#false, 3722#(= main_~i~1 0), 3723#(<= main_~i~1 1), 3724#(<= main_~i~1 2), 3725#(<= main_~i~1 3), 3726#(<= main_~i~1 4), 3727#(<= main_~i~1 5)] [2018-02-02 20:27:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-02-02 20:27:38,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:27:38,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:27:38,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:27:38,558 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand 10 states. [2018-02-02 20:27:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:38,631 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions. [2018-02-02 20:27:38,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:27:38,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-02-02 20:27:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:38,632 INFO L225 Difference]: With dead ends: 266 [2018-02-02 20:27:38,632 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 20:27:38,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:27:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 20:27:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 207. [2018-02-02 20:27:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 20:27:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-02-02 20:27:38,637 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 116 [2018-02-02 20:27:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:38,637 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-02-02 20:27:38,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:27:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-02-02 20:27:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 20:27:38,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:38,638 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:38,638 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash -222659612, now seen corresponding path program 6 times [2018-02-02 20:27:38,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-02 20:27:38,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:27:38,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-02 20:27:38,740 INFO L182 omatonBuilderFactory]: Interpolants [4208#(<= main_~i~1 3), 4209#(<= main_~i~1 4), 4210#(<= main_~i~1 5), 4211#(<= main_~i~1 6), 4212#(<= main_~i~1 7), 4213#(<= main_~i~1 8), 4203#true, 4204#false, 4205#(= main_~i~1 0), 4206#(<= main_~i~1 1), 4207#(<= main_~i~1 2)] [2018-02-02 20:27:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-02-02 20:27:38,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:27:38,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:27:38,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:27:38,741 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 11 states. [2018-02-02 20:27:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:38,847 INFO L93 Difference]: Finished difference Result 290 states and 325 transitions. [2018-02-02 20:27:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:27:38,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-02-02 20:27:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:38,849 INFO L225 Difference]: With dead ends: 290 [2018-02-02 20:27:38,849 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 20:27:38,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:27:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 20:27:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2018-02-02 20:27:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:27:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2018-02-02 20:27:38,856 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 129 [2018-02-02 20:27:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:38,857 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2018-02-02 20:27:38,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:27:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2018-02-02 20:27:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 20:27:38,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:38,859 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:38,859 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -386568269, now seen corresponding path program 7 times [2018-02-02 20:27:38,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:38,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-02 20:27:38,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:38,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:27:38,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-02 20:27:38,991 INFO L182 omatonBuilderFactory]: Interpolants [4736#(<= main_~i~1 4), 4737#(<= main_~i~1 5), 4738#(<= main_~i~1 6), 4739#(<= main_~i~1 7), 4740#(<= main_~i~1 8), 4741#(<= main_~i~1 9), 4730#true, 4731#false, 4732#(= main_~i~1 0), 4733#(<= main_~i~1 1), 4734#(<= main_~i~1 2), 4735#(<= main_~i~1 3)] [2018-02-02 20:27:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-02-02 20:27:38,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:27:38,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:27:38,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:27:38,992 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand 12 states. [2018-02-02 20:27:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:39,120 INFO L93 Difference]: Finished difference Result 314 states and 353 transitions. [2018-02-02 20:27:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:27:39,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-02-02 20:27:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:39,122 INFO L225 Difference]: With dead ends: 314 [2018-02-02 20:27:39,122 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 20:27:39,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:27:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 20:27:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-02-02 20:27:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 20:27:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2018-02-02 20:27:39,129 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 142 [2018-02-02 20:27:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:39,130 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2018-02-02 20:27:39,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:27:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2018-02-02 20:27:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 20:27:39,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:39,132 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:39,132 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1984732092, now seen corresponding path program 8 times [2018-02-02 20:27:39,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:39,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-02 20:27:39,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:39,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:27:39,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-02-02 20:27:39,314 INFO L182 omatonBuilderFactory]: Interpolants [5312#(<= main_~i~1 9), 5313#(<= main_~i~1 10), 5301#true, 5302#false, 5303#(= main_~i~1 0), 5304#(<= main_~i~1 1), 5305#(<= main_~i~1 2), 5306#(<= main_~i~1 3), 5307#(<= main_~i~1 4), 5308#(<= main_~i~1 5), 5309#(<= main_~i~1 6), 5310#(<= main_~i~1 7), 5311#(<= main_~i~1 8)] [2018-02-02 20:27:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-02 20:27:39,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:27:39,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:27:39,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:27:39,315 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand 13 states. [2018-02-02 20:27:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:39,432 INFO L93 Difference]: Finished difference Result 338 states and 381 transitions. [2018-02-02 20:27:39,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:27:39,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2018-02-02 20:27:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:39,436 INFO L225 Difference]: With dead ends: 338 [2018-02-02 20:27:39,436 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 20:27:39,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:27:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 20:27:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 264. [2018-02-02 20:27:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 20:27:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-02-02 20:27:39,444 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 155 [2018-02-02 20:27:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:39,444 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-02-02 20:27:39,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:27:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-02-02 20:27:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 20:27:39,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:39,446 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:39,446 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 383853395, now seen corresponding path program 9 times [2018-02-02 20:27:39,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:39,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-02-02 20:27:39,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:39,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:27:39,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-02-02 20:27:39,609 INFO L182 omatonBuilderFactory]: Interpolants [5920#(<= main_~i~1 2), 5921#(<= main_~i~1 3), 5922#(<= main_~i~1 4), 5923#(<= main_~i~1 5), 5924#(<= main_~i~1 6), 5925#(<= main_~i~1 7), 5926#(<= main_~i~1 8), 5927#(<= main_~i~1 9), 5928#(<= main_~i~1 10), 5929#(<= main_~i~1 11), 5916#true, 5917#false, 5918#(= main_~i~1 0), 5919#(<= main_~i~1 1)] [2018-02-02 20:27:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-02-02 20:27:39,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:27:39,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:27:39,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:27:39,611 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 14 states. [2018-02-02 20:27:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:39,732 INFO L93 Difference]: Finished difference Result 362 states and 409 transitions. [2018-02-02 20:27:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:27:39,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-02-02 20:27:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:39,734 INFO L225 Difference]: With dead ends: 362 [2018-02-02 20:27:39,734 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 20:27:39,734 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-02 20:27:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 20:27:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 283. [2018-02-02 20:27:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:27:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 337 transitions. [2018-02-02 20:27:39,741 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 337 transitions. Word has length 168 [2018-02-02 20:27:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:39,742 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 337 transitions. [2018-02-02 20:27:39,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:27:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 337 transitions. [2018-02-02 20:27:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-02 20:27:39,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:39,743 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:39,744 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash -801074012, now seen corresponding path program 10 times [2018-02-02 20:27:39,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:39,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-02-02 20:27:39,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:39,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:27:39,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-02-02 20:27:39,940 INFO L182 omatonBuilderFactory]: Interpolants [6575#true, 6576#false, 6577#(= main_~i~1 0), 6578#(<= main_~i~1 1), 6579#(<= main_~i~1 2), 6580#(<= main_~i~1 3), 6581#(<= main_~i~1 4), 6582#(<= main_~i~1 5), 6583#(<= main_~i~1 6), 6584#(<= main_~i~1 7), 6585#(<= main_~i~1 8), 6586#(<= main_~i~1 9), 6587#(<= main_~i~1 10), 6588#(<= main_~i~1 11), 6589#(<= main_~i~1 12)] [2018-02-02 20:27:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-02-02 20:27:39,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:27:39,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:27:39,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:27:39,941 INFO L87 Difference]: Start difference. First operand 283 states and 337 transitions. Second operand 15 states. [2018-02-02 20:27:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:40,107 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions. [2018-02-02 20:27:40,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:27:40,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181 [2018-02-02 20:27:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:40,109 INFO L225 Difference]: With dead ends: 386 [2018-02-02 20:27:40,109 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 20:27:40,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:27:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 20:27:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 302. [2018-02-02 20:27:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-02 20:27:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 361 transitions. [2018-02-02 20:27:40,118 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 361 transitions. Word has length 181 [2018-02-02 20:27:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:40,119 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 361 transitions. [2018-02-02 20:27:40,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:27:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 361 transitions. [2018-02-02 20:27:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 20:27:40,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:40,121 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:40,121 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash -429027597, now seen corresponding path program 11 times [2018-02-02 20:27:40,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:40,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-02-02 20:27:40,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:40,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:27:40,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-02 20:27:40,320 INFO L182 omatonBuilderFactory]: Interpolants [7278#true, 7279#false, 7280#(= main_~i~1 0), 7281#(<= main_~i~1 1), 7282#(<= main_~i~1 2), 7283#(<= main_~i~1 3), 7284#(<= main_~i~1 4), 7285#(<= main_~i~1 5), 7286#(<= main_~i~1 6), 7287#(<= main_~i~1 7), 7288#(<= main_~i~1 8), 7289#(<= main_~i~1 9), 7290#(<= main_~i~1 10), 7291#(<= main_~i~1 11), 7292#(<= main_~i~1 12), 7293#(<= main_~i~1 13)] [2018-02-02 20:27:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-02-02 20:27:40,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:27:40,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:27:40,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:27:40,321 INFO L87 Difference]: Start difference. First operand 302 states and 361 transitions. Second operand 16 states. [2018-02-02 20:27:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:40,501 INFO L93 Difference]: Finished difference Result 410 states and 465 transitions. [2018-02-02 20:27:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:27:40,501 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2018-02-02 20:27:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:40,503 INFO L225 Difference]: With dead ends: 410 [2018-02-02 20:27:40,503 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 20:27:40,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:27:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 20:27:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 321. [2018-02-02 20:27:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-02-02 20:27:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 385 transitions. [2018-02-02 20:27:40,511 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 385 transitions. Word has length 194 [2018-02-02 20:27:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:40,511 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 385 transitions. [2018-02-02 20:27:40,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:27:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 385 transitions. [2018-02-02 20:27:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 20:27:40,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:40,513 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:40,513 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2112353020, now seen corresponding path program 12 times [2018-02-02 20:27:40,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:40,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-02 20:27:40,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:40,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:27:40,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-02-02 20:27:40,737 INFO L182 omatonBuilderFactory]: Interpolants [8032#(<= main_~i~1 5), 8033#(<= main_~i~1 6), 8034#(<= main_~i~1 7), 8035#(<= main_~i~1 8), 8036#(<= main_~i~1 9), 8037#(<= main_~i~1 10), 8038#(<= main_~i~1 11), 8039#(<= main_~i~1 12), 8040#(<= main_~i~1 13), 8041#(<= main_~i~1 14), 8025#true, 8026#false, 8027#(= main_~i~1 0), 8028#(<= main_~i~1 1), 8029#(<= main_~i~1 2), 8030#(<= main_~i~1 3), 8031#(<= main_~i~1 4)] [2018-02-02 20:27:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-02 20:27:40,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:27:40,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:27:40,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:27:40,739 INFO L87 Difference]: Start difference. First operand 321 states and 385 transitions. Second operand 17 states. [2018-02-02 20:27:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:40,929 INFO L93 Difference]: Finished difference Result 434 states and 493 transitions. [2018-02-02 20:27:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:27:40,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 207 [2018-02-02 20:27:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:40,932 INFO L225 Difference]: With dead ends: 434 [2018-02-02 20:27:40,932 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 20:27:40,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:27:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 20:27:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 340. [2018-02-02 20:27:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 20:27:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 409 transitions. [2018-02-02 20:27:40,941 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 409 transitions. Word has length 207 [2018-02-02 20:27:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:40,941 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 409 transitions. [2018-02-02 20:27:40,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:27:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 409 transitions. [2018-02-02 20:27:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-02 20:27:40,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:40,943 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:40,943 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash -744181101, now seen corresponding path program 13 times [2018-02-02 20:27:40,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:40,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-02 20:27:41,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:41,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:27:41,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-02-02 20:27:41,187 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~1 14), 8833#(<= main_~i~1 15), 8816#true, 8817#false, 8818#(= main_~i~1 0), 8819#(<= main_~i~1 1), 8820#(<= main_~i~1 2), 8821#(<= main_~i~1 3), 8822#(<= main_~i~1 4), 8823#(<= main_~i~1 5), 8824#(<= main_~i~1 6), 8825#(<= main_~i~1 7), 8826#(<= main_~i~1 8), 8827#(<= main_~i~1 9), 8828#(<= main_~i~1 10), 8829#(<= main_~i~1 11), 8830#(<= main_~i~1 12), 8831#(<= main_~i~1 13)] [2018-02-02 20:27:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-02-02 20:27:41,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:27:41,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:27:41,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:27:41,188 INFO L87 Difference]: Start difference. First operand 340 states and 409 transitions. Second operand 18 states. [2018-02-02 20:27:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:41,395 INFO L93 Difference]: Finished difference Result 458 states and 521 transitions. [2018-02-02 20:27:41,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:27:41,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2018-02-02 20:27:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:41,398 INFO L225 Difference]: With dead ends: 458 [2018-02-02 20:27:41,398 INFO L226 Difference]: Without dead ends: 458 [2018-02-02 20:27:41,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:27:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-02 20:27:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359. [2018-02-02 20:27:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 20:27:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 433 transitions. [2018-02-02 20:27:41,406 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 433 transitions. Word has length 220 [2018-02-02 20:27:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:41,406 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 433 transitions. [2018-02-02 20:27:41,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:27:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 433 transitions. [2018-02-02 20:27:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-02 20:27:41,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:41,409 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:41,409 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2089824924, now seen corresponding path program 14 times [2018-02-02 20:27:41,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:41,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-02-02 20:27:41,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:41,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:27:41,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-02-02 20:27:41,677 INFO L182 omatonBuilderFactory]: Interpolants [9664#(<= main_~i~1 11), 9665#(<= main_~i~1 12), 9666#(<= main_~i~1 13), 9667#(<= main_~i~1 14), 9668#(<= main_~i~1 15), 9669#(<= main_~i~1 16), 9651#true, 9652#false, 9653#(= main_~i~1 0), 9654#(<= main_~i~1 1), 9655#(<= main_~i~1 2), 9656#(<= main_~i~1 3), 9657#(<= main_~i~1 4), 9658#(<= main_~i~1 5), 9659#(<= main_~i~1 6), 9660#(<= main_~i~1 7), 9661#(<= main_~i~1 8), 9662#(<= main_~i~1 9), 9663#(<= main_~i~1 10)] [2018-02-02 20:27:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-02-02 20:27:41,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:27:41,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:27:41,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:27:41,679 INFO L87 Difference]: Start difference. First operand 359 states and 433 transitions. Second operand 19 states. [2018-02-02 20:27:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:41,876 INFO L93 Difference]: Finished difference Result 482 states and 549 transitions. [2018-02-02 20:27:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:27:41,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 233 [2018-02-02 20:27:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:41,878 INFO L225 Difference]: With dead ends: 482 [2018-02-02 20:27:41,878 INFO L226 Difference]: Without dead ends: 482 [2018-02-02 20:27:41,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:27:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-02-02 20:27:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2018-02-02 20:27:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 20:27:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 457 transitions. [2018-02-02 20:27:41,887 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 457 transitions. Word has length 233 [2018-02-02 20:27:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:41,887 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 457 transitions. [2018-02-02 20:27:41,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:27:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2018-02-02 20:27:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-02 20:27:41,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:41,889 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:41,890 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash 34639411, now seen corresponding path program 15 times [2018-02-02 20:27:41,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:41,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-02-02 20:27:42,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:42,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:27:42,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-02-02 20:27:42,175 INFO L182 omatonBuilderFactory]: Interpolants [10530#true, 10531#false, 10532#(= main_~i~1 0), 10533#(<= main_~i~1 1), 10534#(<= main_~i~1 2), 10535#(<= main_~i~1 3), 10536#(<= main_~i~1 4), 10537#(<= main_~i~1 5), 10538#(<= main_~i~1 6), 10539#(<= main_~i~1 7), 10540#(<= main_~i~1 8), 10541#(<= main_~i~1 9), 10542#(<= main_~i~1 10), 10543#(<= main_~i~1 11), 10544#(<= main_~i~1 12), 10545#(<= main_~i~1 13), 10546#(<= main_~i~1 14), 10547#(<= main_~i~1 15), 10548#(<= main_~i~1 16), 10549#(<= main_~i~1 17)] [2018-02-02 20:27:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-02-02 20:27:42,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:27:42,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:27:42,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:27:42,177 INFO L87 Difference]: Start difference. First operand 378 states and 457 transitions. Second operand 20 states. [2018-02-02 20:27:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:42,360 INFO L93 Difference]: Finished difference Result 506 states and 577 transitions. [2018-02-02 20:27:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:27:42,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 246 [2018-02-02 20:27:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:42,362 INFO L225 Difference]: With dead ends: 506 [2018-02-02 20:27:42,362 INFO L226 Difference]: Without dead ends: 506 [2018-02-02 20:27:42,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:27:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-02-02 20:27:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 397. [2018-02-02 20:27:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 20:27:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 481 transitions. [2018-02-02 20:27:42,367 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 481 transitions. Word has length 246 [2018-02-02 20:27:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:42,368 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 481 transitions. [2018-02-02 20:27:42,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:27:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 481 transitions. [2018-02-02 20:27:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-02 20:27:42,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:42,369 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:42,369 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1090377156, now seen corresponding path program 16 times [2018-02-02 20:27:42,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:42,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-02-02 20:27:42,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:42,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:27:42,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-02-02 20:27:42,627 INFO L182 omatonBuilderFactory]: Interpolants [11456#(<= main_~i~1 1), 11457#(<= main_~i~1 2), 11458#(<= main_~i~1 3), 11459#(<= main_~i~1 4), 11460#(<= main_~i~1 5), 11461#(<= main_~i~1 6), 11462#(<= main_~i~1 7), 11463#(<= main_~i~1 8), 11464#(<= main_~i~1 9), 11465#(<= main_~i~1 10), 11466#(<= main_~i~1 11), 11467#(<= main_~i~1 12), 11468#(<= main_~i~1 13), 11469#(<= main_~i~1 14), 11470#(<= main_~i~1 15), 11471#(<= main_~i~1 16), 11472#(<= main_~i~1 17), 11473#(<= main_~i~1 18), 11453#true, 11454#false, 11455#(= main_~i~1 0)] [2018-02-02 20:27:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-02-02 20:27:42,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:27:42,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:27:42,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:27:42,628 INFO L87 Difference]: Start difference. First operand 397 states and 481 transitions. Second operand 21 states. [2018-02-02 20:27:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:42,838 INFO L93 Difference]: Finished difference Result 530 states and 605 transitions. [2018-02-02 20:27:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:27:42,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 259 [2018-02-02 20:27:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:42,875 INFO L225 Difference]: With dead ends: 530 [2018-02-02 20:27:42,875 INFO L226 Difference]: Without dead ends: 530 [2018-02-02 20:27:42,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:27:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-02 20:27:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 416. [2018-02-02 20:27:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-02 20:27:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 505 transitions. [2018-02-02 20:27:42,880 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 505 transitions. Word has length 259 [2018-02-02 20:27:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:42,880 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 505 transitions. [2018-02-02 20:27:42,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:27:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 505 transitions. [2018-02-02 20:27:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-02 20:27:42,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:42,882 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:42,882 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -591715885, now seen corresponding path program 17 times [2018-02-02 20:27:42,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:42,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-02 20:27:43,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:43,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:27:43,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-02-02 20:27:43,237 INFO L182 omatonBuilderFactory]: Interpolants [12420#true, 12421#false, 12422#(= main_~i~1 0), 12423#(<= main_~i~1 1), 12424#(<= main_~i~1 2), 12425#(<= main_~i~1 3), 12426#(<= main_~i~1 4), 12427#(<= main_~i~1 5), 12428#(<= main_~i~1 6), 12429#(<= main_~i~1 7), 12430#(<= main_~i~1 8), 12431#(<= main_~i~1 9), 12432#(<= main_~i~1 10), 12433#(<= main_~i~1 11), 12434#(<= main_~i~1 12), 12435#(<= main_~i~1 13), 12436#(<= main_~i~1 14), 12437#(<= main_~i~1 15), 12438#(<= main_~i~1 16), 12439#(<= main_~i~1 17), 12440#(<= main_~i~1 18), 12441#(<= main_~i~1 19)] [2018-02-02 20:27:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-02-02 20:27:43,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:27:43,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:27:43,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:27:43,239 INFO L87 Difference]: Start difference. First operand 416 states and 505 transitions. Second operand 22 states. [2018-02-02 20:27:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:43,446 INFO L93 Difference]: Finished difference Result 554 states and 633 transitions. [2018-02-02 20:27:43,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:27:43,447 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 272 [2018-02-02 20:27:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:43,449 INFO L225 Difference]: With dead ends: 554 [2018-02-02 20:27:43,449 INFO L226 Difference]: Without dead ends: 554 [2018-02-02 20:27:43,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:27:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-02-02 20:27:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 435. [2018-02-02 20:27:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 20:27:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 529 transitions. [2018-02-02 20:27:43,455 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 529 transitions. Word has length 272 [2018-02-02 20:27:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:43,455 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 529 transitions. [2018-02-02 20:27:43,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:27:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 529 transitions. [2018-02-02 20:27:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-02 20:27:43,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:43,457 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:43,457 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 267920932, now seen corresponding path program 18 times [2018-02-02 20:27:43,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:43,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 20:27:43,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:43,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:27:43,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2018-02-02 20:27:43,781 INFO L182 omatonBuilderFactory]: Interpolants [13440#(<= main_~i~1 7), 13441#(<= main_~i~1 8), 13442#(<= main_~i~1 9), 13443#(<= main_~i~1 10), 13444#(<= main_~i~1 11), 13445#(<= main_~i~1 12), 13446#(<= main_~i~1 13), 13447#(<= main_~i~1 14), 13448#(<= main_~i~1 15), 13449#(<= main_~i~1 16), 13450#(<= main_~i~1 17), 13451#(<= main_~i~1 18), 13452#(<= main_~i~1 19), 13453#(<= main_~i~1 20), 13431#true, 13432#false, 13433#(= main_~i~1 0), 13434#(<= main_~i~1 1), 13435#(<= main_~i~1 2), 13436#(<= main_~i~1 3), 13437#(<= main_~i~1 4), 13438#(<= main_~i~1 5), 13439#(<= main_~i~1 6)] [2018-02-02 20:27:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-02-02 20:27:43,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:27:43,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:27:43,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:27:43,782 INFO L87 Difference]: Start difference. First operand 435 states and 529 transitions. Second operand 23 states. [2018-02-02 20:27:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:43,970 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions. [2018-02-02 20:27:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:27:43,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 285 [2018-02-02 20:27:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:43,971 INFO L225 Difference]: With dead ends: 578 [2018-02-02 20:27:43,971 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 20:27:43,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:27:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 20:27:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 454. [2018-02-02 20:27:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 20:27:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 553 transitions. [2018-02-02 20:27:43,976 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 553 transitions. Word has length 285 [2018-02-02 20:27:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:43,977 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 553 transitions. [2018-02-02 20:27:43,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:27:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 553 transitions. [2018-02-02 20:27:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-02 20:27:43,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:43,978 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:43,978 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1238471309, now seen corresponding path program 19 times [2018-02-02 20:27:43,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:44,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-02-02 20:27:44,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:44,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:27:44,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-02-02 20:27:44,345 INFO L182 omatonBuilderFactory]: Interpolants [14496#(<= main_~i~1 8), 14497#(<= main_~i~1 9), 14498#(<= main_~i~1 10), 14499#(<= main_~i~1 11), 14500#(<= main_~i~1 12), 14501#(<= main_~i~1 13), 14502#(<= main_~i~1 14), 14503#(<= main_~i~1 15), 14504#(<= main_~i~1 16), 14505#(<= main_~i~1 17), 14506#(<= main_~i~1 18), 14507#(<= main_~i~1 19), 14508#(<= main_~i~1 20), 14509#(<= main_~i~1 21), 14486#true, 14487#false, 14488#(= main_~i~1 0), 14489#(<= main_~i~1 1), 14490#(<= main_~i~1 2), 14491#(<= main_~i~1 3), 14492#(<= main_~i~1 4), 14493#(<= main_~i~1 5), 14494#(<= main_~i~1 6), 14495#(<= main_~i~1 7)] [2018-02-02 20:27:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-02-02 20:27:44,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:27:44,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:27:44,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:27:44,351 INFO L87 Difference]: Start difference. First operand 454 states and 553 transitions. Second operand 24 states. [2018-02-02 20:27:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:44,618 INFO L93 Difference]: Finished difference Result 602 states and 689 transitions. [2018-02-02 20:27:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:27:44,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 298 [2018-02-02 20:27:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:44,620 INFO L225 Difference]: With dead ends: 602 [2018-02-02 20:27:44,620 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 20:27:44,621 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-02 20:27:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 20:27:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 473. [2018-02-02 20:27:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-02-02 20:27:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 577 transitions. [2018-02-02 20:27:44,627 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 577 transitions. Word has length 298 [2018-02-02 20:27:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:44,627 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 577 transitions. [2018-02-02 20:27:44,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:27:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 577 transitions. [2018-02-02 20:27:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-02-02 20:27:44,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:44,629 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:44,629 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1911243132, now seen corresponding path program 20 times [2018-02-02 20:27:44,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:44,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-02-02 20:27:45,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:45,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:27:45,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2018-02-02 20:27:45,005 INFO L182 omatonBuilderFactory]: Interpolants [15585#true, 15586#false, 15587#(= main_~i~1 0), 15588#(<= main_~i~1 1), 15589#(<= main_~i~1 2), 15590#(<= main_~i~1 3), 15591#(<= main_~i~1 4), 15592#(<= main_~i~1 5), 15593#(<= main_~i~1 6), 15594#(<= main_~i~1 7), 15595#(<= main_~i~1 8), 15596#(<= main_~i~1 9), 15597#(<= main_~i~1 10), 15598#(<= main_~i~1 11), 15599#(<= main_~i~1 12), 15600#(<= main_~i~1 13), 15601#(<= main_~i~1 14), 15602#(<= main_~i~1 15), 15603#(<= main_~i~1 16), 15604#(<= main_~i~1 17), 15605#(<= main_~i~1 18), 15606#(<= main_~i~1 19), 15607#(<= main_~i~1 20), 15608#(<= main_~i~1 21), 15609#(<= main_~i~1 22)] [2018-02-02 20:27:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-02-02 20:27:45,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:27:45,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:27:45,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:27:45,006 INFO L87 Difference]: Start difference. First operand 473 states and 577 transitions. Second operand 25 states. [2018-02-02 20:27:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:45,206 INFO L93 Difference]: Finished difference Result 626 states and 717 transitions. [2018-02-02 20:27:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:27:45,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 311 [2018-02-02 20:27:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:45,208 INFO L225 Difference]: With dead ends: 626 [2018-02-02 20:27:45,208 INFO L226 Difference]: Without dead ends: 626 [2018-02-02 20:27:45,208 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-02 20:27:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-02 20:27:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 492. [2018-02-02 20:27:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-02-02 20:27:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions. [2018-02-02 20:27:45,214 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 311 [2018-02-02 20:27:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:45,215 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions. [2018-02-02 20:27:45,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:27:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions. [2018-02-02 20:27:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-02-02 20:27:45,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:45,216 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:45,216 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1752461587, now seen corresponding path program 21 times [2018-02-02 20:27:45,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:45,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-02-02 20:27:45,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:45,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:27:45,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-02-02 20:27:45,656 INFO L182 omatonBuilderFactory]: Interpolants [16728#true, 16729#false, 16730#(= main_~i~1 0), 16731#(<= main_~i~1 1), 16732#(<= main_~i~1 2), 16733#(<= main_~i~1 3), 16734#(<= main_~i~1 4), 16735#(<= main_~i~1 5), 16736#(<= main_~i~1 6), 16737#(<= main_~i~1 7), 16738#(<= main_~i~1 8), 16739#(<= main_~i~1 9), 16740#(<= main_~i~1 10), 16741#(<= main_~i~1 11), 16742#(<= main_~i~1 12), 16743#(<= main_~i~1 13), 16744#(<= main_~i~1 14), 16745#(<= main_~i~1 15), 16746#(<= main_~i~1 16), 16747#(<= main_~i~1 17), 16748#(<= main_~i~1 18), 16749#(<= main_~i~1 19), 16750#(<= main_~i~1 20), 16751#(<= main_~i~1 21), 16752#(<= main_~i~1 22), 16753#(<= main_~i~1 23)] [2018-02-02 20:27:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-02-02 20:27:45,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:27:45,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:27:45,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:27:45,657 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 26 states. [2018-02-02 20:27:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:45,880 INFO L93 Difference]: Finished difference Result 650 states and 745 transitions. [2018-02-02 20:27:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:27:45,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 324 [2018-02-02 20:27:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:45,882 INFO L225 Difference]: With dead ends: 650 [2018-02-02 20:27:45,882 INFO L226 Difference]: Without dead ends: 650 [2018-02-02 20:27:45,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:27:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-02-02 20:27:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 511. [2018-02-02 20:27:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-02 20:27:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 625 transitions. [2018-02-02 20:27:45,888 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 625 transitions. Word has length 324 [2018-02-02 20:27:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:45,889 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 625 transitions. [2018-02-02 20:27:45,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:27:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 625 transitions. [2018-02-02 20:27:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-02 20:27:45,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:45,890 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:45,890 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash 25796324, now seen corresponding path program 22 times [2018-02-02 20:27:45,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:45,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-02-02 20:27:46,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:46,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:27:46,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2018-02-02 20:27:46,334 INFO L182 omatonBuilderFactory]: Interpolants [17920#(<= main_~i~1 3), 17921#(<= main_~i~1 4), 17922#(<= main_~i~1 5), 17923#(<= main_~i~1 6), 17924#(<= main_~i~1 7), 17925#(<= main_~i~1 8), 17926#(<= main_~i~1 9), 17927#(<= main_~i~1 10), 17928#(<= main_~i~1 11), 17929#(<= main_~i~1 12), 17930#(<= main_~i~1 13), 17931#(<= main_~i~1 14), 17932#(<= main_~i~1 15), 17933#(<= main_~i~1 16), 17934#(<= main_~i~1 17), 17935#(<= main_~i~1 18), 17936#(<= main_~i~1 19), 17937#(<= main_~i~1 20), 17938#(<= main_~i~1 21), 17939#(<= main_~i~1 22), 17940#(<= main_~i~1 23), 17941#(<= main_~i~1 24), 17915#true, 17916#false, 17917#(= main_~i~1 0), 17918#(<= main_~i~1 1), 17919#(<= main_~i~1 2)] [2018-02-02 20:27:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-02-02 20:27:46,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:27:46,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:27:46,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:27:46,334 INFO L87 Difference]: Start difference. First operand 511 states and 625 transitions. Second operand 27 states. [2018-02-02 20:27:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:46,569 INFO L93 Difference]: Finished difference Result 674 states and 773 transitions. [2018-02-02 20:27:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:27:46,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 337 [2018-02-02 20:27:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:46,570 INFO L225 Difference]: With dead ends: 674 [2018-02-02 20:27:46,571 INFO L226 Difference]: Without dead ends: 674 [2018-02-02 20:27:46,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:27:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-02-02 20:27:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 530. [2018-02-02 20:27:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 20:27:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 649 transitions. [2018-02-02 20:27:46,579 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 649 transitions. Word has length 337 [2018-02-02 20:27:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:46,580 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 649 transitions. [2018-02-02 20:27:46,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:27:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 649 transitions. [2018-02-02 20:27:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-02-02 20:27:46,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:46,583 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 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, 1, 1, 1, 1, 1] [2018-02-02 20:27:46,583 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -183030605, now seen corresponding path program 23 times [2018-02-02 20:27:46,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:46,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-02-02 20:27:47,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:47,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:27:47,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2018-02-02 20:27:47,130 INFO L182 omatonBuilderFactory]: Interpolants [19146#true, 19147#false, 19148#(= main_~i~1 0), 19149#(<= main_~i~1 1), 19150#(<= main_~i~1 2), 19151#(<= main_~i~1 3), 19152#(<= main_~i~1 4), 19153#(<= main_~i~1 5), 19154#(<= main_~i~1 6), 19155#(<= main_~i~1 7), 19156#(<= main_~i~1 8), 19157#(<= main_~i~1 9), 19158#(<= main_~i~1 10), 19159#(<= main_~i~1 11), 19160#(<= main_~i~1 12), 19161#(<= main_~i~1 13), 19162#(<= main_~i~1 14), 19163#(<= main_~i~1 15), 19164#(<= main_~i~1 16), 19165#(<= main_~i~1 17), 19166#(<= main_~i~1 18), 19167#(<= main_~i~1 19), 19168#(<= main_~i~1 20), 19169#(<= main_~i~1 21), 19170#(<= main_~i~1 22), 19171#(<= main_~i~1 23), 19172#(<= main_~i~1 24), 19173#(<= main_~i~1 25)] [2018-02-02 20:27:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-02-02 20:27:47,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:27:47,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:27:47,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:27:47,131 INFO L87 Difference]: Start difference. First operand 530 states and 649 transitions. Second operand 28 states. [2018-02-02 20:27:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:47,362 INFO L93 Difference]: Finished difference Result 698 states and 801 transitions. [2018-02-02 20:27:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:27:47,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 350 [2018-02-02 20:27:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:47,364 INFO L225 Difference]: With dead ends: 698 [2018-02-02 20:27:47,364 INFO L226 Difference]: Without dead ends: 698 [2018-02-02 20:27:47,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:27:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-02-02 20:27:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 549. [2018-02-02 20:27:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-02-02 20:27:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 673 transitions. [2018-02-02 20:27:47,372 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 673 transitions. Word has length 350 [2018-02-02 20:27:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:47,372 INFO L432 AbstractCegarLoop]: Abstraction has 549 states and 673 transitions. [2018-02-02 20:27:47,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:27:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 673 transitions. [2018-02-02 20:27:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-02-02 20:27:47,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:47,375 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:47,375 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1190344892, now seen corresponding path program 24 times [2018-02-02 20:27:47,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:47,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-02-02 20:27:48,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:48,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:27:48,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2018-02-02 20:27:48,009 INFO L182 omatonBuilderFactory]: Interpolants [20421#true, 20422#false, 20423#(= main_~i~1 0), 20424#(<= main_~i~1 1), 20425#(<= main_~i~1 2), 20426#(<= main_~i~1 3), 20427#(<= main_~i~1 4), 20428#(<= main_~i~1 5), 20429#(<= main_~i~1 6), 20430#(<= main_~i~1 7), 20431#(<= main_~i~1 8), 20432#(<= main_~i~1 9), 20433#(<= main_~i~1 10), 20434#(<= main_~i~1 11), 20435#(<= main_~i~1 12), 20436#(<= main_~i~1 13), 20437#(<= main_~i~1 14), 20438#(<= main_~i~1 15), 20439#(<= main_~i~1 16), 20440#(<= main_~i~1 17), 20441#(<= main_~i~1 18), 20442#(<= main_~i~1 19), 20443#(<= main_~i~1 20), 20444#(<= main_~i~1 21), 20445#(<= main_~i~1 22), 20446#(<= main_~i~1 23), 20447#(<= main_~i~1 24), 20448#(<= main_~i~1 25), 20449#(<= main_~i~1 26)] [2018-02-02 20:27:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-02-02 20:27:48,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:27:48,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:27:48,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:27:48,009 INFO L87 Difference]: Start difference. First operand 549 states and 673 transitions. Second operand 29 states. [2018-02-02 20:27:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:48,465 INFO L93 Difference]: Finished difference Result 722 states and 829 transitions. [2018-02-02 20:27:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:27:48,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 363 [2018-02-02 20:27:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:48,470 INFO L225 Difference]: With dead ends: 722 [2018-02-02 20:27:48,470 INFO L226 Difference]: Without dead ends: 722 [2018-02-02 20:27:48,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:27:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-02 20:27:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2018-02-02 20:27:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-02 20:27:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions. [2018-02-02 20:27:48,481 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 363 [2018-02-02 20:27:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:48,481 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions. [2018-02-02 20:27:48,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:27:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions. [2018-02-02 20:27:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-02-02 20:27:48,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:48,485 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:48,485 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 622895187, now seen corresponding path program 25 times [2018-02-02 20:27:48,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:48,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-02 20:27:49,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:49,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:27:49,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1728 trivial. 0 not checked. [2018-02-02 20:27:49,111 INFO L182 omatonBuilderFactory]: Interpolants [21760#(<= main_~i~1 18), 21761#(<= main_~i~1 19), 21762#(<= main_~i~1 20), 21763#(<= main_~i~1 21), 21764#(<= main_~i~1 22), 21765#(<= main_~i~1 23), 21766#(<= main_~i~1 24), 21767#(<= main_~i~1 25), 21768#(<= main_~i~1 26), 21769#(<= main_~i~1 27), 21740#true, 21741#false, 21742#(= main_~i~1 0), 21743#(<= main_~i~1 1), 21744#(<= main_~i~1 2), 21745#(<= main_~i~1 3), 21746#(<= main_~i~1 4), 21747#(<= main_~i~1 5), 21748#(<= main_~i~1 6), 21749#(<= main_~i~1 7), 21750#(<= main_~i~1 8), 21751#(<= main_~i~1 9), 21752#(<= main_~i~1 10), 21753#(<= main_~i~1 11), 21754#(<= main_~i~1 12), 21755#(<= main_~i~1 13), 21756#(<= main_~i~1 14), 21757#(<= main_~i~1 15), 21758#(<= main_~i~1 16), 21759#(<= main_~i~1 17)] [2018-02-02 20:27:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-02-02 20:27:49,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:27:49,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:27:49,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:27:49,113 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 30 states. [2018-02-02 20:27:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:49,411 INFO L93 Difference]: Finished difference Result 746 states and 857 transitions. [2018-02-02 20:27:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:27:49,412 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 376 [2018-02-02 20:27:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:49,414 INFO L225 Difference]: With dead ends: 746 [2018-02-02 20:27:49,414 INFO L226 Difference]: Without dead ends: 746 [2018-02-02 20:27:49,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:27:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-02-02 20:27:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 587. [2018-02-02 20:27:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-02-02 20:27:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 721 transitions. [2018-02-02 20:27:49,420 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 721 transitions. Word has length 376 [2018-02-02 20:27:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:49,420 INFO L432 AbstractCegarLoop]: Abstraction has 587 states and 721 transitions. [2018-02-02 20:27:49,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:27:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 721 transitions. [2018-02-02 20:27:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-02-02 20:27:49,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:49,422 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:49,422 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1809069988, now seen corresponding path program 26 times [2018-02-02 20:27:49,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:49,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-02-02 20:27:49,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:49,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:27:49,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2018-02-02 20:27:49,953 INFO L182 omatonBuilderFactory]: Interpolants [23104#false, 23105#(= main_~i~1 0), 23106#(<= main_~i~1 1), 23107#(<= main_~i~1 2), 23108#(<= main_~i~1 3), 23109#(<= main_~i~1 4), 23110#(<= main_~i~1 5), 23111#(<= main_~i~1 6), 23112#(<= main_~i~1 7), 23113#(<= main_~i~1 8), 23114#(<= main_~i~1 9), 23115#(<= main_~i~1 10), 23116#(<= main_~i~1 11), 23117#(<= main_~i~1 12), 23118#(<= main_~i~1 13), 23119#(<= main_~i~1 14), 23120#(<= main_~i~1 15), 23121#(<= main_~i~1 16), 23122#(<= main_~i~1 17), 23123#(<= main_~i~1 18), 23124#(<= main_~i~1 19), 23125#(<= main_~i~1 20), 23126#(<= main_~i~1 21), 23127#(<= main_~i~1 22), 23128#(<= main_~i~1 23), 23129#(<= main_~i~1 24), 23130#(<= main_~i~1 25), 23131#(<= main_~i~1 26), 23132#(<= main_~i~1 27), 23133#(<= main_~i~1 28), 23103#true] [2018-02-02 20:27:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-02-02 20:27:49,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:27:49,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:27:49,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:27:49,954 INFO L87 Difference]: Start difference. First operand 587 states and 721 transitions. Second operand 31 states. [2018-02-02 20:27:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:50,285 INFO L93 Difference]: Finished difference Result 770 states and 885 transitions. [2018-02-02 20:27:50,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:27:50,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 389 [2018-02-02 20:27:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:50,286 INFO L225 Difference]: With dead ends: 770 [2018-02-02 20:27:50,287 INFO L226 Difference]: Without dead ends: 770 [2018-02-02 20:27:50,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:27:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-02-02 20:27:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 606. [2018-02-02 20:27:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-02 20:27:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 745 transitions. [2018-02-02 20:27:50,292 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 745 transitions. Word has length 389 [2018-02-02 20:27:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:50,292 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 745 transitions. [2018-02-02 20:27:50,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:27:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 745 transitions. [2018-02-02 20:27:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-02-02 20:27:50,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:50,294 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:50,294 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 689622003, now seen corresponding path program 27 times [2018-02-02 20:27:50,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:50,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-02-02 20:27:50,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:50,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:27:50,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:50,865 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-02 20:27:50,865 INFO L182 omatonBuilderFactory]: Interpolants [24512#(= main_~i~1 0), 24513#(<= main_~i~1 1), 24514#(<= main_~i~1 2), 24515#(<= main_~i~1 3), 24516#(<= main_~i~1 4), 24517#(<= main_~i~1 5), 24518#(<= main_~i~1 6), 24519#(<= main_~i~1 7), 24520#(<= main_~i~1 8), 24521#(<= main_~i~1 9), 24522#(<= main_~i~1 10), 24523#(<= main_~i~1 11), 24524#(<= main_~i~1 12), 24525#(<= main_~i~1 13), 24526#(<= main_~i~1 14), 24527#(<= main_~i~1 15), 24528#(<= main_~i~1 16), 24529#(<= main_~i~1 17), 24530#(<= main_~i~1 18), 24531#(<= main_~i~1 19), 24532#(<= main_~i~1 20), 24533#(<= main_~i~1 21), 24534#(<= main_~i~1 22), 24535#(<= main_~i~1 23), 24536#(<= main_~i~1 24), 24537#(<= main_~i~1 25), 24538#(<= main_~i~1 26), 24539#(<= main_~i~1 27), 24540#(<= main_~i~1 28), 24541#(<= main_~i~1 29), 24510#true, 24511#false] [2018-02-02 20:27:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-02-02 20:27:50,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:27:50,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:27:50,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:27:50,866 INFO L87 Difference]: Start difference. First operand 606 states and 745 transitions. Second operand 32 states. [2018-02-02 20:27:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:51,273 INFO L93 Difference]: Finished difference Result 794 states and 913 transitions. [2018-02-02 20:27:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:27:51,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 402 [2018-02-02 20:27:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:51,275 INFO L225 Difference]: With dead ends: 794 [2018-02-02 20:27:51,275 INFO L226 Difference]: Without dead ends: 794 [2018-02-02 20:27:51,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:27:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-02-02 20:27:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 625. [2018-02-02 20:27:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-02-02 20:27:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 769 transitions. [2018-02-02 20:27:51,282 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 769 transitions. Word has length 402 [2018-02-02 20:27:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:51,283 INFO L432 AbstractCegarLoop]: Abstraction has 625 states and 769 transitions. [2018-02-02 20:27:51,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:27:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 769 transitions. [2018-02-02 20:27:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-02-02 20:27:51,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:51,286 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:51,286 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1718226940, now seen corresponding path program 28 times [2018-02-02 20:27:51,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:51,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-02-02 20:27:51,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:51,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:27:51,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2187 trivial. 0 not checked. [2018-02-02 20:27:51,873 INFO L182 omatonBuilderFactory]: Interpolants [25984#(<= main_~i~1 21), 25985#(<= main_~i~1 22), 25986#(<= main_~i~1 23), 25987#(<= main_~i~1 24), 25988#(<= main_~i~1 25), 25989#(<= main_~i~1 26), 25990#(<= main_~i~1 27), 25991#(<= main_~i~1 28), 25992#(<= main_~i~1 29), 25993#(<= main_~i~1 30), 25961#true, 25962#false, 25963#(= main_~i~1 0), 25964#(<= main_~i~1 1), 25965#(<= main_~i~1 2), 25966#(<= main_~i~1 3), 25967#(<= main_~i~1 4), 25968#(<= main_~i~1 5), 25969#(<= main_~i~1 6), 25970#(<= main_~i~1 7), 25971#(<= main_~i~1 8), 25972#(<= main_~i~1 9), 25973#(<= main_~i~1 10), 25974#(<= main_~i~1 11), 25975#(<= main_~i~1 12), 25976#(<= main_~i~1 13), 25977#(<= main_~i~1 14), 25978#(<= main_~i~1 15), 25979#(<= main_~i~1 16), 25980#(<= main_~i~1 17), 25981#(<= main_~i~1 18), 25982#(<= main_~i~1 19), 25983#(<= main_~i~1 20)] [2018-02-02 20:27:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-02-02 20:27:51,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:27:51,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:27:51,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:27:51,874 INFO L87 Difference]: Start difference. First operand 625 states and 769 transitions. Second operand 33 states. [2018-02-02 20:27:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:52,169 INFO L93 Difference]: Finished difference Result 818 states and 941 transitions. [2018-02-02 20:27:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:27:52,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 415 [2018-02-02 20:27:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:52,171 INFO L225 Difference]: With dead ends: 818 [2018-02-02 20:27:52,171 INFO L226 Difference]: Without dead ends: 818 [2018-02-02 20:27:52,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:27:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-02-02 20:27:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 644. [2018-02-02 20:27:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-02-02 20:27:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 793 transitions. [2018-02-02 20:27:52,178 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 793 transitions. Word has length 415 [2018-02-02 20:27:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:52,179 INFO L432 AbstractCegarLoop]: Abstraction has 644 states and 793 transitions. [2018-02-02 20:27:52,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:27:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 793 transitions. [2018-02-02 20:27:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-02-02 20:27:52,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:52,181 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:52,181 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 957329299, now seen corresponding path program 29 times [2018-02-02 20:27:52,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:52,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-02-02 20:27:52,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:52,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:27:52,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-02-02 20:27:52,844 INFO L182 omatonBuilderFactory]: Interpolants [27456#true, 27457#false, 27458#(= main_~i~1 0), 27459#(<= main_~i~1 1), 27460#(<= main_~i~1 2), 27461#(<= main_~i~1 3), 27462#(<= main_~i~1 4), 27463#(<= main_~i~1 5), 27464#(<= main_~i~1 6), 27465#(<= main_~i~1 7), 27466#(<= main_~i~1 8), 27467#(<= main_~i~1 9), 27468#(<= main_~i~1 10), 27469#(<= main_~i~1 11), 27470#(<= main_~i~1 12), 27471#(<= main_~i~1 13), 27472#(<= main_~i~1 14), 27473#(<= main_~i~1 15), 27474#(<= main_~i~1 16), 27475#(<= main_~i~1 17), 27476#(<= main_~i~1 18), 27477#(<= main_~i~1 19), 27478#(<= main_~i~1 20), 27479#(<= main_~i~1 21), 27480#(<= main_~i~1 22), 27481#(<= main_~i~1 23), 27482#(<= main_~i~1 24), 27483#(<= main_~i~1 25), 27484#(<= main_~i~1 26), 27485#(<= main_~i~1 27), 27486#(<= main_~i~1 28), 27487#(<= main_~i~1 29), 27488#(<= main_~i~1 30), 27489#(<= main_~i~1 31)] [2018-02-02 20:27:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-02-02 20:27:52,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:27:52,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:27:52,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:27:52,844 INFO L87 Difference]: Start difference. First operand 644 states and 793 transitions. Second operand 34 states. [2018-02-02 20:27:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:53,297 INFO L93 Difference]: Finished difference Result 842 states and 969 transitions. [2018-02-02 20:27:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:27:53,297 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 428 [2018-02-02 20:27:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:53,300 INFO L225 Difference]: With dead ends: 842 [2018-02-02 20:27:53,300 INFO L226 Difference]: Without dead ends: 842 [2018-02-02 20:27:53,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:27:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-02-02 20:27:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 663. [2018-02-02 20:27:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-02-02 20:27:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 817 transitions. [2018-02-02 20:27:53,312 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 817 transitions. Word has length 428 [2018-02-02 20:27:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:53,312 INFO L432 AbstractCegarLoop]: Abstraction has 663 states and 817 transitions. [2018-02-02 20:27:53,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:27:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 817 transitions. [2018-02-02 20:27:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-02 20:27:53,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:53,316 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:53,316 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:53,317 INFO L82 PathProgramCache]: Analyzing trace with hash -360189852, now seen corresponding path program 30 times [2018-02-02 20:27:53,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:53,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-02-02 20:27:54,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:54,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:27:54,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-02-02 20:27:54,000 INFO L182 omatonBuilderFactory]: Interpolants [28995#true, 28996#false, 28997#(= main_~i~1 0), 28998#(<= main_~i~1 1), 28999#(<= main_~i~1 2), 29000#(<= main_~i~1 3), 29001#(<= main_~i~1 4), 29002#(<= main_~i~1 5), 29003#(<= main_~i~1 6), 29004#(<= main_~i~1 7), 29005#(<= main_~i~1 8), 29006#(<= main_~i~1 9), 29007#(<= main_~i~1 10), 29008#(<= main_~i~1 11), 29009#(<= main_~i~1 12), 29010#(<= main_~i~1 13), 29011#(<= main_~i~1 14), 29012#(<= main_~i~1 15), 29013#(<= main_~i~1 16), 29014#(<= main_~i~1 17), 29015#(<= main_~i~1 18), 29016#(<= main_~i~1 19), 29017#(<= main_~i~1 20), 29018#(<= main_~i~1 21), 29019#(<= main_~i~1 22), 29020#(<= main_~i~1 23), 29021#(<= main_~i~1 24), 29022#(<= main_~i~1 25), 29023#(<= main_~i~1 26), 29024#(<= main_~i~1 27), 29025#(<= main_~i~1 28), 29026#(<= main_~i~1 29), 29027#(<= main_~i~1 30), 29028#(<= main_~i~1 31), 29029#(<= main_~i~1 32)] [2018-02-02 20:27:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-02-02 20:27:54,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 20:27:54,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 20:27:54,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:27:54,002 INFO L87 Difference]: Start difference. First operand 663 states and 817 transitions. Second operand 35 states. [2018-02-02 20:27:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:54,624 INFO L93 Difference]: Finished difference Result 866 states and 997 transitions. [2018-02-02 20:27:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:27:54,624 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 441 [2018-02-02 20:27:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:54,627 INFO L225 Difference]: With dead ends: 866 [2018-02-02 20:27:54,627 INFO L226 Difference]: Without dead ends: 866 [2018-02-02 20:27:54,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:27:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-02-02 20:27:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 682. [2018-02-02 20:27:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-02-02 20:27:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 841 transitions. [2018-02-02 20:27:54,637 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 841 transitions. Word has length 441 [2018-02-02 20:27:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:54,637 INFO L432 AbstractCegarLoop]: Abstraction has 682 states and 841 transitions. [2018-02-02 20:27:54,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 20:27:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 841 transitions. [2018-02-02 20:27:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-02-02 20:27:54,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:54,641 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:54,641 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 881412915, now seen corresponding path program 31 times [2018-02-02 20:27:54,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:54,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-02-02 20:27:55,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:55,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:27:55,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2700 trivial. 0 not checked. [2018-02-02 20:27:55,539 INFO L182 omatonBuilderFactory]: Interpolants [30592#(<= main_~i~1 12), 30593#(<= main_~i~1 13), 30594#(<= main_~i~1 14), 30595#(<= main_~i~1 15), 30596#(<= main_~i~1 16), 30597#(<= main_~i~1 17), 30598#(<= main_~i~1 18), 30599#(<= main_~i~1 19), 30600#(<= main_~i~1 20), 30601#(<= main_~i~1 21), 30602#(<= main_~i~1 22), 30603#(<= main_~i~1 23), 30604#(<= main_~i~1 24), 30605#(<= main_~i~1 25), 30606#(<= main_~i~1 26), 30607#(<= main_~i~1 27), 30608#(<= main_~i~1 28), 30609#(<= main_~i~1 29), 30610#(<= main_~i~1 30), 30611#(<= main_~i~1 31), 30612#(<= main_~i~1 32), 30613#(<= main_~i~1 33), 30578#true, 30579#false, 30580#(= main_~i~1 0), 30581#(<= main_~i~1 1), 30582#(<= main_~i~1 2), 30583#(<= main_~i~1 3), 30584#(<= main_~i~1 4), 30585#(<= main_~i~1 5), 30586#(<= main_~i~1 6), 30587#(<= main_~i~1 7), 30588#(<= main_~i~1 8), 30589#(<= main_~i~1 9), 30590#(<= main_~i~1 10), 30591#(<= main_~i~1 11)] [2018-02-02 20:27:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-02-02 20:27:55,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:27:55,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:27:55,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:27:55,540 INFO L87 Difference]: Start difference. First operand 682 states and 841 transitions. Second operand 36 states. [2018-02-02 20:27:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:55,848 INFO L93 Difference]: Finished difference Result 890 states and 1025 transitions. [2018-02-02 20:27:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:27:55,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 454 [2018-02-02 20:27:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:55,850 INFO L225 Difference]: With dead ends: 890 [2018-02-02 20:27:55,851 INFO L226 Difference]: Without dead ends: 890 [2018-02-02 20:27:55,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:27:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-02-02 20:27:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 701. [2018-02-02 20:27:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-02-02 20:27:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 865 transitions. [2018-02-02 20:27:55,857 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 865 transitions. Word has length 454 [2018-02-02 20:27:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:55,858 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 865 transitions. [2018-02-02 20:27:55,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:27:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 865 transitions. [2018-02-02 20:27:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-02-02 20:27:55,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:55,860 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:55,860 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1889519420, now seen corresponding path program 32 times [2018-02-02 20:27:55,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:55,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-02-02 20:27:56,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:56,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 20:27:56,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2883 trivial. 0 not checked. [2018-02-02 20:27:56,709 INFO L182 omatonBuilderFactory]: Interpolants [32205#true, 32206#false, 32207#(= main_~i~1 0), 32208#(<= main_~i~1 1), 32209#(<= main_~i~1 2), 32210#(<= main_~i~1 3), 32211#(<= main_~i~1 4), 32212#(<= main_~i~1 5), 32213#(<= main_~i~1 6), 32214#(<= main_~i~1 7), 32215#(<= main_~i~1 8), 32216#(<= main_~i~1 9), 32217#(<= main_~i~1 10), 32218#(<= main_~i~1 11), 32219#(<= main_~i~1 12), 32220#(<= main_~i~1 13), 32221#(<= main_~i~1 14), 32222#(<= main_~i~1 15), 32223#(<= main_~i~1 16), 32224#(<= main_~i~1 17), 32225#(<= main_~i~1 18), 32226#(<= main_~i~1 19), 32227#(<= main_~i~1 20), 32228#(<= main_~i~1 21), 32229#(<= main_~i~1 22), 32230#(<= main_~i~1 23), 32231#(<= main_~i~1 24), 32232#(<= main_~i~1 25), 32233#(<= main_~i~1 26), 32234#(<= main_~i~1 27), 32235#(<= main_~i~1 28), 32236#(<= main_~i~1 29), 32237#(<= main_~i~1 30), 32238#(<= main_~i~1 31), 32239#(<= main_~i~1 32), 32240#(<= main_~i~1 33), 32241#(<= main_~i~1 34)] [2018-02-02 20:27:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-02-02 20:27:56,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:27:56,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:27:56,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:27:56,710 INFO L87 Difference]: Start difference. First operand 701 states and 865 transitions. Second operand 37 states. [2018-02-02 20:27:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:57,167 INFO L93 Difference]: Finished difference Result 914 states and 1053 transitions. [2018-02-02 20:27:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:27:57,167 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 467 [2018-02-02 20:27:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:57,169 INFO L225 Difference]: With dead ends: 914 [2018-02-02 20:27:57,169 INFO L226 Difference]: Without dead ends: 914 [2018-02-02 20:27:57,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:27:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-02-02 20:27:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 720. [2018-02-02 20:27:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-02-02 20:27:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 889 transitions. [2018-02-02 20:27:57,176 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 889 transitions. Word has length 467 [2018-02-02 20:27:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:57,176 INFO L432 AbstractCegarLoop]: Abstraction has 720 states and 889 transitions. [2018-02-02 20:27:57,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 20:27:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 889 transitions. [2018-02-02 20:27:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-02-02 20:27:57,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:57,179 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:57,179 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:57,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1116839635, now seen corresponding path program 33 times [2018-02-02 20:27:57,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:57,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-02-02 20:27:57,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:57,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 20:27:57,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3072 trivial. 0 not checked. [2018-02-02 20:27:57,911 INFO L182 omatonBuilderFactory]: Interpolants [33876#true, 33877#false, 33878#(= main_~i~1 0), 33879#(<= main_~i~1 1), 33880#(<= main_~i~1 2), 33881#(<= main_~i~1 3), 33882#(<= main_~i~1 4), 33883#(<= main_~i~1 5), 33884#(<= main_~i~1 6), 33885#(<= main_~i~1 7), 33886#(<= main_~i~1 8), 33887#(<= main_~i~1 9), 33888#(<= main_~i~1 10), 33889#(<= main_~i~1 11), 33890#(<= main_~i~1 12), 33891#(<= main_~i~1 13), 33892#(<= main_~i~1 14), 33893#(<= main_~i~1 15), 33894#(<= main_~i~1 16), 33895#(<= main_~i~1 17), 33896#(<= main_~i~1 18), 33897#(<= main_~i~1 19), 33898#(<= main_~i~1 20), 33899#(<= main_~i~1 21), 33900#(<= main_~i~1 22), 33901#(<= main_~i~1 23), 33902#(<= main_~i~1 24), 33903#(<= main_~i~1 25), 33904#(<= main_~i~1 26), 33905#(<= main_~i~1 27), 33906#(<= main_~i~1 28), 33907#(<= main_~i~1 29), 33908#(<= main_~i~1 30), 33909#(<= main_~i~1 31), 33910#(<= main_~i~1 32), 33911#(<= main_~i~1 33), 33912#(<= main_~i~1 34), 33913#(<= main_~i~1 35)] [2018-02-02 20:27:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-02-02 20:27:57,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 20:27:57,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 20:27:57,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:27:57,912 INFO L87 Difference]: Start difference. First operand 720 states and 889 transitions. Second operand 38 states. [2018-02-02 20:27:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:58,373 INFO L93 Difference]: Finished difference Result 938 states and 1081 transitions. [2018-02-02 20:27:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:27:58,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 480 [2018-02-02 20:27:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:58,375 INFO L225 Difference]: With dead ends: 938 [2018-02-02 20:27:58,375 INFO L226 Difference]: Without dead ends: 938 [2018-02-02 20:27:58,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:27:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-02-02 20:27:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 739. [2018-02-02 20:27:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-02-02 20:27:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 913 transitions. [2018-02-02 20:27:58,384 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 913 transitions. Word has length 480 [2018-02-02 20:27:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:58,385 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 913 transitions. [2018-02-02 20:27:58,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 20:27:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 913 transitions. [2018-02-02 20:27:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-02-02 20:27:58,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:58,389 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:58,389 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1588279004, now seen corresponding path program 34 times [2018-02-02 20:27:58,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:58,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:27:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-02-02 20:27:59,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:27:59,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 20:27:59,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:27:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3267 trivial. 0 not checked. [2018-02-02 20:27:59,220 INFO L182 omatonBuilderFactory]: Interpolants [35591#true, 35592#false, 35593#(= main_~i~1 0), 35594#(<= main_~i~1 1), 35595#(<= main_~i~1 2), 35596#(<= main_~i~1 3), 35597#(<= main_~i~1 4), 35598#(<= main_~i~1 5), 35599#(<= main_~i~1 6), 35600#(<= main_~i~1 7), 35601#(<= main_~i~1 8), 35602#(<= main_~i~1 9), 35603#(<= main_~i~1 10), 35604#(<= main_~i~1 11), 35605#(<= main_~i~1 12), 35606#(<= main_~i~1 13), 35607#(<= main_~i~1 14), 35608#(<= main_~i~1 15), 35609#(<= main_~i~1 16), 35610#(<= main_~i~1 17), 35611#(<= main_~i~1 18), 35612#(<= main_~i~1 19), 35613#(<= main_~i~1 20), 35614#(<= main_~i~1 21), 35615#(<= main_~i~1 22), 35616#(<= main_~i~1 23), 35617#(<= main_~i~1 24), 35618#(<= main_~i~1 25), 35619#(<= main_~i~1 26), 35620#(<= main_~i~1 27), 35621#(<= main_~i~1 28), 35622#(<= main_~i~1 29), 35623#(<= main_~i~1 30), 35624#(<= main_~i~1 31), 35625#(<= main_~i~1 32), 35626#(<= main_~i~1 33), 35627#(<= main_~i~1 34), 35628#(<= main_~i~1 35), 35629#(<= main_~i~1 36)] [2018-02-02 20:27:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-02-02 20:27:59,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 20:27:59,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 20:27:59,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:27:59,221 INFO L87 Difference]: Start difference. First operand 739 states and 913 transitions. Second operand 39 states. [2018-02-02 20:27:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:27:59,698 INFO L93 Difference]: Finished difference Result 962 states and 1109 transitions. [2018-02-02 20:27:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:27:59,699 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 493 [2018-02-02 20:27:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:27:59,701 INFO L225 Difference]: With dead ends: 962 [2018-02-02 20:27:59,701 INFO L226 Difference]: Without dead ends: 962 [2018-02-02 20:27:59,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:27:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-02-02 20:27:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 758. [2018-02-02 20:27:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-02-02 20:27:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 937 transitions. [2018-02-02 20:27:59,708 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 937 transitions. Word has length 493 [2018-02-02 20:27:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:27:59,709 INFO L432 AbstractCegarLoop]: Abstraction has 758 states and 937 transitions. [2018-02-02 20:27:59,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 20:27:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 937 transitions. [2018-02-02 20:27:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-02-02 20:27:59,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:27:59,715 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:27:59,715 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:27:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1907534451, now seen corresponding path program 35 times [2018-02-02 20:27:59,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:27:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:27:59,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-02-02 20:28:00,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:00,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 20:28:00,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked. [2018-02-02 20:28:00,552 INFO L182 omatonBuilderFactory]: Interpolants [37376#(<= main_~i~1 24), 37377#(<= main_~i~1 25), 37378#(<= main_~i~1 26), 37379#(<= main_~i~1 27), 37380#(<= main_~i~1 28), 37381#(<= main_~i~1 29), 37382#(<= main_~i~1 30), 37383#(<= main_~i~1 31), 37384#(<= main_~i~1 32), 37385#(<= main_~i~1 33), 37386#(<= main_~i~1 34), 37387#(<= main_~i~1 35), 37388#(<= main_~i~1 36), 37389#(<= main_~i~1 37), 37350#true, 37351#false, 37352#(= main_~i~1 0), 37353#(<= main_~i~1 1), 37354#(<= main_~i~1 2), 37355#(<= main_~i~1 3), 37356#(<= main_~i~1 4), 37357#(<= main_~i~1 5), 37358#(<= main_~i~1 6), 37359#(<= main_~i~1 7), 37360#(<= main_~i~1 8), 37361#(<= main_~i~1 9), 37362#(<= main_~i~1 10), 37363#(<= main_~i~1 11), 37364#(<= main_~i~1 12), 37365#(<= main_~i~1 13), 37366#(<= main_~i~1 14), 37367#(<= main_~i~1 15), 37368#(<= main_~i~1 16), 37369#(<= main_~i~1 17), 37370#(<= main_~i~1 18), 37371#(<= main_~i~1 19), 37372#(<= main_~i~1 20), 37373#(<= main_~i~1 21), 37374#(<= main_~i~1 22), 37375#(<= main_~i~1 23)] [2018-02-02 20:28:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-02-02 20:28:00,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 20:28:00,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 20:28:00,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:28:00,553 INFO L87 Difference]: Start difference. First operand 758 states and 937 transitions. Second operand 40 states. [2018-02-02 20:28:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:00,931 INFO L93 Difference]: Finished difference Result 986 states and 1137 transitions. [2018-02-02 20:28:00,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:28:00,935 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 506 [2018-02-02 20:28:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:00,937 INFO L225 Difference]: With dead ends: 986 [2018-02-02 20:28:00,937 INFO L226 Difference]: Without dead ends: 986 [2018-02-02 20:28:00,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:28:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-02-02 20:28:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 777. [2018-02-02 20:28:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-02-02 20:28:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 961 transitions. [2018-02-02 20:28:00,944 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 961 transitions. Word has length 506 [2018-02-02 20:28:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:00,944 INFO L432 AbstractCegarLoop]: Abstraction has 777 states and 961 transitions. [2018-02-02 20:28:00,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 20:28:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 961 transitions. [2018-02-02 20:28:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-02-02 20:28:00,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:00,947 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:00,947 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2112118396, now seen corresponding path program 36 times [2018-02-02 20:28:00,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:00,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-02-02 20:28:01,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:01,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 20:28:01,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-02-02 20:28:01,807 INFO L182 omatonBuilderFactory]: Interpolants [39168#(<= main_~i~1 13), 39169#(<= main_~i~1 14), 39170#(<= main_~i~1 15), 39171#(<= main_~i~1 16), 39172#(<= main_~i~1 17), 39173#(<= main_~i~1 18), 39174#(<= main_~i~1 19), 39175#(<= main_~i~1 20), 39176#(<= main_~i~1 21), 39177#(<= main_~i~1 22), 39178#(<= main_~i~1 23), 39179#(<= main_~i~1 24), 39180#(<= main_~i~1 25), 39181#(<= main_~i~1 26), 39182#(<= main_~i~1 27), 39183#(<= main_~i~1 28), 39184#(<= main_~i~1 29), 39185#(<= main_~i~1 30), 39186#(<= main_~i~1 31), 39187#(<= main_~i~1 32), 39188#(<= main_~i~1 33), 39189#(<= main_~i~1 34), 39190#(<= main_~i~1 35), 39191#(<= main_~i~1 36), 39192#(<= main_~i~1 37), 39193#(<= main_~i~1 38), 39153#true, 39154#false, 39155#(= main_~i~1 0), 39156#(<= main_~i~1 1), 39157#(<= main_~i~1 2), 39158#(<= main_~i~1 3), 39159#(<= main_~i~1 4), 39160#(<= main_~i~1 5), 39161#(<= main_~i~1 6), 39162#(<= main_~i~1 7), 39163#(<= main_~i~1 8), 39164#(<= main_~i~1 9), 39165#(<= main_~i~1 10), 39166#(<= main_~i~1 11), 39167#(<= main_~i~1 12)] [2018-02-02 20:28:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-02-02 20:28:01,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 20:28:01,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 20:28:01,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:28:01,808 INFO L87 Difference]: Start difference. First operand 777 states and 961 transitions. Second operand 41 states. [2018-02-02 20:28:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:02,365 INFO L93 Difference]: Finished difference Result 1010 states and 1165 transitions. [2018-02-02 20:28:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:28:02,365 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 519 [2018-02-02 20:28:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:02,368 INFO L225 Difference]: With dead ends: 1010 [2018-02-02 20:28:02,368 INFO L226 Difference]: Without dead ends: 1010 [2018-02-02 20:28:02,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:28:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-02-02 20:28:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 796. [2018-02-02 20:28:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-02-02 20:28:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 985 transitions. [2018-02-02 20:28:02,375 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 985 transitions. Word has length 519 [2018-02-02 20:28:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:02,375 INFO L432 AbstractCegarLoop]: Abstraction has 796 states and 985 transitions. [2018-02-02 20:28:02,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 20:28:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 985 transitions. [2018-02-02 20:28:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-02-02 20:28:02,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:02,379 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:02,379 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1475767827, now seen corresponding path program 37 times [2018-02-02 20:28:02,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:02,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-02-02 20:28:03,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:03,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 20:28:03,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3888 trivial. 0 not checked. [2018-02-02 20:28:03,343 INFO L182 omatonBuilderFactory]: Interpolants [41024#(<= main_~i~1 22), 41025#(<= main_~i~1 23), 41026#(<= main_~i~1 24), 41027#(<= main_~i~1 25), 41028#(<= main_~i~1 26), 41029#(<= main_~i~1 27), 41030#(<= main_~i~1 28), 41031#(<= main_~i~1 29), 41032#(<= main_~i~1 30), 41033#(<= main_~i~1 31), 41034#(<= main_~i~1 32), 41035#(<= main_~i~1 33), 41036#(<= main_~i~1 34), 41037#(<= main_~i~1 35), 41038#(<= main_~i~1 36), 41039#(<= main_~i~1 37), 41040#(<= main_~i~1 38), 41041#(<= main_~i~1 39), 41000#true, 41001#false, 41002#(= main_~i~1 0), 41003#(<= main_~i~1 1), 41004#(<= main_~i~1 2), 41005#(<= main_~i~1 3), 41006#(<= main_~i~1 4), 41007#(<= main_~i~1 5), 41008#(<= main_~i~1 6), 41009#(<= main_~i~1 7), 41010#(<= main_~i~1 8), 41011#(<= main_~i~1 9), 41012#(<= main_~i~1 10), 41013#(<= main_~i~1 11), 41014#(<= main_~i~1 12), 41015#(<= main_~i~1 13), 41016#(<= main_~i~1 14), 41017#(<= main_~i~1 15), 41018#(<= main_~i~1 16), 41019#(<= main_~i~1 17), 41020#(<= main_~i~1 18), 41021#(<= main_~i~1 19), 41022#(<= main_~i~1 20), 41023#(<= main_~i~1 21)] [2018-02-02 20:28:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-02-02 20:28:03,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 20:28:03,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 20:28:03,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:28:03,344 INFO L87 Difference]: Start difference. First operand 796 states and 985 transitions. Second operand 42 states. [2018-02-02 20:28:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:03,898 INFO L93 Difference]: Finished difference Result 1034 states and 1193 transitions. [2018-02-02 20:28:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:28:03,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 532 [2018-02-02 20:28:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:03,901 INFO L225 Difference]: With dead ends: 1034 [2018-02-02 20:28:03,901 INFO L226 Difference]: Without dead ends: 1034 [2018-02-02 20:28:03,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:28:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-02-02 20:28:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 815. [2018-02-02 20:28:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-02-02 20:28:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1009 transitions. [2018-02-02 20:28:03,911 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1009 transitions. Word has length 532 [2018-02-02 20:28:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:03,911 INFO L432 AbstractCegarLoop]: Abstraction has 815 states and 1009 transitions. [2018-02-02 20:28:03,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 20:28:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1009 transitions. [2018-02-02 20:28:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-02-02 20:28:03,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:03,914 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:03,914 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1005240804, now seen corresponding path program 38 times [2018-02-02 20:28:03,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:03,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-02-02 20:28:04,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:04,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 20:28:04,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4107 trivial. 0 not checked. [2018-02-02 20:28:04,932 INFO L182 omatonBuilderFactory]: Interpolants [42891#true, 42892#false, 42893#(= main_~i~1 0), 42894#(<= main_~i~1 1), 42895#(<= main_~i~1 2), 42896#(<= main_~i~1 3), 42897#(<= main_~i~1 4), 42898#(<= main_~i~1 5), 42899#(<= main_~i~1 6), 42900#(<= main_~i~1 7), 42901#(<= main_~i~1 8), 42902#(<= main_~i~1 9), 42903#(<= main_~i~1 10), 42904#(<= main_~i~1 11), 42905#(<= main_~i~1 12), 42906#(<= main_~i~1 13), 42907#(<= main_~i~1 14), 42908#(<= main_~i~1 15), 42909#(<= main_~i~1 16), 42910#(<= main_~i~1 17), 42911#(<= main_~i~1 18), 42912#(<= main_~i~1 19), 42913#(<= main_~i~1 20), 42914#(<= main_~i~1 21), 42915#(<= main_~i~1 22), 42916#(<= main_~i~1 23), 42917#(<= main_~i~1 24), 42918#(<= main_~i~1 25), 42919#(<= main_~i~1 26), 42920#(<= main_~i~1 27), 42921#(<= main_~i~1 28), 42922#(<= main_~i~1 29), 42923#(<= main_~i~1 30), 42924#(<= main_~i~1 31), 42925#(<= main_~i~1 32), 42926#(<= main_~i~1 33), 42927#(<= main_~i~1 34), 42928#(<= main_~i~1 35), 42929#(<= main_~i~1 36), 42930#(<= main_~i~1 37), 42931#(<= main_~i~1 38), 42932#(<= main_~i~1 39), 42933#(<= main_~i~1 40)] [2018-02-02 20:28:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-02-02 20:28:04,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 20:28:04,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 20:28:04,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:28:04,933 INFO L87 Difference]: Start difference. First operand 815 states and 1009 transitions. Second operand 43 states. [2018-02-02 20:28:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:05,510 INFO L93 Difference]: Finished difference Result 1058 states and 1221 transitions. [2018-02-02 20:28:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:28:05,510 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 545 [2018-02-02 20:28:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:05,513 INFO L225 Difference]: With dead ends: 1058 [2018-02-02 20:28:05,513 INFO L226 Difference]: Without dead ends: 1058 [2018-02-02 20:28:05,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:28:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-02-02 20:28:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 834. [2018-02-02 20:28:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-02-02 20:28:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1033 transitions. [2018-02-02 20:28:05,519 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1033 transitions. Word has length 545 [2018-02-02 20:28:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:05,519 INFO L432 AbstractCegarLoop]: Abstraction has 834 states and 1033 transitions. [2018-02-02 20:28:05,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 20:28:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1033 transitions. [2018-02-02 20:28:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-02-02 20:28:05,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:05,522 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:05,522 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1293489741, now seen corresponding path program 39 times [2018-02-02 20:28:05,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:05,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-02-02 20:28:06,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:06,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 20:28:06,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4332 trivial. 0 not checked. [2018-02-02 20:28:06,494 INFO L182 omatonBuilderFactory]: Interpolants [44864#(<= main_~i~1 36), 44865#(<= main_~i~1 37), 44866#(<= main_~i~1 38), 44867#(<= main_~i~1 39), 44868#(<= main_~i~1 40), 44869#(<= main_~i~1 41), 44826#true, 44827#false, 44828#(= main_~i~1 0), 44829#(<= main_~i~1 1), 44830#(<= main_~i~1 2), 44831#(<= main_~i~1 3), 44832#(<= main_~i~1 4), 44833#(<= main_~i~1 5), 44834#(<= main_~i~1 6), 44835#(<= main_~i~1 7), 44836#(<= main_~i~1 8), 44837#(<= main_~i~1 9), 44838#(<= main_~i~1 10), 44839#(<= main_~i~1 11), 44840#(<= main_~i~1 12), 44841#(<= main_~i~1 13), 44842#(<= main_~i~1 14), 44843#(<= main_~i~1 15), 44844#(<= main_~i~1 16), 44845#(<= main_~i~1 17), 44846#(<= main_~i~1 18), 44847#(<= main_~i~1 19), 44848#(<= main_~i~1 20), 44849#(<= main_~i~1 21), 44850#(<= main_~i~1 22), 44851#(<= main_~i~1 23), 44852#(<= main_~i~1 24), 44853#(<= main_~i~1 25), 44854#(<= main_~i~1 26), 44855#(<= main_~i~1 27), 44856#(<= main_~i~1 28), 44857#(<= main_~i~1 29), 44858#(<= main_~i~1 30), 44859#(<= main_~i~1 31), 44860#(<= main_~i~1 32), 44861#(<= main_~i~1 33), 44862#(<= main_~i~1 34), 44863#(<= main_~i~1 35)] [2018-02-02 20:28:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-02-02 20:28:06,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 20:28:06,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 20:28:06,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:28:06,495 INFO L87 Difference]: Start difference. First operand 834 states and 1033 transitions. Second operand 44 states. [2018-02-02 20:28:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:06,980 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2018-02-02 20:28:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:28:06,981 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 558 [2018-02-02 20:28:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:06,983 INFO L225 Difference]: With dead ends: 1082 [2018-02-02 20:28:06,983 INFO L226 Difference]: Without dead ends: 1082 [2018-02-02 20:28:06,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:28:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-02-02 20:28:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 853. [2018-02-02 20:28:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-02-02 20:28:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1057 transitions. [2018-02-02 20:28:06,989 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1057 transitions. Word has length 558 [2018-02-02 20:28:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:06,989 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 1057 transitions. [2018-02-02 20:28:06,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 20:28:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1057 transitions. [2018-02-02 20:28:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-02-02 20:28:06,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:06,992 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:06,992 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash -512218556, now seen corresponding path program 40 times [2018-02-02 20:28:06,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:07,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-02-02 20:28:08,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:08,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 20:28:08,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4563 trivial. 0 not checked. [2018-02-02 20:28:08,008 INFO L182 omatonBuilderFactory]: Interpolants [46848#(<= main_~i~1 41), 46849#(<= main_~i~1 42), 46805#true, 46806#false, 46807#(= main_~i~1 0), 46808#(<= main_~i~1 1), 46809#(<= main_~i~1 2), 46810#(<= main_~i~1 3), 46811#(<= main_~i~1 4), 46812#(<= main_~i~1 5), 46813#(<= main_~i~1 6), 46814#(<= main_~i~1 7), 46815#(<= main_~i~1 8), 46816#(<= main_~i~1 9), 46817#(<= main_~i~1 10), 46818#(<= main_~i~1 11), 46819#(<= main_~i~1 12), 46820#(<= main_~i~1 13), 46821#(<= main_~i~1 14), 46822#(<= main_~i~1 15), 46823#(<= main_~i~1 16), 46824#(<= main_~i~1 17), 46825#(<= main_~i~1 18), 46826#(<= main_~i~1 19), 46827#(<= main_~i~1 20), 46828#(<= main_~i~1 21), 46829#(<= main_~i~1 22), 46830#(<= main_~i~1 23), 46831#(<= main_~i~1 24), 46832#(<= main_~i~1 25), 46833#(<= main_~i~1 26), 46834#(<= main_~i~1 27), 46835#(<= main_~i~1 28), 46836#(<= main_~i~1 29), 46837#(<= main_~i~1 30), 46838#(<= main_~i~1 31), 46839#(<= main_~i~1 32), 46840#(<= main_~i~1 33), 46841#(<= main_~i~1 34), 46842#(<= main_~i~1 35), 46843#(<= main_~i~1 36), 46844#(<= main_~i~1 37), 46845#(<= main_~i~1 38), 46846#(<= main_~i~1 39), 46847#(<= main_~i~1 40)] [2018-02-02 20:28:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-02-02 20:28:08,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 20:28:08,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 20:28:08,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:28:08,009 INFO L87 Difference]: Start difference. First operand 853 states and 1057 transitions. Second operand 45 states. [2018-02-02 20:28:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:08,572 INFO L93 Difference]: Finished difference Result 1106 states and 1277 transitions. [2018-02-02 20:28:08,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:28:08,572 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 571 [2018-02-02 20:28:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:08,574 INFO L225 Difference]: With dead ends: 1106 [2018-02-02 20:28:08,574 INFO L226 Difference]: Without dead ends: 1106 [2018-02-02 20:28:08,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:28:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-02-02 20:28:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 872. [2018-02-02 20:28:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-02-02 20:28:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1081 transitions. [2018-02-02 20:28:08,581 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1081 transitions. Word has length 571 [2018-02-02 20:28:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:08,581 INFO L432 AbstractCegarLoop]: Abstraction has 872 states and 1081 transitions. [2018-02-02 20:28:08,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 20:28:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1081 transitions. [2018-02-02 20:28:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-02-02 20:28:08,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:08,584 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:08,584 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 126754131, now seen corresponding path program 41 times [2018-02-02 20:28:08,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:08,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-02-02 20:28:09,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:09,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 20:28:09,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2018-02-02 20:28:09,699 INFO L182 omatonBuilderFactory]: Interpolants [48832#(<= main_~i~1 2), 48833#(<= main_~i~1 3), 48834#(<= main_~i~1 4), 48835#(<= main_~i~1 5), 48836#(<= main_~i~1 6), 48837#(<= main_~i~1 7), 48838#(<= main_~i~1 8), 48839#(<= main_~i~1 9), 48840#(<= main_~i~1 10), 48841#(<= main_~i~1 11), 48842#(<= main_~i~1 12), 48843#(<= main_~i~1 13), 48844#(<= main_~i~1 14), 48845#(<= main_~i~1 15), 48846#(<= main_~i~1 16), 48847#(<= main_~i~1 17), 48848#(<= main_~i~1 18), 48849#(<= main_~i~1 19), 48850#(<= main_~i~1 20), 48851#(<= main_~i~1 21), 48852#(<= main_~i~1 22), 48853#(<= main_~i~1 23), 48854#(<= main_~i~1 24), 48855#(<= main_~i~1 25), 48856#(<= main_~i~1 26), 48857#(<= main_~i~1 27), 48858#(<= main_~i~1 28), 48859#(<= main_~i~1 29), 48860#(<= main_~i~1 30), 48861#(<= main_~i~1 31), 48862#(<= main_~i~1 32), 48863#(<= main_~i~1 33), 48864#(<= main_~i~1 34), 48865#(<= main_~i~1 35), 48866#(<= main_~i~1 36), 48867#(<= main_~i~1 37), 48868#(<= main_~i~1 38), 48869#(<= main_~i~1 39), 48870#(<= main_~i~1 40), 48871#(<= main_~i~1 41), 48872#(<= main_~i~1 42), 48873#(<= main_~i~1 43), 48828#true, 48829#false, 48830#(= main_~i~1 0), 48831#(<= main_~i~1 1)] [2018-02-02 20:28:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-02-02 20:28:09,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 20:28:09,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 20:28:09,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:28:09,700 INFO L87 Difference]: Start difference. First operand 872 states and 1081 transitions. Second operand 46 states. [2018-02-02 20:28:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:10,340 INFO L93 Difference]: Finished difference Result 1130 states and 1305 transitions. [2018-02-02 20:28:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 20:28:10,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 584 [2018-02-02 20:28:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:10,344 INFO L225 Difference]: With dead ends: 1130 [2018-02-02 20:28:10,344 INFO L226 Difference]: Without dead ends: 1130 [2018-02-02 20:28:10,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:28:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-02-02 20:28:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 891. [2018-02-02 20:28:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-02-02 20:28:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1105 transitions. [2018-02-02 20:28:10,352 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1105 transitions. Word has length 584 [2018-02-02 20:28:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:10,352 INFO L432 AbstractCegarLoop]: Abstraction has 891 states and 1105 transitions. [2018-02-02 20:28:10,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 20:28:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1105 transitions. [2018-02-02 20:28:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-02-02 20:28:10,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:10,355 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:10,355 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -302392668, now seen corresponding path program 42 times [2018-02-02 20:28:10,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:10,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-02-02 20:28:11,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:11,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 20:28:11,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5043 trivial. 0 not checked. [2018-02-02 20:28:11,493 INFO L182 omatonBuilderFactory]: Interpolants [50895#true, 50896#false, 50897#(= main_~i~1 0), 50898#(<= main_~i~1 1), 50899#(<= main_~i~1 2), 50900#(<= main_~i~1 3), 50901#(<= main_~i~1 4), 50902#(<= main_~i~1 5), 50903#(<= main_~i~1 6), 50904#(<= main_~i~1 7), 50905#(<= main_~i~1 8), 50906#(<= main_~i~1 9), 50907#(<= main_~i~1 10), 50908#(<= main_~i~1 11), 50909#(<= main_~i~1 12), 50910#(<= main_~i~1 13), 50911#(<= main_~i~1 14), 50912#(<= main_~i~1 15), 50913#(<= main_~i~1 16), 50914#(<= main_~i~1 17), 50915#(<= main_~i~1 18), 50916#(<= main_~i~1 19), 50917#(<= main_~i~1 20), 50918#(<= main_~i~1 21), 50919#(<= main_~i~1 22), 50920#(<= main_~i~1 23), 50921#(<= main_~i~1 24), 50922#(<= main_~i~1 25), 50923#(<= main_~i~1 26), 50924#(<= main_~i~1 27), 50925#(<= main_~i~1 28), 50926#(<= main_~i~1 29), 50927#(<= main_~i~1 30), 50928#(<= main_~i~1 31), 50929#(<= main_~i~1 32), 50930#(<= main_~i~1 33), 50931#(<= main_~i~1 34), 50932#(<= main_~i~1 35), 50933#(<= main_~i~1 36), 50934#(<= main_~i~1 37), 50935#(<= main_~i~1 38), 50936#(<= main_~i~1 39), 50937#(<= main_~i~1 40), 50938#(<= main_~i~1 41), 50939#(<= main_~i~1 42), 50940#(<= main_~i~1 43), 50941#(<= main_~i~1 44)] [2018-02-02 20:28:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-02-02 20:28:11,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 20:28:11,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 20:28:11,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:28:11,494 INFO L87 Difference]: Start difference. First operand 891 states and 1105 transitions. Second operand 47 states. [2018-02-02 20:28:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:12,145 INFO L93 Difference]: Finished difference Result 1154 states and 1333 transitions. [2018-02-02 20:28:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:28:12,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 597 [2018-02-02 20:28:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:12,148 INFO L225 Difference]: With dead ends: 1154 [2018-02-02 20:28:12,149 INFO L226 Difference]: Without dead ends: 1154 [2018-02-02 20:28:12,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:28:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-02-02 20:28:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 910. [2018-02-02 20:28:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-02-02 20:28:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1129 transitions. [2018-02-02 20:28:12,160 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1129 transitions. Word has length 597 [2018-02-02 20:28:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:12,160 INFO L432 AbstractCegarLoop]: Abstraction has 910 states and 1129 transitions. [2018-02-02 20:28:12,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 20:28:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1129 transitions. [2018-02-02 20:28:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-02-02 20:28:12,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:12,164 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:12,164 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1115031795, now seen corresponding path program 43 times [2018-02-02 20:28:12,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:12,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-02-02 20:28:13,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:13,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 20:28:13,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5292 trivial. 0 not checked. [2018-02-02 20:28:13,341 INFO L182 omatonBuilderFactory]: Interpolants [53006#true, 53007#false, 53008#(= main_~i~1 0), 53009#(<= main_~i~1 1), 53010#(<= main_~i~1 2), 53011#(<= main_~i~1 3), 53012#(<= main_~i~1 4), 53013#(<= main_~i~1 5), 53014#(<= main_~i~1 6), 53015#(<= main_~i~1 7), 53016#(<= main_~i~1 8), 53017#(<= main_~i~1 9), 53018#(<= main_~i~1 10), 53019#(<= main_~i~1 11), 53020#(<= main_~i~1 12), 53021#(<= main_~i~1 13), 53022#(<= main_~i~1 14), 53023#(<= main_~i~1 15), 53024#(<= main_~i~1 16), 53025#(<= main_~i~1 17), 53026#(<= main_~i~1 18), 53027#(<= main_~i~1 19), 53028#(<= main_~i~1 20), 53029#(<= main_~i~1 21), 53030#(<= main_~i~1 22), 53031#(<= main_~i~1 23), 53032#(<= main_~i~1 24), 53033#(<= main_~i~1 25), 53034#(<= main_~i~1 26), 53035#(<= main_~i~1 27), 53036#(<= main_~i~1 28), 53037#(<= main_~i~1 29), 53038#(<= main_~i~1 30), 53039#(<= main_~i~1 31), 53040#(<= main_~i~1 32), 53041#(<= main_~i~1 33), 53042#(<= main_~i~1 34), 53043#(<= main_~i~1 35), 53044#(<= main_~i~1 36), 53045#(<= main_~i~1 37), 53046#(<= main_~i~1 38), 53047#(<= main_~i~1 39), 53048#(<= main_~i~1 40), 53049#(<= main_~i~1 41), 53050#(<= main_~i~1 42), 53051#(<= main_~i~1 43), 53052#(<= main_~i~1 44), 53053#(<= main_~i~1 45)] [2018-02-02 20:28:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-02-02 20:28:13,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 20:28:13,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 20:28:13,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:28:13,342 INFO L87 Difference]: Start difference. First operand 910 states and 1129 transitions. Second operand 48 states. [2018-02-02 20:28:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:14,152 INFO L93 Difference]: Finished difference Result 1178 states and 1361 transitions. [2018-02-02 20:28:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 20:28:14,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 610 [2018-02-02 20:28:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:14,155 INFO L225 Difference]: With dead ends: 1178 [2018-02-02 20:28:14,155 INFO L226 Difference]: Without dead ends: 1178 [2018-02-02 20:28:14,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:28:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-02-02 20:28:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 929. [2018-02-02 20:28:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-02-02 20:28:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1153 transitions. [2018-02-02 20:28:14,162 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1153 transitions. Word has length 610 [2018-02-02 20:28:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:14,162 INFO L432 AbstractCegarLoop]: Abstraction has 929 states and 1153 transitions. [2018-02-02 20:28:14,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 20:28:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1153 transitions. [2018-02-02 20:28:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-02-02 20:28:14,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:14,165 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:14,165 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1524247804, now seen corresponding path program 44 times [2018-02-02 20:28:14,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:14,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-02-02 20:28:15,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:15,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 20:28:15,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5547 trivial. 0 not checked. [2018-02-02 20:28:15,449 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= main_~i~1 5), 55169#(<= main_~i~1 6), 55170#(<= main_~i~1 7), 55171#(<= main_~i~1 8), 55172#(<= main_~i~1 9), 55173#(<= main_~i~1 10), 55174#(<= main_~i~1 11), 55175#(<= main_~i~1 12), 55176#(<= main_~i~1 13), 55177#(<= main_~i~1 14), 55178#(<= main_~i~1 15), 55179#(<= main_~i~1 16), 55180#(<= main_~i~1 17), 55181#(<= main_~i~1 18), 55182#(<= main_~i~1 19), 55183#(<= main_~i~1 20), 55184#(<= main_~i~1 21), 55185#(<= main_~i~1 22), 55186#(<= main_~i~1 23), 55187#(<= main_~i~1 24), 55188#(<= main_~i~1 25), 55189#(<= main_~i~1 26), 55190#(<= main_~i~1 27), 55191#(<= main_~i~1 28), 55192#(<= main_~i~1 29), 55193#(<= main_~i~1 30), 55194#(<= main_~i~1 31), 55195#(<= main_~i~1 32), 55196#(<= main_~i~1 33), 55197#(<= main_~i~1 34), 55198#(<= main_~i~1 35), 55199#(<= main_~i~1 36), 55200#(<= main_~i~1 37), 55201#(<= main_~i~1 38), 55202#(<= main_~i~1 39), 55203#(<= main_~i~1 40), 55204#(<= main_~i~1 41), 55205#(<= main_~i~1 42), 55206#(<= main_~i~1 43), 55207#(<= main_~i~1 44), 55208#(<= main_~i~1 45), 55209#(<= main_~i~1 46), 55161#true, 55162#false, 55163#(= main_~i~1 0), 55164#(<= main_~i~1 1), 55165#(<= main_~i~1 2), 55166#(<= main_~i~1 3), 55167#(<= main_~i~1 4)] [2018-02-02 20:28:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-02-02 20:28:15,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 20:28:15,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 20:28:15,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:28:15,450 INFO L87 Difference]: Start difference. First operand 929 states and 1153 transitions. Second operand 49 states. [2018-02-02 20:28:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:16,107 INFO L93 Difference]: Finished difference Result 1202 states and 1389 transitions. [2018-02-02 20:28:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:28:16,107 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 623 [2018-02-02 20:28:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:16,110 INFO L225 Difference]: With dead ends: 1202 [2018-02-02 20:28:16,110 INFO L226 Difference]: Without dead ends: 1202 [2018-02-02 20:28:16,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:28:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-02-02 20:28:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 948. [2018-02-02 20:28:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-02-02 20:28:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1177 transitions. [2018-02-02 20:28:16,118 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1177 transitions. Word has length 623 [2018-02-02 20:28:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:16,119 INFO L432 AbstractCegarLoop]: Abstraction has 948 states and 1177 transitions. [2018-02-02 20:28:16,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 20:28:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1177 transitions. [2018-02-02 20:28:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-02-02 20:28:16,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:16,122 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:16,122 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1470672019, now seen corresponding path program 45 times [2018-02-02 20:28:16,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:16,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-02-02 20:28:17,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:17,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-02 20:28:17,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5808 trivial. 0 not checked. [2018-02-02 20:28:17,467 INFO L182 omatonBuilderFactory]: Interpolants [57360#true, 57361#false, 57362#(= main_~i~1 0), 57363#(<= main_~i~1 1), 57364#(<= main_~i~1 2), 57365#(<= main_~i~1 3), 57366#(<= main_~i~1 4), 57367#(<= main_~i~1 5), 57368#(<= main_~i~1 6), 57369#(<= main_~i~1 7), 57370#(<= main_~i~1 8), 57371#(<= main_~i~1 9), 57372#(<= main_~i~1 10), 57373#(<= main_~i~1 11), 57374#(<= main_~i~1 12), 57375#(<= main_~i~1 13), 57376#(<= main_~i~1 14), 57377#(<= main_~i~1 15), 57378#(<= main_~i~1 16), 57379#(<= main_~i~1 17), 57380#(<= main_~i~1 18), 57381#(<= main_~i~1 19), 57382#(<= main_~i~1 20), 57383#(<= main_~i~1 21), 57384#(<= main_~i~1 22), 57385#(<= main_~i~1 23), 57386#(<= main_~i~1 24), 57387#(<= main_~i~1 25), 57388#(<= main_~i~1 26), 57389#(<= main_~i~1 27), 57390#(<= main_~i~1 28), 57391#(<= main_~i~1 29), 57392#(<= main_~i~1 30), 57393#(<= main_~i~1 31), 57394#(<= main_~i~1 32), 57395#(<= main_~i~1 33), 57396#(<= main_~i~1 34), 57397#(<= main_~i~1 35), 57398#(<= main_~i~1 36), 57399#(<= main_~i~1 37), 57400#(<= main_~i~1 38), 57401#(<= main_~i~1 39), 57402#(<= main_~i~1 40), 57403#(<= main_~i~1 41), 57404#(<= main_~i~1 42), 57405#(<= main_~i~1 43), 57406#(<= main_~i~1 44), 57407#(<= main_~i~1 45), 57408#(<= main_~i~1 46), 57409#(<= main_~i~1 47)] [2018-02-02 20:28:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-02-02 20:28:17,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 20:28:17,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 20:28:17,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:28:17,468 INFO L87 Difference]: Start difference. First operand 948 states and 1177 transitions. Second operand 50 states. [2018-02-02 20:28:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:18,189 INFO L93 Difference]: Finished difference Result 1226 states and 1417 transitions. [2018-02-02 20:28:18,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 20:28:18,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 636 [2018-02-02 20:28:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:18,191 INFO L225 Difference]: With dead ends: 1226 [2018-02-02 20:28:18,192 INFO L226 Difference]: Without dead ends: 1226 [2018-02-02 20:28:18,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:28:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-02-02 20:28:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 967. [2018-02-02 20:28:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-02-02 20:28:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1201 transitions. [2018-02-02 20:28:18,200 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1201 transitions. Word has length 636 [2018-02-02 20:28:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:18,200 INFO L432 AbstractCegarLoop]: Abstraction has 967 states and 1201 transitions. [2018-02-02 20:28:18,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 20:28:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1201 transitions. [2018-02-02 20:28:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-02-02 20:28:18,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:18,203 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:18,203 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:18,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1932661604, now seen corresponding path program 46 times [2018-02-02 20:28:18,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:18,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-02-02 20:28:19,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:19,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 20:28:19,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked. [2018-02-02 20:28:19,596 INFO L182 omatonBuilderFactory]: Interpolants [59648#(<= main_~i~1 43), 59649#(<= main_~i~1 44), 59650#(<= main_~i~1 45), 59651#(<= main_~i~1 46), 59652#(<= main_~i~1 47), 59653#(<= main_~i~1 48), 59603#true, 59604#false, 59605#(= main_~i~1 0), 59606#(<= main_~i~1 1), 59607#(<= main_~i~1 2), 59608#(<= main_~i~1 3), 59609#(<= main_~i~1 4), 59610#(<= main_~i~1 5), 59611#(<= main_~i~1 6), 59612#(<= main_~i~1 7), 59613#(<= main_~i~1 8), 59614#(<= main_~i~1 9), 59615#(<= main_~i~1 10), 59616#(<= main_~i~1 11), 59617#(<= main_~i~1 12), 59618#(<= main_~i~1 13), 59619#(<= main_~i~1 14), 59620#(<= main_~i~1 15), 59621#(<= main_~i~1 16), 59622#(<= main_~i~1 17), 59623#(<= main_~i~1 18), 59624#(<= main_~i~1 19), 59625#(<= main_~i~1 20), 59626#(<= main_~i~1 21), 59627#(<= main_~i~1 22), 59628#(<= main_~i~1 23), 59629#(<= main_~i~1 24), 59630#(<= main_~i~1 25), 59631#(<= main_~i~1 26), 59632#(<= main_~i~1 27), 59633#(<= main_~i~1 28), 59634#(<= main_~i~1 29), 59635#(<= main_~i~1 30), 59636#(<= main_~i~1 31), 59637#(<= main_~i~1 32), 59638#(<= main_~i~1 33), 59639#(<= main_~i~1 34), 59640#(<= main_~i~1 35), 59641#(<= main_~i~1 36), 59642#(<= main_~i~1 37), 59643#(<= main_~i~1 38), 59644#(<= main_~i~1 39), 59645#(<= main_~i~1 40), 59646#(<= main_~i~1 41), 59647#(<= main_~i~1 42)] [2018-02-02 20:28:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-02-02 20:28:19,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 20:28:19,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 20:28:19,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:28:19,597 INFO L87 Difference]: Start difference. First operand 967 states and 1201 transitions. Second operand 51 states. [2018-02-02 20:28:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:20,304 INFO L93 Difference]: Finished difference Result 1250 states and 1445 transitions. [2018-02-02 20:28:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 20:28:20,304 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 649 [2018-02-02 20:28:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:20,306 INFO L225 Difference]: With dead ends: 1250 [2018-02-02 20:28:20,306 INFO L226 Difference]: Without dead ends: 1250 [2018-02-02 20:28:20,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:28:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-02 20:28:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 986. [2018-02-02 20:28:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-02-02 20:28:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1225 transitions. [2018-02-02 20:28:20,313 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1225 transitions. Word has length 649 [2018-02-02 20:28:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:20,313 INFO L432 AbstractCegarLoop]: Abstraction has 986 states and 1225 transitions. [2018-02-02 20:28:20,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 20:28:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1225 transitions. [2018-02-02 20:28:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-02-02 20:28:20,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:20,317 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:20,317 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -491780045, now seen corresponding path program 47 times [2018-02-02 20:28:20,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:20,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-02-02 20:28:21,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:21,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-02 20:28:21,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6348 trivial. 0 not checked. [2018-02-02 20:28:21,756 INFO L182 omatonBuilderFactory]: Interpolants [61890#true, 61891#false, 61892#(= main_~i~1 0), 61893#(<= main_~i~1 1), 61894#(<= main_~i~1 2), 61895#(<= main_~i~1 3), 61896#(<= main_~i~1 4), 61897#(<= main_~i~1 5), 61898#(<= main_~i~1 6), 61899#(<= main_~i~1 7), 61900#(<= main_~i~1 8), 61901#(<= main_~i~1 9), 61902#(<= main_~i~1 10), 61903#(<= main_~i~1 11), 61904#(<= main_~i~1 12), 61905#(<= main_~i~1 13), 61906#(<= main_~i~1 14), 61907#(<= main_~i~1 15), 61908#(<= main_~i~1 16), 61909#(<= main_~i~1 17), 61910#(<= main_~i~1 18), 61911#(<= main_~i~1 19), 61912#(<= main_~i~1 20), 61913#(<= main_~i~1 21), 61914#(<= main_~i~1 22), 61915#(<= main_~i~1 23), 61916#(<= main_~i~1 24), 61917#(<= main_~i~1 25), 61918#(<= main_~i~1 26), 61919#(<= main_~i~1 27), 61920#(<= main_~i~1 28), 61921#(<= main_~i~1 29), 61922#(<= main_~i~1 30), 61923#(<= main_~i~1 31), 61924#(<= main_~i~1 32), 61925#(<= main_~i~1 33), 61926#(<= main_~i~1 34), 61927#(<= main_~i~1 35), 61928#(<= main_~i~1 36), 61929#(<= main_~i~1 37), 61930#(<= main_~i~1 38), 61931#(<= main_~i~1 39), 61932#(<= main_~i~1 40), 61933#(<= main_~i~1 41), 61934#(<= main_~i~1 42), 61935#(<= main_~i~1 43), 61936#(<= main_~i~1 44), 61937#(<= main_~i~1 45), 61938#(<= main_~i~1 46), 61939#(<= main_~i~1 47), 61940#(<= main_~i~1 48), 61941#(<= main_~i~1 49)] [2018-02-02 20:28:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-02-02 20:28:21,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 20:28:21,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 20:28:21,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:28:21,757 INFO L87 Difference]: Start difference. First operand 986 states and 1225 transitions. Second operand 52 states. [2018-02-02 20:28:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:22,600 INFO L93 Difference]: Finished difference Result 1274 states and 1473 transitions. [2018-02-02 20:28:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 20:28:22,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 662 [2018-02-02 20:28:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:22,603 INFO L225 Difference]: With dead ends: 1274 [2018-02-02 20:28:22,603 INFO L226 Difference]: Without dead ends: 1274 [2018-02-02 20:28:22,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:28:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-02-02 20:28:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1005. [2018-02-02 20:28:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2018-02-02 20:28:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1249 transitions. [2018-02-02 20:28:22,612 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1249 transitions. Word has length 662 [2018-02-02 20:28:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:22,613 INFO L432 AbstractCegarLoop]: Abstraction has 1005 states and 1249 transitions. [2018-02-02 20:28:22,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 20:28:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1249 transitions. [2018-02-02 20:28:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-02-02 20:28:22,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:22,616 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:22,616 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1289001924, now seen corresponding path program 48 times [2018-02-02 20:28:22,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:22,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-02-02 20:28:24,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:24,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 20:28:24,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6627 trivial. 0 not checked. [2018-02-02 20:28:24,139 INFO L182 omatonBuilderFactory]: Interpolants [64256#(<= main_~i~1 33), 64257#(<= main_~i~1 34), 64258#(<= main_~i~1 35), 64259#(<= main_~i~1 36), 64260#(<= main_~i~1 37), 64261#(<= main_~i~1 38), 64262#(<= main_~i~1 39), 64263#(<= main_~i~1 40), 64264#(<= main_~i~1 41), 64265#(<= main_~i~1 42), 64266#(<= main_~i~1 43), 64267#(<= main_~i~1 44), 64268#(<= main_~i~1 45), 64269#(<= main_~i~1 46), 64270#(<= main_~i~1 47), 64271#(<= main_~i~1 48), 64272#(<= main_~i~1 49), 64273#(<= main_~i~1 50), 64221#true, 64222#false, 64223#(= main_~i~1 0), 64224#(<= main_~i~1 1), 64225#(<= main_~i~1 2), 64226#(<= main_~i~1 3), 64227#(<= main_~i~1 4), 64228#(<= main_~i~1 5), 64229#(<= main_~i~1 6), 64230#(<= main_~i~1 7), 64231#(<= main_~i~1 8), 64232#(<= main_~i~1 9), 64233#(<= main_~i~1 10), 64234#(<= main_~i~1 11), 64235#(<= main_~i~1 12), 64236#(<= main_~i~1 13), 64237#(<= main_~i~1 14), 64238#(<= main_~i~1 15), 64239#(<= main_~i~1 16), 64240#(<= main_~i~1 17), 64241#(<= main_~i~1 18), 64242#(<= main_~i~1 19), 64243#(<= main_~i~1 20), 64244#(<= main_~i~1 21), 64245#(<= main_~i~1 22), 64246#(<= main_~i~1 23), 64247#(<= main_~i~1 24), 64248#(<= main_~i~1 25), 64249#(<= main_~i~1 26), 64250#(<= main_~i~1 27), 64251#(<= main_~i~1 28), 64252#(<= main_~i~1 29), 64253#(<= main_~i~1 30), 64254#(<= main_~i~1 31), 64255#(<= main_~i~1 32)] [2018-02-02 20:28:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-02-02 20:28:24,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 20:28:24,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 20:28:24,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:28:24,140 INFO L87 Difference]: Start difference. First operand 1005 states and 1249 transitions. Second operand 53 states. [2018-02-02 20:28:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:24,794 INFO L93 Difference]: Finished difference Result 1298 states and 1501 transitions. [2018-02-02 20:28:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 20:28:24,795 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 675 [2018-02-02 20:28:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:24,798 INFO L225 Difference]: With dead ends: 1298 [2018-02-02 20:28:24,798 INFO L226 Difference]: Without dead ends: 1298 [2018-02-02 20:28:24,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:28:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-02-02 20:28:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1024. [2018-02-02 20:28:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-02-02 20:28:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1273 transitions. [2018-02-02 20:28:24,813 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1273 transitions. Word has length 675 [2018-02-02 20:28:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:24,813 INFO L432 AbstractCegarLoop]: Abstraction has 1024 states and 1273 transitions. [2018-02-02 20:28:24,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 20:28:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1273 transitions. [2018-02-02 20:28:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-02-02 20:28:24,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:24,820 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:24,820 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -963241005, now seen corresponding path program 49 times [2018-02-02 20:28:24,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:24,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-02-02 20:28:26,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:26,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-02 20:28:26,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6912 trivial. 0 not checked. [2018-02-02 20:28:26,460 INFO L182 omatonBuilderFactory]: Interpolants [66597#false, 66596#true, 66599#(<= main_~i~1 1), 66598#(= main_~i~1 0), 66601#(<= main_~i~1 3), 66600#(<= main_~i~1 2), 66603#(<= main_~i~1 5), 66602#(<= main_~i~1 4), 66605#(<= main_~i~1 7), 66604#(<= main_~i~1 6), 66607#(<= main_~i~1 9), 66606#(<= main_~i~1 8), 66609#(<= main_~i~1 11), 66608#(<= main_~i~1 10), 66611#(<= main_~i~1 13), 66610#(<= main_~i~1 12), 66613#(<= main_~i~1 15), 66612#(<= main_~i~1 14), 66615#(<= main_~i~1 17), 66614#(<= main_~i~1 16), 66617#(<= main_~i~1 19), 66616#(<= main_~i~1 18), 66619#(<= main_~i~1 21), 66618#(<= main_~i~1 20), 66621#(<= main_~i~1 23), 66620#(<= main_~i~1 22), 66623#(<= main_~i~1 25), 66622#(<= main_~i~1 24), 66625#(<= main_~i~1 27), 66624#(<= main_~i~1 26), 66627#(<= main_~i~1 29), 66626#(<= main_~i~1 28), 66629#(<= main_~i~1 31), 66628#(<= main_~i~1 30), 66631#(<= main_~i~1 33), 66630#(<= main_~i~1 32), 66633#(<= main_~i~1 35), 66632#(<= main_~i~1 34), 66635#(<= main_~i~1 37), 66634#(<= main_~i~1 36), 66637#(<= main_~i~1 39), 66636#(<= main_~i~1 38), 66639#(<= main_~i~1 41), 66638#(<= main_~i~1 40), 66641#(<= main_~i~1 43), 66640#(<= main_~i~1 42), 66643#(<= main_~i~1 45), 66642#(<= main_~i~1 44), 66645#(<= main_~i~1 47), 66644#(<= main_~i~1 46), 66647#(<= main_~i~1 49), 66646#(<= main_~i~1 48), 66649#(<= main_~i~1 51), 66648#(<= main_~i~1 50)] [2018-02-02 20:28:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-02-02 20:28:26,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 20:28:26,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 20:28:26,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:28:26,461 INFO L87 Difference]: Start difference. First operand 1024 states and 1273 transitions. Second operand 54 states. [2018-02-02 20:28:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:27,161 INFO L93 Difference]: Finished difference Result 1322 states and 1529 transitions. [2018-02-02 20:28:27,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:28:27,161 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 688 [2018-02-02 20:28:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:27,163 INFO L225 Difference]: With dead ends: 1322 [2018-02-02 20:28:27,163 INFO L226 Difference]: Without dead ends: 1322 [2018-02-02 20:28:27,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:28:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-02-02 20:28:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1043. [2018-02-02 20:28:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-02-02 20:28:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1297 transitions. [2018-02-02 20:28:27,171 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1297 transitions. Word has length 688 [2018-02-02 20:28:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:27,171 INFO L432 AbstractCegarLoop]: Abstraction has 1043 states and 1297 transitions. [2018-02-02 20:28:27,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 20:28:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1297 transitions. [2018-02-02 20:28:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-02-02 20:28:27,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:27,175 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:27,175 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 256076836, now seen corresponding path program 50 times [2018-02-02 20:28:27,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:27,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-02-02 20:28:28,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:28,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 20:28:28,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7203 trivial. 0 not checked. [2018-02-02 20:28:28,858 INFO L182 omatonBuilderFactory]: Interpolants [69015#true, 69017#(= main_~i~1 0), 69016#false, 69019#(<= main_~i~1 2), 69018#(<= main_~i~1 1), 69021#(<= main_~i~1 4), 69020#(<= main_~i~1 3), 69023#(<= main_~i~1 6), 69022#(<= main_~i~1 5), 69025#(<= main_~i~1 8), 69024#(<= main_~i~1 7), 69027#(<= main_~i~1 10), 69026#(<= main_~i~1 9), 69029#(<= main_~i~1 12), 69028#(<= main_~i~1 11), 69031#(<= main_~i~1 14), 69030#(<= main_~i~1 13), 69033#(<= main_~i~1 16), 69032#(<= main_~i~1 15), 69035#(<= main_~i~1 18), 69034#(<= main_~i~1 17), 69037#(<= main_~i~1 20), 69036#(<= main_~i~1 19), 69039#(<= main_~i~1 22), 69038#(<= main_~i~1 21), 69041#(<= main_~i~1 24), 69040#(<= main_~i~1 23), 69043#(<= main_~i~1 26), 69042#(<= main_~i~1 25), 69045#(<= main_~i~1 28), 69044#(<= main_~i~1 27), 69047#(<= main_~i~1 30), 69046#(<= main_~i~1 29), 69049#(<= main_~i~1 32), 69048#(<= main_~i~1 31), 69051#(<= main_~i~1 34), 69050#(<= main_~i~1 33), 69053#(<= main_~i~1 36), 69052#(<= main_~i~1 35), 69055#(<= main_~i~1 38), 69054#(<= main_~i~1 37), 69057#(<= main_~i~1 40), 69056#(<= main_~i~1 39), 69059#(<= main_~i~1 42), 69058#(<= main_~i~1 41), 69061#(<= main_~i~1 44), 69060#(<= main_~i~1 43), 69063#(<= main_~i~1 46), 69062#(<= main_~i~1 45), 69065#(<= main_~i~1 48), 69064#(<= main_~i~1 47), 69067#(<= main_~i~1 50), 69066#(<= main_~i~1 49), 69069#(<= main_~i~1 52), 69068#(<= main_~i~1 51)] [2018-02-02 20:28:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-02-02 20:28:28,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 20:28:28,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 20:28:28,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:28:28,860 INFO L87 Difference]: Start difference. First operand 1043 states and 1297 transitions. Second operand 55 states. [2018-02-02 20:28:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:29,599 INFO L93 Difference]: Finished difference Result 1346 states and 1557 transitions. [2018-02-02 20:28:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 20:28:29,600 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 701 [2018-02-02 20:28:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:29,601 INFO L225 Difference]: With dead ends: 1346 [2018-02-02 20:28:29,601 INFO L226 Difference]: Without dead ends: 1346 [2018-02-02 20:28:29,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:28:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-02-02 20:28:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1062. [2018-02-02 20:28:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-02-02 20:28:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1321 transitions. [2018-02-02 20:28:29,609 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1321 transitions. Word has length 701 [2018-02-02 20:28:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:29,610 INFO L432 AbstractCegarLoop]: Abstraction has 1062 states and 1321 transitions. [2018-02-02 20:28:29,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 20:28:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1321 transitions. [2018-02-02 20:28:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2018-02-02 20:28:29,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:29,616 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:29,616 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash -840636557, now seen corresponding path program 51 times [2018-02-02 20:28:29,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:29,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-02-02 20:28:31,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:31,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-02 20:28:31,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2018-02-02 20:28:31,344 INFO L182 omatonBuilderFactory]: Interpolants [71479#false, 71478#true, 71481#(<= main_~i~1 1), 71480#(= main_~i~1 0), 71483#(<= main_~i~1 3), 71482#(<= main_~i~1 2), 71485#(<= main_~i~1 5), 71484#(<= main_~i~1 4), 71487#(<= main_~i~1 7), 71486#(<= main_~i~1 6), 71489#(<= main_~i~1 9), 71488#(<= main_~i~1 8), 71491#(<= main_~i~1 11), 71490#(<= main_~i~1 10), 71493#(<= main_~i~1 13), 71492#(<= main_~i~1 12), 71495#(<= main_~i~1 15), 71494#(<= main_~i~1 14), 71497#(<= main_~i~1 17), 71496#(<= main_~i~1 16), 71499#(<= main_~i~1 19), 71498#(<= main_~i~1 18), 71501#(<= main_~i~1 21), 71500#(<= main_~i~1 20), 71503#(<= main_~i~1 23), 71502#(<= main_~i~1 22), 71505#(<= main_~i~1 25), 71504#(<= main_~i~1 24), 71507#(<= main_~i~1 27), 71506#(<= main_~i~1 26), 71509#(<= main_~i~1 29), 71508#(<= main_~i~1 28), 71511#(<= main_~i~1 31), 71510#(<= main_~i~1 30), 71513#(<= main_~i~1 33), 71512#(<= main_~i~1 32), 71515#(<= main_~i~1 35), 71514#(<= main_~i~1 34), 71517#(<= main_~i~1 37), 71516#(<= main_~i~1 36), 71519#(<= main_~i~1 39), 71518#(<= main_~i~1 38), 71521#(<= main_~i~1 41), 71520#(<= main_~i~1 40), 71523#(<= main_~i~1 43), 71522#(<= main_~i~1 42), 71525#(<= main_~i~1 45), 71524#(<= main_~i~1 44), 71527#(<= main_~i~1 47), 71526#(<= main_~i~1 46), 71529#(<= main_~i~1 49), 71528#(<= main_~i~1 48), 71531#(<= main_~i~1 51), 71530#(<= main_~i~1 50), 71533#(<= main_~i~1 53), 71532#(<= main_~i~1 52)] [2018-02-02 20:28:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-02-02 20:28:31,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 20:28:31,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 20:28:31,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:28:31,345 INFO L87 Difference]: Start difference. First operand 1062 states and 1321 transitions. Second operand 56 states. [2018-02-02 20:28:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:32,107 INFO L93 Difference]: Finished difference Result 1370 states and 1585 transitions. [2018-02-02 20:28:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 20:28:32,107 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 714 [2018-02-02 20:28:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:32,110 INFO L225 Difference]: With dead ends: 1370 [2018-02-02 20:28:32,110 INFO L226 Difference]: Without dead ends: 1370 [2018-02-02 20:28:32,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:28:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-02 20:28:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1081. [2018-02-02 20:28:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-02-02 20:28:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1345 transitions. [2018-02-02 20:28:32,118 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1345 transitions. Word has length 714 [2018-02-02 20:28:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:32,119 INFO L432 AbstractCegarLoop]: Abstraction has 1081 states and 1345 transitions. [2018-02-02 20:28:32,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 20:28:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1345 transitions. [2018-02-02 20:28:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-02-02 20:28:32,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:32,123 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:32,123 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -533429116, now seen corresponding path program 52 times [2018-02-02 20:28:32,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:32,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-02-02 20:28:33,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:33,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 20:28:33,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7803 trivial. 0 not checked. [2018-02-02 20:28:33,940 INFO L182 omatonBuilderFactory]: Interpolants [73985#true, 73987#(= main_~i~1 0), 73986#false, 73989#(<= main_~i~1 2), 73988#(<= main_~i~1 1), 73991#(<= main_~i~1 4), 73990#(<= main_~i~1 3), 73993#(<= main_~i~1 6), 73992#(<= main_~i~1 5), 73995#(<= main_~i~1 8), 73994#(<= main_~i~1 7), 73997#(<= main_~i~1 10), 73996#(<= main_~i~1 9), 73999#(<= main_~i~1 12), 73998#(<= main_~i~1 11), 74001#(<= main_~i~1 14), 74000#(<= main_~i~1 13), 74003#(<= main_~i~1 16), 74002#(<= main_~i~1 15), 74005#(<= main_~i~1 18), 74004#(<= main_~i~1 17), 74007#(<= main_~i~1 20), 74006#(<= main_~i~1 19), 74009#(<= main_~i~1 22), 74008#(<= main_~i~1 21), 74011#(<= main_~i~1 24), 74010#(<= main_~i~1 23), 74013#(<= main_~i~1 26), 74012#(<= main_~i~1 25), 74015#(<= main_~i~1 28), 74014#(<= main_~i~1 27), 74017#(<= main_~i~1 30), 74016#(<= main_~i~1 29), 74019#(<= main_~i~1 32), 74018#(<= main_~i~1 31), 74021#(<= main_~i~1 34), 74020#(<= main_~i~1 33), 74023#(<= main_~i~1 36), 74022#(<= main_~i~1 35), 74025#(<= main_~i~1 38), 74024#(<= main_~i~1 37), 74027#(<= main_~i~1 40), 74026#(<= main_~i~1 39), 74029#(<= main_~i~1 42), 74028#(<= main_~i~1 41), 74031#(<= main_~i~1 44), 74030#(<= main_~i~1 43), 74033#(<= main_~i~1 46), 74032#(<= main_~i~1 45), 74035#(<= main_~i~1 48), 74034#(<= main_~i~1 47), 74037#(<= main_~i~1 50), 74036#(<= main_~i~1 49), 74039#(<= main_~i~1 52), 74038#(<= main_~i~1 51), 74041#(<= main_~i~1 54), 74040#(<= main_~i~1 53)] [2018-02-02 20:28:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-02-02 20:28:33,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 20:28:33,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 20:28:33,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:28:33,941 INFO L87 Difference]: Start difference. First operand 1081 states and 1345 transitions. Second operand 57 states. [2018-02-02 20:28:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:34,836 INFO L93 Difference]: Finished difference Result 1394 states and 1613 transitions. [2018-02-02 20:28:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 20:28:34,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 727 [2018-02-02 20:28:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:34,838 INFO L225 Difference]: With dead ends: 1394 [2018-02-02 20:28:34,839 INFO L226 Difference]: Without dead ends: 1394 [2018-02-02 20:28:34,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:28:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-02-02 20:28:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1100. [2018-02-02 20:28:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-02-02 20:28:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1369 transitions. [2018-02-02 20:28:34,851 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1369 transitions. Word has length 727 [2018-02-02 20:28:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:34,852 INFO L432 AbstractCegarLoop]: Abstraction has 1100 states and 1369 transitions. [2018-02-02 20:28:34,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 20:28:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1369 transitions. [2018-02-02 20:28:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2018-02-02 20:28:34,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:34,858 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:34,858 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1252420371, now seen corresponding path program 53 times [2018-02-02 20:28:34,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:34,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-02-02 20:28:36,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:36,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-02 20:28:36,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8112 trivial. 0 not checked. [2018-02-02 20:28:36,799 INFO L182 omatonBuilderFactory]: Interpolants [76545#(<= main_~i~1 7), 76544#(<= main_~i~1 6), 76547#(<= main_~i~1 9), 76546#(<= main_~i~1 8), 76549#(<= main_~i~1 11), 76548#(<= main_~i~1 10), 76551#(<= main_~i~1 13), 76550#(<= main_~i~1 12), 76553#(<= main_~i~1 15), 76552#(<= main_~i~1 14), 76555#(<= main_~i~1 17), 76554#(<= main_~i~1 16), 76557#(<= main_~i~1 19), 76556#(<= main_~i~1 18), 76559#(<= main_~i~1 21), 76558#(<= main_~i~1 20), 76561#(<= main_~i~1 23), 76560#(<= main_~i~1 22), 76563#(<= main_~i~1 25), 76562#(<= main_~i~1 24), 76565#(<= main_~i~1 27), 76564#(<= main_~i~1 26), 76567#(<= main_~i~1 29), 76566#(<= main_~i~1 28), 76569#(<= main_~i~1 31), 76568#(<= main_~i~1 30), 76571#(<= main_~i~1 33), 76570#(<= main_~i~1 32), 76573#(<= main_~i~1 35), 76572#(<= main_~i~1 34), 76575#(<= main_~i~1 37), 76574#(<= main_~i~1 36), 76577#(<= main_~i~1 39), 76576#(<= main_~i~1 38), 76579#(<= main_~i~1 41), 76578#(<= main_~i~1 40), 76581#(<= main_~i~1 43), 76580#(<= main_~i~1 42), 76583#(<= main_~i~1 45), 76582#(<= main_~i~1 44), 76585#(<= main_~i~1 47), 76584#(<= main_~i~1 46), 76587#(<= main_~i~1 49), 76586#(<= main_~i~1 48), 76589#(<= main_~i~1 51), 76588#(<= main_~i~1 50), 76591#(<= main_~i~1 53), 76590#(<= main_~i~1 52), 76593#(<= main_~i~1 55), 76592#(<= main_~i~1 54), 76537#false, 76536#true, 76539#(<= main_~i~1 1), 76538#(= main_~i~1 0), 76541#(<= main_~i~1 3), 76540#(<= main_~i~1 2), 76543#(<= main_~i~1 5), 76542#(<= main_~i~1 4)] [2018-02-02 20:28:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-02-02 20:28:36,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 20:28:36,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 20:28:36,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:28:36,800 INFO L87 Difference]: Start difference. First operand 1100 states and 1369 transitions. Second operand 58 states. [2018-02-02 20:28:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:37,622 INFO L93 Difference]: Finished difference Result 1418 states and 1641 transitions. [2018-02-02 20:28:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 20:28:37,623 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 740 [2018-02-02 20:28:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:37,625 INFO L225 Difference]: With dead ends: 1418 [2018-02-02 20:28:37,625 INFO L226 Difference]: Without dead ends: 1418 [2018-02-02 20:28:37,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:28:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-02-02 20:28:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1119. [2018-02-02 20:28:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-02-02 20:28:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1393 transitions. [2018-02-02 20:28:37,638 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1393 transitions. Word has length 740 [2018-02-02 20:28:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:37,639 INFO L432 AbstractCegarLoop]: Abstraction has 1119 states and 1393 transitions. [2018-02-02 20:28:37,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 20:28:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1393 transitions. [2018-02-02 20:28:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2018-02-02 20:28:37,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:37,645 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:37,645 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1914837788, now seen corresponding path program 54 times [2018-02-02 20:28:37,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:37,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-02-02 20:28:39,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:39,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 20:28:39,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8427 trivial. 0 not checked. [2018-02-02 20:28:39,644 INFO L182 omatonBuilderFactory]: Interpolants [79131#true, 79133#(= main_~i~1 0), 79132#false, 79135#(<= main_~i~1 2), 79134#(<= main_~i~1 1), 79137#(<= main_~i~1 4), 79136#(<= main_~i~1 3), 79139#(<= main_~i~1 6), 79138#(<= main_~i~1 5), 79141#(<= main_~i~1 8), 79140#(<= main_~i~1 7), 79143#(<= main_~i~1 10), 79142#(<= main_~i~1 9), 79145#(<= main_~i~1 12), 79144#(<= main_~i~1 11), 79147#(<= main_~i~1 14), 79146#(<= main_~i~1 13), 79149#(<= main_~i~1 16), 79148#(<= main_~i~1 15), 79151#(<= main_~i~1 18), 79150#(<= main_~i~1 17), 79153#(<= main_~i~1 20), 79152#(<= main_~i~1 19), 79155#(<= main_~i~1 22), 79154#(<= main_~i~1 21), 79157#(<= main_~i~1 24), 79156#(<= main_~i~1 23), 79159#(<= main_~i~1 26), 79158#(<= main_~i~1 25), 79161#(<= main_~i~1 28), 79160#(<= main_~i~1 27), 79163#(<= main_~i~1 30), 79162#(<= main_~i~1 29), 79165#(<= main_~i~1 32), 79164#(<= main_~i~1 31), 79167#(<= main_~i~1 34), 79166#(<= main_~i~1 33), 79169#(<= main_~i~1 36), 79168#(<= main_~i~1 35), 79171#(<= main_~i~1 38), 79170#(<= main_~i~1 37), 79173#(<= main_~i~1 40), 79172#(<= main_~i~1 39), 79175#(<= main_~i~1 42), 79174#(<= main_~i~1 41), 79177#(<= main_~i~1 44), 79176#(<= main_~i~1 43), 79179#(<= main_~i~1 46), 79178#(<= main_~i~1 45), 79181#(<= main_~i~1 48), 79180#(<= main_~i~1 47), 79183#(<= main_~i~1 50), 79182#(<= main_~i~1 49), 79185#(<= main_~i~1 52), 79184#(<= main_~i~1 51), 79187#(<= main_~i~1 54), 79186#(<= main_~i~1 53), 79189#(<= main_~i~1 56), 79188#(<= main_~i~1 55)] [2018-02-02 20:28:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-02-02 20:28:39,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 20:28:39,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 20:28:39,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:28:39,645 INFO L87 Difference]: Start difference. First operand 1119 states and 1393 transitions. Second operand 59 states. [2018-02-02 20:28:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:40,511 INFO L93 Difference]: Finished difference Result 1442 states and 1669 transitions. [2018-02-02 20:28:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 20:28:40,511 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 753 [2018-02-02 20:28:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:40,514 INFO L225 Difference]: With dead ends: 1442 [2018-02-02 20:28:40,514 INFO L226 Difference]: Without dead ends: 1442 [2018-02-02 20:28:40,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:28:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-02-02 20:28:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1138. [2018-02-02 20:28:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-02-02 20:28:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1417 transitions. [2018-02-02 20:28:40,523 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1417 transitions. Word has length 753 [2018-02-02 20:28:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:40,524 INFO L432 AbstractCegarLoop]: Abstraction has 1138 states and 1417 transitions. [2018-02-02 20:28:40,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 20:28:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1417 transitions. [2018-02-02 20:28:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-02-02 20:28:40,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:40,527 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:40,527 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1234917709, now seen corresponding path program 55 times [2018-02-02 20:28:40,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:40,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 20:28:42,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:42,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-02 20:28:42,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8748 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8748 trivial. 0 not checked. [2018-02-02 20:28:42,553 INFO L182 omatonBuilderFactory]: Interpolants [81793#(<= main_~i~1 21), 81792#(<= main_~i~1 20), 81795#(<= main_~i~1 23), 81794#(<= main_~i~1 22), 81797#(<= main_~i~1 25), 81796#(<= main_~i~1 24), 81799#(<= main_~i~1 27), 81798#(<= main_~i~1 26), 81801#(<= main_~i~1 29), 81800#(<= main_~i~1 28), 81803#(<= main_~i~1 31), 81802#(<= main_~i~1 30), 81805#(<= main_~i~1 33), 81804#(<= main_~i~1 32), 81807#(<= main_~i~1 35), 81806#(<= main_~i~1 34), 81809#(<= main_~i~1 37), 81808#(<= main_~i~1 36), 81811#(<= main_~i~1 39), 81810#(<= main_~i~1 38), 81813#(<= main_~i~1 41), 81812#(<= main_~i~1 40), 81815#(<= main_~i~1 43), 81814#(<= main_~i~1 42), 81817#(<= main_~i~1 45), 81816#(<= main_~i~1 44), 81819#(<= main_~i~1 47), 81818#(<= main_~i~1 46), 81821#(<= main_~i~1 49), 81820#(<= main_~i~1 48), 81823#(<= main_~i~1 51), 81822#(<= main_~i~1 50), 81825#(<= main_~i~1 53), 81824#(<= main_~i~1 52), 81827#(<= main_~i~1 55), 81826#(<= main_~i~1 54), 81829#(<= main_~i~1 57), 81828#(<= main_~i~1 56), 81771#false, 81770#true, 81773#(<= main_~i~1 1), 81772#(= main_~i~1 0), 81775#(<= main_~i~1 3), 81774#(<= main_~i~1 2), 81777#(<= main_~i~1 5), 81776#(<= main_~i~1 4), 81779#(<= main_~i~1 7), 81778#(<= main_~i~1 6), 81781#(<= main_~i~1 9), 81780#(<= main_~i~1 8), 81783#(<= main_~i~1 11), 81782#(<= main_~i~1 10), 81785#(<= main_~i~1 13), 81784#(<= main_~i~1 12), 81787#(<= main_~i~1 15), 81786#(<= main_~i~1 14), 81789#(<= main_~i~1 17), 81788#(<= main_~i~1 16), 81791#(<= main_~i~1 19), 81790#(<= main_~i~1 18)] [2018-02-02 20:28:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-02-02 20:28:42,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 20:28:42,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 20:28:42,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:28:42,554 INFO L87 Difference]: Start difference. First operand 1138 states and 1417 transitions. Second operand 60 states. [2018-02-02 20:28:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:43,246 INFO L93 Difference]: Finished difference Result 1466 states and 1697 transitions. [2018-02-02 20:28:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 20:28:43,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 766 [2018-02-02 20:28:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:43,248 INFO L225 Difference]: With dead ends: 1466 [2018-02-02 20:28:43,248 INFO L226 Difference]: Without dead ends: 1466 [2018-02-02 20:28:43,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:28:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-02-02 20:28:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1157. [2018-02-02 20:28:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-02-02 20:28:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1441 transitions. [2018-02-02 20:28:43,256 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1441 transitions. Word has length 766 [2018-02-02 20:28:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:43,256 INFO L432 AbstractCegarLoop]: Abstraction has 1157 states and 1441 transitions. [2018-02-02 20:28:43,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 20:28:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1441 transitions. [2018-02-02 20:28:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-02-02 20:28:43,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:43,260 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:43,260 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash -285897404, now seen corresponding path program 56 times [2018-02-02 20:28:43,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:43,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-02-02 20:28:45,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:45,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 20:28:45,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9075 trivial. 0 not checked. [2018-02-02 20:28:45,464 INFO L182 omatonBuilderFactory]: Interpolants [84481#(<= main_~i~1 26), 84480#(<= main_~i~1 25), 84483#(<= main_~i~1 28), 84482#(<= main_~i~1 27), 84485#(<= main_~i~1 30), 84484#(<= main_~i~1 29), 84487#(<= main_~i~1 32), 84486#(<= main_~i~1 31), 84489#(<= main_~i~1 34), 84488#(<= main_~i~1 33), 84491#(<= main_~i~1 36), 84490#(<= main_~i~1 35), 84493#(<= main_~i~1 38), 84492#(<= main_~i~1 37), 84495#(<= main_~i~1 40), 84494#(<= main_~i~1 39), 84497#(<= main_~i~1 42), 84496#(<= main_~i~1 41), 84499#(<= main_~i~1 44), 84498#(<= main_~i~1 43), 84501#(<= main_~i~1 46), 84500#(<= main_~i~1 45), 84503#(<= main_~i~1 48), 84502#(<= main_~i~1 47), 84505#(<= main_~i~1 50), 84504#(<= main_~i~1 49), 84507#(<= main_~i~1 52), 84506#(<= main_~i~1 51), 84509#(<= main_~i~1 54), 84508#(<= main_~i~1 53), 84511#(<= main_~i~1 56), 84510#(<= main_~i~1 55), 84513#(<= main_~i~1 58), 84512#(<= main_~i~1 57), 84453#true, 84455#(= main_~i~1 0), 84454#false, 84457#(<= main_~i~1 2), 84456#(<= main_~i~1 1), 84459#(<= main_~i~1 4), 84458#(<= main_~i~1 3), 84461#(<= main_~i~1 6), 84460#(<= main_~i~1 5), 84463#(<= main_~i~1 8), 84462#(<= main_~i~1 7), 84465#(<= main_~i~1 10), 84464#(<= main_~i~1 9), 84467#(<= main_~i~1 12), 84466#(<= main_~i~1 11), 84469#(<= main_~i~1 14), 84468#(<= main_~i~1 13), 84471#(<= main_~i~1 16), 84470#(<= main_~i~1 15), 84473#(<= main_~i~1 18), 84472#(<= main_~i~1 17), 84475#(<= main_~i~1 20), 84474#(<= main_~i~1 19), 84477#(<= main_~i~1 22), 84476#(<= main_~i~1 21), 84479#(<= main_~i~1 24), 84478#(<= main_~i~1 23)] [2018-02-02 20:28:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-02-02 20:28:45,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 20:28:45,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 20:28:45,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:28:45,465 INFO L87 Difference]: Start difference. First operand 1157 states and 1441 transitions. Second operand 61 states. [2018-02-02 20:28:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:46,199 INFO L93 Difference]: Finished difference Result 1490 states and 1725 transitions. [2018-02-02 20:28:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 20:28:46,199 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 779 [2018-02-02 20:28:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:46,201 INFO L225 Difference]: With dead ends: 1490 [2018-02-02 20:28:46,201 INFO L226 Difference]: Without dead ends: 1490 [2018-02-02 20:28:46,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:28:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2018-02-02 20:28:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1176. [2018-02-02 20:28:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-02-02 20:28:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1465 transitions. [2018-02-02 20:28:46,214 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1465 transitions. Word has length 779 [2018-02-02 20:28:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:46,214 INFO L432 AbstractCegarLoop]: Abstraction has 1176 states and 1465 transitions. [2018-02-02 20:28:46,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 20:28:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1465 transitions. [2018-02-02 20:28:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2018-02-02 20:28:46,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:46,221 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:46,221 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1378458195, now seen corresponding path program 57 times [2018-02-02 20:28:46,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:46,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:28:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-02-02 20:28:48,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:28:48,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-02 20:28:48,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:28:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9408 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9408 trivial. 0 not checked. [2018-02-02 20:28:48,449 INFO L182 omatonBuilderFactory]: Interpolants [87181#false, 87180#true, 87183#(<= main_~i~1 1), 87182#(= main_~i~1 0), 87185#(<= main_~i~1 3), 87184#(<= main_~i~1 2), 87187#(<= main_~i~1 5), 87186#(<= main_~i~1 4), 87189#(<= main_~i~1 7), 87188#(<= main_~i~1 6), 87191#(<= main_~i~1 9), 87190#(<= main_~i~1 8), 87193#(<= main_~i~1 11), 87192#(<= main_~i~1 10), 87195#(<= main_~i~1 13), 87194#(<= main_~i~1 12), 87197#(<= main_~i~1 15), 87196#(<= main_~i~1 14), 87199#(<= main_~i~1 17), 87198#(<= main_~i~1 16), 87201#(<= main_~i~1 19), 87200#(<= main_~i~1 18), 87203#(<= main_~i~1 21), 87202#(<= main_~i~1 20), 87205#(<= main_~i~1 23), 87204#(<= main_~i~1 22), 87207#(<= main_~i~1 25), 87206#(<= main_~i~1 24), 87209#(<= main_~i~1 27), 87208#(<= main_~i~1 26), 87211#(<= main_~i~1 29), 87210#(<= main_~i~1 28), 87213#(<= main_~i~1 31), 87212#(<= main_~i~1 30), 87215#(<= main_~i~1 33), 87214#(<= main_~i~1 32), 87217#(<= main_~i~1 35), 87216#(<= main_~i~1 34), 87219#(<= main_~i~1 37), 87218#(<= main_~i~1 36), 87221#(<= main_~i~1 39), 87220#(<= main_~i~1 38), 87223#(<= main_~i~1 41), 87222#(<= main_~i~1 40), 87225#(<= main_~i~1 43), 87224#(<= main_~i~1 42), 87227#(<= main_~i~1 45), 87226#(<= main_~i~1 44), 87229#(<= main_~i~1 47), 87228#(<= main_~i~1 46), 87231#(<= main_~i~1 49), 87230#(<= main_~i~1 48), 87233#(<= main_~i~1 51), 87232#(<= main_~i~1 50), 87235#(<= main_~i~1 53), 87234#(<= main_~i~1 52), 87237#(<= main_~i~1 55), 87236#(<= main_~i~1 54), 87239#(<= main_~i~1 57), 87238#(<= main_~i~1 56), 87241#(<= main_~i~1 59), 87240#(<= main_~i~1 58)] [2018-02-02 20:28:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-02-02 20:28:48,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 20:28:48,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 20:28:48,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:28:48,450 INFO L87 Difference]: Start difference. First operand 1176 states and 1465 transitions. Second operand 62 states. [2018-02-02 20:28:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:28:49,502 INFO L93 Difference]: Finished difference Result 1514 states and 1753 transitions. [2018-02-02 20:28:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 20:28:49,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 792 [2018-02-02 20:28:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:28:49,504 INFO L225 Difference]: With dead ends: 1514 [2018-02-02 20:28:49,504 INFO L226 Difference]: Without dead ends: 1514 [2018-02-02 20:28:49,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:28:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-02-02 20:28:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1195. [2018-02-02 20:28:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-02-02 20:28:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1489 transitions. [2018-02-02 20:28:49,513 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1489 transitions. Word has length 792 [2018-02-02 20:28:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:28:49,514 INFO L432 AbstractCegarLoop]: Abstraction has 1195 states and 1489 transitions. [2018-02-02 20:28:49,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 20:28:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1489 transitions. [2018-02-02 20:28:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-02-02 20:28:49,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:28:49,518 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:28:49,518 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 20:28:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1118928292, now seen corresponding path program 58 times [2018-02-02 20:28:49,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:28:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:28:49,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:28:51,326 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:28:51,329 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:28:51,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:28:51 BoogieIcfgContainer [2018-02-02 20:28:51,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:28:51,329 INFO L168 Benchmark]: Toolchain (without parser) took 75856.56 ms. Allocated memory was 388.5 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 346.6 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 278.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:28:51,330 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 388.5 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:28:51,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.62 ms. Allocated memory is still 388.5 MB. Free memory was 346.6 MB in the beginning and 338.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:28:51,330 INFO L168 Benchmark]: Boogie Preprocessor took 27.07 ms. Allocated memory is still 388.5 MB. Free memory was 338.5 MB in the beginning and 337.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:28:51,331 INFO L168 Benchmark]: RCFGBuilder took 183.87 ms. Allocated memory is still 388.5 MB. Free memory was 337.2 MB in the beginning and 319.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:28:51,331 INFO L168 Benchmark]: TraceAbstraction took 75502.12 ms. Allocated memory was 388.5 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 319.2 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 251.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:28:51,332 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 388.5 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 140.62 ms. Allocated memory is still 388.5 MB. Free memory was 346.6 MB in the beginning and 338.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.07 ms. Allocated memory is still 388.5 MB. Free memory was 338.5 MB in the beginning and 337.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.87 ms. Allocated memory is still 388.5 MB. Free memory was 337.2 MB in the beginning and 319.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 75502.12 ms. Allocated memory was 388.5 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 319.2 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 251.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 806 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. TIMEOUT Result, 75.4s OverallTime, 72 OverallIterations, 61 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4265 SDtfs, 30960 SDslu, 39815 SDs, 0 SdLazy, 44090 SolverSat, 4571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2028 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 1886 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1195occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 208958/452051 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 71 MinimizatonAttempts, 10349 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 41.4s InterpolantComputationTime, 24805 NumberOfCodeBlocks, 24805 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 24734 ConstructedInterpolants, 0 QuantifiedInterpolants, 26503648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 8 PerfectInterpolantSequences, 208958/452051 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-28-51-337.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-28-51-337.csv Completed graceful shutdown