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/array-examples/sanfoundry_24_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:53:41,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:53:41,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:53:41,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:53:41,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:53:41,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:53:41,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:53:41,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:53:41,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:53:41,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:53:41,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:53:41,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:53:41,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:53:41,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:53:41,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:53:41,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:53:41,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:53:41,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:53:41,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:53:41,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:53:41,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:53:41,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:53:41,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:53:41,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:53:41,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:53:41,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:53:41,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:53:41,675 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:53:41,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:53:41,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:53:41,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:53:41,676 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:53:41,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:53:41,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:53:41,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:53:41,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:53:41,687 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:53:41,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:53:41,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:53:41,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:53:41,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:53:41,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:53:41,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:53:41,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:53:41,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:53:41,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:53:41,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:53:41,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:53:41,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:53:41,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:53:41,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:53:41,733 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:53:41,737 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:53:41,739 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:53:41,740 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:53:41,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i [2018-02-04 01:53:41,843 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:53:41,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:53:41,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:53:41,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:53:41,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:53:41,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:41,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b478ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41, skipping insertion in model container [2018-02-04 01:53:41,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:41,867 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:53:41,880 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:53:41,978 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:53:41,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:53:41,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41 WrapperNode [2018-02-04 01:53:41,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:53:41,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:53:41,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:53:41,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:53:42,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... [2018-02-04 01:53:42,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:53:42,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:53:42,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:53:42,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:53:42,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:53:42,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:53:42,053 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:53:42,053 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 01:53:42,053 INFO L136 BoogieDeclarations]: Found implementation of procedure printEven [2018-02-04 01:53:42,054 INFO L136 BoogieDeclarations]: Found implementation of procedure printOdd [2018-02-04 01:53:42,054 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure printEven [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure printOdd [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:53:42,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:53:42,168 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:53:42,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:42 BoogieIcfgContainer [2018-02-04 01:53:42,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:53:42,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:53:42,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:53:42,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:53:42,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:53:41" (1/3) ... [2018-02-04 01:53:42,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47924047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:42, skipping insertion in model container [2018-02-04 01:53:42,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:41" (2/3) ... [2018-02-04 01:53:42,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47924047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:42, skipping insertion in model container [2018-02-04 01:53:42,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:42" (3/3) ... [2018-02-04 01:53:42,173 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-02-04 01:53:42,179 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:53:42,184 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-02-04 01:53:42,215 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:53:42,216 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:53:42,216 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:53:42,216 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:53:42,216 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:53:42,216 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:53:42,216 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:53:42,216 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:53:42,217 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:53:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-02-04 01:53:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:53:42,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:42,235 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:42,235 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 529177341, now seen corresponding path program 1 times [2018-02-04 01:53:42,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:42,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:42,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:53:42,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,347 INFO L182 omatonBuilderFactory]: Interpolants [45#true, 46#false, 47#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-04 01:53:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:53:42,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:53:42,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:53:42,361 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-02-04 01:53:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:42,444 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-04 01:53:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:53:42,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 01:53:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:42,451 INFO L225 Difference]: With dead ends: 60 [2018-02-04 01:53:42,451 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 01:53:42,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:53:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 01:53:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 01:53:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:53:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-02-04 01:53:42,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-02-04 01:53:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:42,557 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-02-04 01:53:42,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:53:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-02-04 01:53:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:53:42,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:42,558 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:42,558 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2078569521, now seen corresponding path program 1 times [2018-02-04 01:53:42,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:42,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:42,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 01:53:42,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,602 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 157#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-04 01:53:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:53:42,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:53:42,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:53:42,604 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-02-04 01:53:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:42,678 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-02-04 01:53:42,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:53:42,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:53:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:42,684 INFO L225 Difference]: With dead ends: 66 [2018-02-04 01:53:42,684 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 01:53:42,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:53:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 01:53:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-04 01:53:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 01:53:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-04 01:53:42,692 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-02-04 01:53:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:42,693 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-04 01:53:42,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:53:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-04 01:53:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:53:42,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:42,694 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:42,694 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1794788925, now seen corresponding path program 2 times [2018-02-04 01:53:42,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:42,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:42,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 01:53:42,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,771 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 284#true, 285#false, 286#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 287#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-04 01:53:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:53:42,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:53:42,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:42,773 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-02-04 01:53:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:42,894 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-04 01:53:42,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:53:42,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 01:53:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:42,896 INFO L225 Difference]: With dead ends: 81 [2018-02-04 01:53:42,896 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 01:53:42,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 01:53:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-02-04 01:53:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 01:53:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 01:53:42,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-02-04 01:53:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:42,904 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 01:53:42,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:53:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 01:53:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:53:42,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:42,905 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:42,905 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:42,905 INFO L82 PathProgramCache]: Analyzing trace with hash -424025969, now seen corresponding path program 3 times [2018-02-04 01:53:42,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:42,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:42,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 01:53:42,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,968 INFO L182 omatonBuilderFactory]: Interpolants [448#(<= main_~i~0 2), 449#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 450#(and (<= main_~i~0 3) (<= 1 main_~i~0)), 444#true, 445#false, 446#(<= main_~i~0 0), 447#(<= main_~i~0 1)] [2018-02-04 01:53:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:42,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:53:42,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:53:42,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:53:42,969 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 7 states. [2018-02-04 01:53:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:43,140 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-02-04 01:53:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:53:43,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:53:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:43,141 INFO L225 Difference]: With dead ends: 96 [2018-02-04 01:53:43,141 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 01:53:43,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:53:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 01:53:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-04 01:53:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 01:53:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-02-04 01:53:43,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-02-04 01:53:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:43,150 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-02-04 01:53:43,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:53:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-02-04 01:53:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:53:43,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:43,151 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:43,151 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1714228867, now seen corresponding path program 4 times [2018-02-04 01:53:43,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:43,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:43,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 01:53:43,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,265 INFO L182 omatonBuilderFactory]: Interpolants [641#true, 642#false, 643#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 644#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 645#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 646#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 647#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-02-04 01:53:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:53:43,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:53:43,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:53:43,269 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 7 states. [2018-02-04 01:53:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:43,494 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-02-04 01:53:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:53:43,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 01:53:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:43,495 INFO L225 Difference]: With dead ends: 111 [2018-02-04 01:53:43,495 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 01:53:43,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:53:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 01:53:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-02-04 01:53:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 01:53:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-02-04 01:53:43,500 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-02-04 01:53:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:43,500 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-02-04 01:53:43,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:53:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-02-04 01:53:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:53:43,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:43,501 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:43,501 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash -771406513, now seen corresponding path program 5 times [2018-02-04 01:53:43,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:43,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:43,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 01:53:43,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,590 INFO L182 omatonBuilderFactory]: Interpolants [864#(<= main_~i~0 1), 865#(<= main_~i~0 2), 866#(<= main_~i~0 3), 867#(<= main_~i~0 4), 868#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 869#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 861#true, 862#false, 863#(<= main_~i~0 0)] [2018-02-04 01:53:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:53:43,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:53:43,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:53:43,591 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 9 states. [2018-02-04 01:53:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:43,803 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-02-04 01:53:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:53:43,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 01:53:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:43,805 INFO L225 Difference]: With dead ends: 126 [2018-02-04 01:53:43,805 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 01:53:43,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:53:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 01:53:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-04 01:53:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 01:53:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-02-04 01:53:43,813 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-02-04 01:53:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:43,813 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-02-04 01:53:43,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:53:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-02-04 01:53:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:53:43,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:43,815 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:43,815 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -240614211, now seen corresponding path program 6 times [2018-02-04 01:53:43,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:43,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:43,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:53:43,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,912 INFO L182 omatonBuilderFactory]: Interpolants [1122#true, 1123#false, 1124#(<= main_~i~0 0), 1125#(<= main_~i~0 1), 1126#(<= main_~i~0 2), 1127#(<= main_~i~0 3), 1128#(<= main_~i~0 4), 1129#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1130#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1131#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-02-04 01:53:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:43,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:53:43,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:53:43,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:53:43,913 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 10 states. [2018-02-04 01:53:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:44,085 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-02-04 01:53:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:53:44,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 01:53:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:44,086 INFO L225 Difference]: With dead ends: 141 [2018-02-04 01:53:44,086 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 01:53:44,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:53:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 01:53:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-04 01:53:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 01:53:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-02-04 01:53:44,091 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-02-04 01:53:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:44,091 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-02-04 01:53:44,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:53:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-02-04 01:53:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:53:44,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:44,092 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:44,092 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1558821391, now seen corresponding path program 7 times [2018-02-04 01:53:44,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:44,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:44,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:53:44,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,162 INFO L182 omatonBuilderFactory]: Interpolants [1424#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1425#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1415#true, 1416#false, 1417#(<= main_~i~0 0), 1418#(<= main_~i~0 1), 1419#(<= main_~i~0 2), 1420#(<= main_~i~0 3), 1421#(<= main_~i~0 4), 1422#(<= main_~i~0 5), 1423#(<= main_~i~0 6)] [2018-02-04 01:53:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:53:44,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:53:44,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:53:44,163 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-02-04 01:53:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:44,362 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-02-04 01:53:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:53:44,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-04 01:53:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:44,363 INFO L225 Difference]: With dead ends: 156 [2018-02-04 01:53:44,363 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 01:53:44,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:53:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 01:53:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-04 01:53:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 01:53:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-02-04 01:53:44,370 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-02-04 01:53:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:44,371 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-02-04 01:53:44,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:53:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-02-04 01:53:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:53:44,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:44,376 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:44,376 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -821098499, now seen corresponding path program 8 times [2018-02-04 01:53:44,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:44,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:44,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:53:44,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,546 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1745#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1746#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1747#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1748#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1749#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1750#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 1740#true, 1741#false, 1742#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1743#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-04 01:53:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:44,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:53:44,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:53:44,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:53:44,546 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-02-04 01:53:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:45,226 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-02-04 01:53:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:53:45,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 01:53:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:45,229 INFO L225 Difference]: With dead ends: 171 [2018-02-04 01:53:45,229 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 01:53:45,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:53:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 01:53:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-04 01:53:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 01:53:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-02-04 01:53:45,244 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-02-04 01:53:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:45,245 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-02-04 01:53:45,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:53:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-02-04 01:53:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 01:53:45,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:45,246 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:45,247 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash -413974833, now seen corresponding path program 9 times [2018-02-04 01:53:45,248 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:45,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:45,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:53:45,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,383 INFO L182 omatonBuilderFactory]: Interpolants [2080#true, 2081#false, 2082#(<= main_~i~0 0), 2083#(<= main_~i~0 1), 2084#(<= main_~i~0 2), 2085#(<= main_~i~0 3), 2086#(<= main_~i~0 4), 2087#(<= main_~i~0 5), 2088#(<= main_~i~0 6), 2089#(<= main_~i~0 7), 2090#(<= main_~i~0 8), 2091#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2092#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-02-04 01:53:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:53:45,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:53:45,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:53:45,384 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-02-04 01:53:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:45,622 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-02-04 01:53:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:53:45,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-04 01:53:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:45,623 INFO L225 Difference]: With dead ends: 186 [2018-02-04 01:53:45,624 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 01:53:45,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:53:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 01:53:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-02-04 01:53:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 01:53:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-02-04 01:53:45,630 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-02-04 01:53:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:45,630 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-02-04 01:53:45,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:53:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-02-04 01:53:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 01:53:45,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:45,631 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:45,631 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -442860739, now seen corresponding path program 10 times [2018-02-04 01:53:45,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:45,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:45,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:53:45,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,723 INFO L182 omatonBuilderFactory]: Interpolants [2469#true, 2470#false, 2471#(<= main_~i~0 0), 2472#(<= main_~i~0 1), 2473#(<= main_~i~0 2), 2474#(<= main_~i~0 3), 2475#(<= main_~i~0 4), 2476#(<= main_~i~0 5), 2477#(<= main_~i~0 6), 2478#(<= main_~i~0 7), 2479#(<= main_~i~0 8), 2480#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2481#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2482#(and (<= 2 main_~i~0) (<= main_~i~0 10))] [2018-02-04 01:53:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:45,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:53:45,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:53:45,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:53:45,724 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 14 states. [2018-02-04 01:53:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:45,989 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-02-04 01:53:46,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:53:46,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 01:53:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:46,086 INFO L225 Difference]: With dead ends: 201 [2018-02-04 01:53:46,087 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 01:53:46,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:53:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 01:53:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-02-04 01:53:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 01:53:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-02-04 01:53:46,091 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-02-04 01:53:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:46,091 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-02-04 01:53:46,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:53:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-02-04 01:53:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 01:53:46,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:46,092 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:46,092 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash -634530929, now seen corresponding path program 11 times [2018-02-04 01:53:46,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:46,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:46,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:53:46,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,184 INFO L182 omatonBuilderFactory]: Interpolants [2890#true, 2891#false, 2892#(<= main_~i~0 0), 2893#(<= main_~i~0 1), 2894#(<= main_~i~0 2), 2895#(<= main_~i~0 3), 2896#(<= main_~i~0 4), 2897#(<= main_~i~0 5), 2898#(<= main_~i~0 6), 2899#(<= main_~i~0 7), 2900#(<= main_~i~0 8), 2901#(<= main_~i~0 9), 2902#(<= main_~i~0 10), 2903#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2904#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-02-04 01:53:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:53:46,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:53:46,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:53:46,184 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 15 states. [2018-02-04 01:53:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:46,430 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-02-04 01:53:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:53:46,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-04 01:53:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:46,431 INFO L225 Difference]: With dead ends: 216 [2018-02-04 01:53:46,431 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 01:53:46,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:53:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 01:53:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-02-04 01:53:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 01:53:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-02-04 01:53:46,435 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-02-04 01:53:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:46,435 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-02-04 01:53:46,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:53:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-02-04 01:53:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 01:53:46,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:46,437 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:46,437 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2145312381, now seen corresponding path program 12 times [2018-02-04 01:53:46,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:46,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:46,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:53:46,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,568 INFO L182 omatonBuilderFactory]: Interpolants [3343#true, 3344#false, 3345#(<= main_~i~0 0), 3346#(<= main_~i~0 1), 3347#(<= main_~i~0 2), 3348#(<= main_~i~0 3), 3349#(<= main_~i~0 4), 3350#(<= main_~i~0 5), 3351#(<= main_~i~0 6), 3352#(<= main_~i~0 7), 3353#(<= main_~i~0 8), 3354#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 3355#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 3356#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 3357#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 3358#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-02-04 01:53:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:46,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:53:46,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:53:46,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:53:46,569 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 16 states. [2018-02-04 01:53:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:46,953 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-02-04 01:53:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:53:46,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-02-04 01:53:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:46,955 INFO L225 Difference]: With dead ends: 231 [2018-02-04 01:53:46,955 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 01:53:46,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:53:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 01:53:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-04 01:53:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 01:53:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-02-04 01:53:46,961 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-02-04 01:53:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:46,961 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-02-04 01:53:46,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:53:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-02-04 01:53:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 01:53:46,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:46,962 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:46,963 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1734703183, now seen corresponding path program 13 times [2018-02-04 01:53:46,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:46,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:47,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:53:47,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,067 INFO L182 omatonBuilderFactory]: Interpolants [3840#(<= main_~i~0 10), 3841#(<= main_~i~0 11), 3842#(<= main_~i~0 12), 3843#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3844#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3828#true, 3829#false, 3830#(<= main_~i~0 0), 3831#(<= main_~i~0 1), 3832#(<= main_~i~0 2), 3833#(<= main_~i~0 3), 3834#(<= main_~i~0 4), 3835#(<= main_~i~0 5), 3836#(<= main_~i~0 6), 3837#(<= main_~i~0 7), 3838#(<= main_~i~0 8), 3839#(<= main_~i~0 9)] [2018-02-04 01:53:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:53:47,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:53:47,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:53:47,068 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-02-04 01:53:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:47,438 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-02-04 01:53:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:53:47,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-04 01:53:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:47,439 INFO L225 Difference]: With dead ends: 246 [2018-02-04 01:53:47,439 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 01:53:47,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:53:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 01:53:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-02-04 01:53:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 01:53:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-02-04 01:53:47,443 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-02-04 01:53:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:47,443 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-02-04 01:53:47,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:53:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-02-04 01:53:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 01:53:47,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:47,444 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:47,444 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1083166275, now seen corresponding path program 14 times [2018-02-04 01:53:47,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:47,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:47,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:53:47,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,559 INFO L182 omatonBuilderFactory]: Interpolants [4352#(<= main_~i~0 5), 4353#(<= main_~i~0 6), 4354#(<= main_~i~0 7), 4355#(<= main_~i~0 8), 4356#(<= main_~i~0 9), 4357#(<= main_~i~0 10), 4358#(<= main_~i~0 11), 4359#(<= main_~i~0 12), 4360#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 4361#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 4362#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 4345#true, 4346#false, 4347#(<= main_~i~0 0), 4348#(<= main_~i~0 1), 4349#(<= main_~i~0 2), 4350#(<= main_~i~0 3), 4351#(<= main_~i~0 4)] [2018-02-04 01:53:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:47,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:53:47,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:53:47,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:53:47,560 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 18 states. [2018-02-04 01:53:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:48,043 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-02-04 01:53:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:53:48,043 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-04 01:53:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:48,044 INFO L225 Difference]: With dead ends: 261 [2018-02-04 01:53:48,044 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 01:53:48,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:53:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 01:53:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-04 01:53:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 01:53:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-04 01:53:48,049 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-02-04 01:53:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:48,049 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-04 01:53:48,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:53:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-04 01:53:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 01:53:48,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:48,050 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:48,050 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1239821583, now seen corresponding path program 15 times [2018-02-04 01:53:48,051 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:48,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:48,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:53:48,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,188 INFO L182 omatonBuilderFactory]: Interpolants [4896#(<= main_~i~0 0), 4897#(<= main_~i~0 1), 4898#(<= main_~i~0 2), 4899#(<= main_~i~0 3), 4900#(<= main_~i~0 4), 4901#(<= main_~i~0 5), 4902#(<= main_~i~0 6), 4903#(<= main_~i~0 7), 4904#(<= main_~i~0 8), 4905#(<= main_~i~0 9), 4906#(<= main_~i~0 10), 4907#(<= main_~i~0 11), 4908#(<= main_~i~0 12), 4909#(<= main_~i~0 13), 4910#(<= main_~i~0 14), 4911#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4912#(and (<= 1 main_~i~0) (<= main_~i~0 15)), 4894#true, 4895#false] [2018-02-04 01:53:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:53:48,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:53:48,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:53:48,189 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 19 states. [2018-02-04 01:53:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:48,621 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-02-04 01:53:48,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:53:48,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-02-04 01:53:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:48,622 INFO L225 Difference]: With dead ends: 276 [2018-02-04 01:53:48,622 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 01:53:48,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 01:53:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 01:53:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-02-04 01:53:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 01:53:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-02-04 01:53:48,629 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-02-04 01:53:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:48,629 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-02-04 01:53:48,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:53:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-02-04 01:53:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 01:53:48,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:48,631 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:48,631 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -589138691, now seen corresponding path program 16 times [2018-02-04 01:53:48,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:48,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:48,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:53:48,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,852 INFO L182 omatonBuilderFactory]: Interpolants [5475#true, 5476#false, 5477#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 5478#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 5479#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 5480#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 5481#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 5482#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 5483#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 5484#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 5485#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 5486#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 5487#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 5488#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 5489#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 5490#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 5491#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 5492#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 5493#(and (<= main_~i~0 16) (<= 16 main_~i~0))] [2018-02-04 01:53:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:48,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:53:48,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:53:48,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:53:48,853 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 19 states. [2018-02-04 01:53:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:50,178 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-02-04 01:53:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:53:50,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-02-04 01:53:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:50,179 INFO L225 Difference]: With dead ends: 291 [2018-02-04 01:53:50,179 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 01:53:50,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:53:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 01:53:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-02-04 01:53:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 01:53:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-02-04 01:53:50,185 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-02-04 01:53:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:50,185 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-02-04 01:53:50,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:53:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-02-04 01:53:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 01:53:50,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:50,187 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:50,187 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2053377585, now seen corresponding path program 17 times [2018-02-04 01:53:50,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:50,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:50,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 01:53:50,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,355 INFO L182 omatonBuilderFactory]: Interpolants [6055#true, 6056#false, 6057#(<= main_~i~0 0), 6058#(<= main_~i~0 1), 6059#(<= main_~i~0 2), 6060#(<= main_~i~0 3), 6061#(<= main_~i~0 4), 6062#(<= main_~i~0 5), 6063#(<= main_~i~0 6), 6064#(<= main_~i~0 7), 6065#(<= main_~i~0 8), 6066#(<= main_~i~0 9), 6067#(<= main_~i~0 10), 6068#(<= main_~i~0 11), 6069#(<= main_~i~0 12), 6070#(<= main_~i~0 13), 6071#(<= main_~i~0 14), 6072#(<= main_~i~0 15), 6073#(<= main_~i~0 16), 6074#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6075#(and (<= main_~i~0 17) (<= 1 main_~i~0))] [2018-02-04 01:53:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 01:53:50,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 01:53:50,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:53:50,356 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 21 states. [2018-02-04 01:53:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:50,798 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-02-04 01:53:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 01:53:50,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-02-04 01:53:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:50,799 INFO L225 Difference]: With dead ends: 306 [2018-02-04 01:53:50,800 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 01:53:50,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 01:53:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 01:53:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-02-04 01:53:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 01:53:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-02-04 01:53:50,805 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-02-04 01:53:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:50,805 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-02-04 01:53:50,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 01:53:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-02-04 01:53:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 01:53:50,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:50,806 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:50,806 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1741269053, now seen corresponding path program 18 times [2018-02-04 01:53:50,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:50,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:50,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 01:53:50,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,960 INFO L182 omatonBuilderFactory]: Interpolants [6720#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6721#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6700#true, 6701#false, 6702#(<= main_~i~0 0), 6703#(<= main_~i~0 1), 6704#(<= main_~i~0 2), 6705#(<= main_~i~0 3), 6706#(<= main_~i~0 4), 6707#(<= main_~i~0 5), 6708#(<= main_~i~0 6), 6709#(<= main_~i~0 7), 6710#(<= main_~i~0 8), 6711#(<= main_~i~0 9), 6712#(<= main_~i~0 10), 6713#(<= main_~i~0 11), 6714#(<= main_~i~0 12), 6715#(<= main_~i~0 13), 6716#(<= main_~i~0 14), 6717#(<= main_~i~0 15), 6718#(<= main_~i~0 16), 6719#(and (<= 0 main_~i~0) (<= main_~i~0 16))] [2018-02-04 01:53:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:50,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 01:53:50,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 01:53:50,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:53:50,962 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 22 states. [2018-02-04 01:53:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:51,650 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-02-04 01:53:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 01:53:51,650 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-02-04 01:53:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:51,652 INFO L225 Difference]: With dead ends: 321 [2018-02-04 01:53:51,652 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 01:53:51,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 01:53:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 01:53:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-02-04 01:53:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 01:53:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-02-04 01:53:51,663 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-02-04 01:53:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:51,663 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-02-04 01:53:51,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 01:53:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-02-04 01:53:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 01:53:51,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:51,665 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:51,665 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 661833359, now seen corresponding path program 19 times [2018-02-04 01:53:51,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:51,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:51,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:51,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 01:53:51,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:51,955 INFO L182 omatonBuilderFactory]: Interpolants [7392#(<= main_~i~0 13), 7393#(<= main_~i~0 14), 7394#(<= main_~i~0 15), 7395#(<= main_~i~0 16), 7396#(<= main_~i~0 17), 7397#(<= main_~i~0 18), 7398#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 7399#(and (<= 1 main_~i~0) (<= main_~i~0 19)), 7377#true, 7378#false, 7379#(<= main_~i~0 0), 7380#(<= main_~i~0 1), 7381#(<= main_~i~0 2), 7382#(<= main_~i~0 3), 7383#(<= main_~i~0 4), 7384#(<= main_~i~0 5), 7385#(<= main_~i~0 6), 7386#(<= main_~i~0 7), 7387#(<= main_~i~0 8), 7388#(<= main_~i~0 9), 7389#(<= main_~i~0 10), 7390#(<= main_~i~0 11), 7391#(<= main_~i~0 12)] [2018-02-04 01:53:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:51,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 01:53:51,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 01:53:51,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:53:51,956 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-02-04 01:53:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:52,437 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-02-04 01:53:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 01:53:52,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-02-04 01:53:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:52,438 INFO L225 Difference]: With dead ends: 336 [2018-02-04 01:53:52,438 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 01:53:52,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 01:53:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 01:53:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-02-04 01:53:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 01:53:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-02-04 01:53:52,443 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-02-04 01:53:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:52,443 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-02-04 01:53:52,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 01:53:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-02-04 01:53:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 01:53:52,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:52,444 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:52,444 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2034644099, now seen corresponding path program 20 times [2018-02-04 01:53:52,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:52,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:52,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:52,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 01:53:52,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:52,609 INFO L182 omatonBuilderFactory]: Interpolants [8096#(<= main_~i~0 8), 8097#(<= main_~i~0 9), 8098#(<= main_~i~0 10), 8099#(<= main_~i~0 11), 8100#(<= main_~i~0 12), 8101#(<= main_~i~0 13), 8102#(<= main_~i~0 14), 8103#(<= main_~i~0 15), 8104#(<= main_~i~0 16), 8105#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 8106#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 8107#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 8108#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 8109#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 8086#true, 8087#false, 8088#(<= main_~i~0 0), 8089#(<= main_~i~0 1), 8090#(<= main_~i~0 2), 8091#(<= main_~i~0 3), 8092#(<= main_~i~0 4), 8093#(<= main_~i~0 5), 8094#(<= main_~i~0 6), 8095#(<= main_~i~0 7)] [2018-02-04 01:53:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:52,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 01:53:52,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 01:53:52,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:53:52,610 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 24 states. [2018-02-04 01:53:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:53,406 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-02-04 01:53:53,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 01:53:53,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-02-04 01:53:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:53,407 INFO L225 Difference]: With dead ends: 351 [2018-02-04 01:53:53,408 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 01:53:53,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 01:53:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 01:53:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-02-04 01:53:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 01:53:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-02-04 01:53:53,414 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-02-04 01:53:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:53,415 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-02-04 01:53:53,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 01:53:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-02-04 01:53:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 01:53:53,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:53,416 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:53,416 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 89566031, now seen corresponding path program 21 times [2018-02-04 01:53:53,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:53,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:53,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:53,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 01:53:53,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:53,628 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~0 3), 8833#(<= main_~i~0 4), 8834#(<= main_~i~0 5), 8835#(<= main_~i~0 6), 8836#(<= main_~i~0 7), 8837#(<= main_~i~0 8), 8838#(<= main_~i~0 9), 8839#(<= main_~i~0 10), 8840#(<= main_~i~0 11), 8841#(<= main_~i~0 12), 8842#(<= main_~i~0 13), 8843#(<= main_~i~0 14), 8844#(<= main_~i~0 15), 8845#(<= main_~i~0 16), 8846#(<= main_~i~0 17), 8847#(<= main_~i~0 18), 8848#(<= main_~i~0 19), 8849#(<= main_~i~0 20), 8850#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8851#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8827#true, 8828#false, 8829#(<= main_~i~0 0), 8830#(<= main_~i~0 1), 8831#(<= main_~i~0 2)] [2018-02-04 01:53:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:53,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 01:53:53,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 01:53:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:53:53,629 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 25 states. [2018-02-04 01:53:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:54,541 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-02-04 01:53:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:53:54,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-02-04 01:53:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:54,542 INFO L225 Difference]: With dead ends: 366 [2018-02-04 01:53:54,542 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 01:53:54,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:53:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 01:53:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-04 01:53:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 01:53:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-02-04 01:53:54,549 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-02-04 01:53:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:54,550 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-02-04 01:53:54,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 01:53:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-02-04 01:53:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 01:53:54,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:54,551 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:54,551 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash 927391421, now seen corresponding path program 22 times [2018-02-04 01:53:54,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:54,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:54,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:54,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 01:53:54,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:54,808 INFO L182 omatonBuilderFactory]: Interpolants [9600#true, 9601#false, 9602#(<= main_~i~0 0), 9603#(<= main_~i~0 1), 9604#(<= main_~i~0 2), 9605#(<= main_~i~0 3), 9606#(<= main_~i~0 4), 9607#(<= main_~i~0 5), 9608#(<= main_~i~0 6), 9609#(<= main_~i~0 7), 9610#(<= main_~i~0 8), 9611#(<= main_~i~0 9), 9612#(<= main_~i~0 10), 9613#(<= main_~i~0 11), 9614#(<= main_~i~0 12), 9615#(<= main_~i~0 13), 9616#(<= main_~i~0 14), 9617#(<= main_~i~0 15), 9618#(<= main_~i~0 16), 9619#(<= main_~i~0 17), 9620#(<= main_~i~0 18), 9621#(<= main_~i~0 19), 9622#(<= main_~i~0 20), 9623#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 9624#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 9625#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-02-04 01:53:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:54,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 01:53:54,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 01:53:54,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:53:54,810 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 26 states. [2018-02-04 01:53:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:55,556 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-02-04 01:53:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 01:53:55,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-02-04 01:53:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:55,558 INFO L225 Difference]: With dead ends: 381 [2018-02-04 01:53:55,558 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 01:53:55,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 01:53:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 01:53:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-02-04 01:53:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 01:53:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-04 01:53:55,563 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-02-04 01:53:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:55,563 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-04 01:53:55,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 01:53:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-04 01:53:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 01:53:55,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:55,564 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:55,564 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2117312527, now seen corresponding path program 23 times [2018-02-04 01:53:55,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:55,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:55,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:55,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 01:53:55,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:55,833 INFO L182 omatonBuilderFactory]: Interpolants [10405#true, 10406#false, 10407#(<= main_~i~0 0), 10408#(<= main_~i~0 1), 10409#(<= main_~i~0 2), 10410#(<= main_~i~0 3), 10411#(<= main_~i~0 4), 10412#(<= main_~i~0 5), 10413#(<= main_~i~0 6), 10414#(<= main_~i~0 7), 10415#(<= main_~i~0 8), 10416#(<= main_~i~0 9), 10417#(<= main_~i~0 10), 10418#(<= main_~i~0 11), 10419#(<= main_~i~0 12), 10420#(<= main_~i~0 13), 10421#(<= main_~i~0 14), 10422#(<= main_~i~0 15), 10423#(<= main_~i~0 16), 10424#(<= main_~i~0 17), 10425#(<= main_~i~0 18), 10426#(<= main_~i~0 19), 10427#(<= main_~i~0 20), 10428#(<= main_~i~0 21), 10429#(<= main_~i~0 22), 10430#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 10431#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-02-04 01:53:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:55,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:53:55,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:53:55,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:53:55,834 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 27 states. [2018-02-04 01:53:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:56,449 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-02-04 01:53:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:53:56,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-04 01:53:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:56,450 INFO L225 Difference]: With dead ends: 396 [2018-02-04 01:53:56,450 INFO L226 Difference]: Without dead ends: 396 [2018-02-04 01:53:56,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 01:53:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-04 01:53:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-02-04 01:53:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 01:53:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-02-04 01:53:56,454 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-02-04 01:53:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:56,455 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-02-04 01:53:56,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:53:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-02-04 01:53:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 01:53:56,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:56,456 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:56,456 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1912282627, now seen corresponding path program 24 times [2018-02-04 01:53:56,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:56,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:56,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:56,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 01:53:56,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:56,756 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 11265#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 11266#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 11267#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 11268#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 11269#(and (<= 8 main_~i~0) (<= main_~i~0 24)), 11242#true, 11243#false, 11244#(<= main_~i~0 0), 11245#(<= main_~i~0 1), 11246#(<= main_~i~0 2), 11247#(<= main_~i~0 3), 11248#(<= main_~i~0 4), 11249#(<= main_~i~0 5), 11250#(<= main_~i~0 6), 11251#(<= main_~i~0 7), 11252#(<= main_~i~0 8), 11253#(<= main_~i~0 9), 11254#(<= main_~i~0 10), 11255#(<= main_~i~0 11), 11256#(<= main_~i~0 12), 11257#(<= main_~i~0 13), 11258#(<= main_~i~0 14), 11259#(<= main_~i~0 15), 11260#(<= main_~i~0 16), 11261#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 11262#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 11263#(and (<= 2 main_~i~0) (<= main_~i~0 18))] [2018-02-04 01:53:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:56,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 01:53:56,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 01:53:56,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:53:56,760 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 28 states. [2018-02-04 01:53:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:57,877 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-02-04 01:53:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 01:53:57,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 128 [2018-02-04 01:53:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:57,878 INFO L225 Difference]: With dead ends: 411 [2018-02-04 01:53:57,878 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 01:53:57,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 01:53:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 01:53:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-02-04 01:53:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 01:53:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-02-04 01:53:57,882 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-02-04 01:53:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:57,882 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-02-04 01:53:57,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 01:53:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-02-04 01:53:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 01:53:57,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:57,883 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:57,884 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 972399823, now seen corresponding path program 25 times [2018-02-04 01:53:57,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:57,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:58,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:58,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 01:53:58,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:58,147 INFO L182 omatonBuilderFactory]: Interpolants [12111#true, 12112#false, 12113#(<= main_~i~0 0), 12114#(<= main_~i~0 1), 12115#(<= main_~i~0 2), 12116#(<= main_~i~0 3), 12117#(<= main_~i~0 4), 12118#(<= main_~i~0 5), 12119#(<= main_~i~0 6), 12120#(<= main_~i~0 7), 12121#(<= main_~i~0 8), 12122#(<= main_~i~0 9), 12123#(<= main_~i~0 10), 12124#(<= main_~i~0 11), 12125#(<= main_~i~0 12), 12126#(<= main_~i~0 13), 12127#(<= main_~i~0 14), 12128#(<= main_~i~0 15), 12129#(<= main_~i~0 16), 12130#(<= main_~i~0 17), 12131#(<= main_~i~0 18), 12132#(<= main_~i~0 19), 12133#(<= main_~i~0 20), 12134#(<= main_~i~0 21), 12135#(<= main_~i~0 22), 12136#(<= main_~i~0 23), 12137#(<= main_~i~0 24), 12138#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12139#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-02-04 01:53:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:58,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 01:53:58,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 01:53:58,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 01:53:58,148 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-02-04 01:53:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:58,835 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-02-04 01:53:58,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:53:58,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-04 01:53:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:58,837 INFO L225 Difference]: With dead ends: 426 [2018-02-04 01:53:58,837 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 01:53:58,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 01:53:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 01:53:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-02-04 01:53:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 01:53:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-02-04 01:53:58,844 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-02-04 01:53:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:58,844 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-02-04 01:53:58,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 01:53:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-02-04 01:53:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-02-04 01:53:58,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:58,846 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:58,846 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:53:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash -158870211, now seen corresponding path program 26 times [2018-02-04 01:53:58,847 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:58,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:59,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:59,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 01:53:59,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:59,125 INFO L182 omatonBuilderFactory]: Interpolants [13012#true, 13013#false, 13014#(<= main_~i~0 0), 13015#(<= main_~i~0 1), 13016#(<= main_~i~0 2), 13017#(<= main_~i~0 3), 13018#(<= main_~i~0 4), 13019#(<= main_~i~0 5), 13020#(<= main_~i~0 6), 13021#(<= main_~i~0 7), 13022#(<= main_~i~0 8), 13023#(<= main_~i~0 9), 13024#(<= main_~i~0 10), 13025#(<= main_~i~0 11), 13026#(<= main_~i~0 12), 13027#(<= main_~i~0 13), 13028#(<= main_~i~0 14), 13029#(<= main_~i~0 15), 13030#(<= main_~i~0 16), 13031#(<= main_~i~0 17), 13032#(<= main_~i~0 18), 13033#(<= main_~i~0 19), 13034#(<= main_~i~0 20), 13035#(<= main_~i~0 21), 13036#(<= main_~i~0 22), 13037#(<= main_~i~0 23), 13038#(<= main_~i~0 24), 13039#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 13040#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 13041#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-02-04 01:53:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:59,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:53:59,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:53:59,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:53:59,127 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 30 states. [2018-02-04 01:54:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:00,040 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-02-04 01:54:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 01:54:00,040 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 138 [2018-02-04 01:54:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:00,042 INFO L225 Difference]: With dead ends: 441 [2018-02-04 01:54:00,042 INFO L226 Difference]: Without dead ends: 441 [2018-02-04 01:54:00,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 01:54:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-04 01:54:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-02-04 01:54:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 01:54:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-02-04 01:54:00,049 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-02-04 01:54:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:00,050 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-02-04 01:54:00,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:54:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-02-04 01:54:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 01:54:00,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:00,052 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:00,052 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -376915569, now seen corresponding path program 27 times [2018-02-04 01:54:00,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:00,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:00,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:00,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 01:54:00,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:00,357 INFO L182 omatonBuilderFactory]: Interpolants [13952#(<= main_~i~0 5), 13953#(<= main_~i~0 6), 13954#(<= main_~i~0 7), 13955#(<= main_~i~0 8), 13956#(<= main_~i~0 9), 13957#(<= main_~i~0 10), 13958#(<= main_~i~0 11), 13959#(<= main_~i~0 12), 13960#(<= main_~i~0 13), 13961#(<= main_~i~0 14), 13962#(<= main_~i~0 15), 13963#(<= main_~i~0 16), 13964#(<= main_~i~0 17), 13965#(<= main_~i~0 18), 13966#(<= main_~i~0 19), 13967#(<= main_~i~0 20), 13968#(<= main_~i~0 21), 13969#(<= main_~i~0 22), 13970#(<= main_~i~0 23), 13971#(<= main_~i~0 24), 13972#(<= main_~i~0 25), 13973#(<= main_~i~0 26), 13974#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 13975#(and (<= 1 main_~i~0) (<= main_~i~0 27)), 13945#true, 13946#false, 13947#(<= main_~i~0 0), 13948#(<= main_~i~0 1), 13949#(<= main_~i~0 2), 13950#(<= main_~i~0 3), 13951#(<= main_~i~0 4)] [2018-02-04 01:54:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:00,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 01:54:00,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 01:54:00,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 01:54:00,359 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 31 states. [2018-02-04 01:54:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:01,078 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-02-04 01:54:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 01:54:01,078 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-02-04 01:54:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:01,079 INFO L225 Difference]: With dead ends: 456 [2018-02-04 01:54:01,079 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 01:54:01,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:54:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 01:54:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-02-04 01:54:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 01:54:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-02-04 01:54:01,085 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-02-04 01:54:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:01,085 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-02-04 01:54:01,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 01:54:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-02-04 01:54:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 01:54:01,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:01,087 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:01,087 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1935915133, now seen corresponding path program 28 times [2018-02-04 01:54:01,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:01,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:01,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:01,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 01:54:01,443 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:01,443 INFO L182 omatonBuilderFactory]: Interpolants [14912#(<= main_~i~0 0), 14913#(<= main_~i~0 1), 14914#(<= main_~i~0 2), 14915#(<= main_~i~0 3), 14916#(<= main_~i~0 4), 14917#(<= main_~i~0 5), 14918#(<= main_~i~0 6), 14919#(<= main_~i~0 7), 14920#(<= main_~i~0 8), 14921#(<= main_~i~0 9), 14922#(<= main_~i~0 10), 14923#(<= main_~i~0 11), 14924#(<= main_~i~0 12), 14925#(<= main_~i~0 13), 14926#(<= main_~i~0 14), 14927#(<= main_~i~0 15), 14928#(<= main_~i~0 16), 14929#(<= main_~i~0 17), 14930#(<= main_~i~0 18), 14931#(<= main_~i~0 19), 14932#(<= main_~i~0 20), 14933#(<= main_~i~0 21), 14934#(<= main_~i~0 22), 14935#(<= main_~i~0 23), 14936#(<= main_~i~0 24), 14937#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 14938#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 14939#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 14940#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 14941#(and (<= 4 main_~i~0) (<= main_~i~0 28)), 14910#true, 14911#false] [2018-02-04 01:54:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:01,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:54:01,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:54:01,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:54:01,444 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 32 states. [2018-02-04 01:54:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:02,553 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-02-04 01:54:02,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 01:54:02,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2018-02-04 01:54:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:02,555 INFO L225 Difference]: With dead ends: 471 [2018-02-04 01:54:02,555 INFO L226 Difference]: Without dead ends: 471 [2018-02-04 01:54:02,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 01:54:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-02-04 01:54:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-02-04 01:54:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 01:54:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-02-04 01:54:02,559 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-02-04 01:54:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:02,560 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-02-04 01:54:02,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:54:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-02-04 01:54:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 01:54:02,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:02,561 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:02,561 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 114875983, now seen corresponding path program 29 times [2018-02-04 01:54:02,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:02,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:02,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:02,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 01:54:02,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:02,902 INFO L182 omatonBuilderFactory]: Interpolants [15936#(<= main_~i~0 27), 15937#(<= main_~i~0 28), 15938#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 15939#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 15907#true, 15908#false, 15909#(<= main_~i~0 0), 15910#(<= main_~i~0 1), 15911#(<= main_~i~0 2), 15912#(<= main_~i~0 3), 15913#(<= main_~i~0 4), 15914#(<= main_~i~0 5), 15915#(<= main_~i~0 6), 15916#(<= main_~i~0 7), 15917#(<= main_~i~0 8), 15918#(<= main_~i~0 9), 15919#(<= main_~i~0 10), 15920#(<= main_~i~0 11), 15921#(<= main_~i~0 12), 15922#(<= main_~i~0 13), 15923#(<= main_~i~0 14), 15924#(<= main_~i~0 15), 15925#(<= main_~i~0 16), 15926#(<= main_~i~0 17), 15927#(<= main_~i~0 18), 15928#(<= main_~i~0 19), 15929#(<= main_~i~0 20), 15930#(<= main_~i~0 21), 15931#(<= main_~i~0 22), 15932#(<= main_~i~0 23), 15933#(<= main_~i~0 24), 15934#(<= main_~i~0 25), 15935#(<= main_~i~0 26)] [2018-02-04 01:54:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:02,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 01:54:02,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 01:54:02,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 01:54:02,903 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 33 states. [2018-02-04 01:54:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:03,919 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-02-04 01:54:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 01:54:03,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2018-02-04 01:54:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:03,920 INFO L225 Difference]: With dead ends: 486 [2018-02-04 01:54:03,920 INFO L226 Difference]: Without dead ends: 486 [2018-02-04 01:54:03,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 01:54:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-04 01:54:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-02-04 01:54:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 01:54:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-02-04 01:54:03,927 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-02-04 01:54:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:03,927 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-02-04 01:54:03,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 01:54:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-02-04 01:54:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 01:54:03,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:03,929 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:03,929 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash -567505987, now seen corresponding path program 30 times [2018-02-04 01:54:03,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:03,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:04,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:04,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 01:54:04,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:04,282 INFO L182 omatonBuilderFactory]: Interpolants [16960#(<= main_~i~0 22), 16961#(<= main_~i~0 23), 16962#(<= main_~i~0 24), 16963#(<= main_~i~0 25), 16964#(<= main_~i~0 26), 16965#(<= main_~i~0 27), 16966#(<= main_~i~0 28), 16967#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 16968#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 16969#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 16936#true, 16937#false, 16938#(<= main_~i~0 0), 16939#(<= main_~i~0 1), 16940#(<= main_~i~0 2), 16941#(<= main_~i~0 3), 16942#(<= main_~i~0 4), 16943#(<= main_~i~0 5), 16944#(<= main_~i~0 6), 16945#(<= main_~i~0 7), 16946#(<= main_~i~0 8), 16947#(<= main_~i~0 9), 16948#(<= main_~i~0 10), 16949#(<= main_~i~0 11), 16950#(<= main_~i~0 12), 16951#(<= main_~i~0 13), 16952#(<= main_~i~0 14), 16953#(<= main_~i~0 15), 16954#(<= main_~i~0 16), 16955#(<= main_~i~0 17), 16956#(<= main_~i~0 18), 16957#(<= main_~i~0 19), 16958#(<= main_~i~0 20), 16959#(<= main_~i~0 21)] [2018-02-04 01:54:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:04,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 01:54:04,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 01:54:04,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 01:54:04,283 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 34 states. [2018-02-04 01:54:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:05,144 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-02-04 01:54:05,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 01:54:05,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 158 [2018-02-04 01:54:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:05,145 INFO L225 Difference]: With dead ends: 501 [2018-02-04 01:54:05,145 INFO L226 Difference]: Without dead ends: 501 [2018-02-04 01:54:05,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 01:54:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-04 01:54:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-02-04 01:54:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-04 01:54:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-02-04 01:54:05,151 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-02-04 01:54:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:05,152 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-02-04 01:54:05,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 01:54:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-02-04 01:54:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 01:54:05,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:05,153 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:05,153 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1798171889, now seen corresponding path program 31 times [2018-02-04 01:54:05,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:05,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:05,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:05,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 01:54:05,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:05,582 INFO L182 omatonBuilderFactory]: Interpolants [17997#true, 17998#false, 17999#(<= main_~i~0 0), 18000#(<= main_~i~0 1), 18001#(<= main_~i~0 2), 18002#(<= main_~i~0 3), 18003#(<= main_~i~0 4), 18004#(<= main_~i~0 5), 18005#(<= main_~i~0 6), 18006#(<= main_~i~0 7), 18007#(<= main_~i~0 8), 18008#(<= main_~i~0 9), 18009#(<= main_~i~0 10), 18010#(<= main_~i~0 11), 18011#(<= main_~i~0 12), 18012#(<= main_~i~0 13), 18013#(<= main_~i~0 14), 18014#(<= main_~i~0 15), 18015#(<= main_~i~0 16), 18016#(<= main_~i~0 17), 18017#(<= main_~i~0 18), 18018#(<= main_~i~0 19), 18019#(<= main_~i~0 20), 18020#(<= main_~i~0 21), 18021#(<= main_~i~0 22), 18022#(<= main_~i~0 23), 18023#(<= main_~i~0 24), 18024#(<= main_~i~0 25), 18025#(<= main_~i~0 26), 18026#(<= main_~i~0 27), 18027#(<= main_~i~0 28), 18028#(<= main_~i~0 29), 18029#(<= main_~i~0 30), 18030#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 18031#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-02-04 01:54:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:05,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 01:54:05,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 01:54:05,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:54:05,583 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-02-04 01:54:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:06,538 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-02-04 01:54:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 01:54:06,538 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-02-04 01:54:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:06,540 INFO L225 Difference]: With dead ends: 516 [2018-02-04 01:54:06,540 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 01:54:06,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 01:54:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 01:54:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-02-04 01:54:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-04 01:54:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-02-04 01:54:06,545 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-02-04 01:54:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:06,545 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-02-04 01:54:06,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 01:54:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-02-04 01:54:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 01:54:06,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:06,547 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:06,547 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 662064893, now seen corresponding path program 32 times [2018-02-04 01:54:06,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:06,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:06,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:06,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 01:54:06,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:06,999 INFO L182 omatonBuilderFactory]: Interpolants [19090#true, 19091#false, 19092#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 19093#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 19094#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 19095#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 19096#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 19097#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 19098#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 19099#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 19100#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 19101#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 19102#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 19103#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 19104#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 19105#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 19106#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 19107#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 19108#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 19109#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 19110#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 19111#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 19112#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 19113#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 19114#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 19115#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 19116#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 19117#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 19118#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 19119#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 19120#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 19121#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 19122#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 19123#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 19124#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-02-04 01:54:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:07,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 01:54:07,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 01:54:07,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:54:07,000 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-02-04 01:54:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:11,532 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-02-04 01:54:11,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 01:54:11,532 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-02-04 01:54:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:11,533 INFO L225 Difference]: With dead ends: 531 [2018-02-04 01:54:11,533 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 01:54:11,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:54:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 01:54:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-02-04 01:54:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-04 01:54:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-02-04 01:54:11,539 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-02-04 01:54:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:11,539 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-02-04 01:54:11,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 01:54:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-02-04 01:54:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 01:54:11,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:11,540 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:11,540 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -547334193, now seen corresponding path program 33 times [2018-02-04 01:54:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:11,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:12,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:12,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 01:54:12,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:12,050 INFO L182 omatonBuilderFactory]: Interpolants [20160#(<= main_~i~0 8), 20161#(<= main_~i~0 9), 20162#(<= main_~i~0 10), 20163#(<= main_~i~0 11), 20164#(<= main_~i~0 12), 20165#(<= main_~i~0 13), 20166#(<= main_~i~0 14), 20167#(<= main_~i~0 15), 20168#(<= main_~i~0 16), 20169#(<= main_~i~0 17), 20170#(<= main_~i~0 18), 20171#(<= main_~i~0 19), 20172#(<= main_~i~0 20), 20173#(<= main_~i~0 21), 20174#(<= main_~i~0 22), 20175#(<= main_~i~0 23), 20176#(<= main_~i~0 24), 20177#(<= main_~i~0 25), 20178#(<= main_~i~0 26), 20179#(<= main_~i~0 27), 20180#(<= main_~i~0 28), 20181#(<= main_~i~0 29), 20182#(<= main_~i~0 30), 20183#(<= main_~i~0 31), 20184#(<= main_~i~0 32), 20185#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20186#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20150#true, 20151#false, 20152#(<= main_~i~0 0), 20153#(<= main_~i~0 1), 20154#(<= main_~i~0 2), 20155#(<= main_~i~0 3), 20156#(<= main_~i~0 4), 20157#(<= main_~i~0 5), 20158#(<= main_~i~0 6), 20159#(<= main_~i~0 7)] [2018-02-04 01:54:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:12,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 01:54:12,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 01:54:12,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 01:54:12,051 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 37 states. [2018-02-04 01:54:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:13,055 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-02-04 01:54:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 01:54:13,055 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2018-02-04 01:54:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:13,057 INFO L225 Difference]: With dead ends: 546 [2018-02-04 01:54:13,057 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 01:54:13,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 01:54:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 01:54:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-02-04 01:54:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 01:54:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-02-04 01:54:13,062 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-02-04 01:54:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:13,062 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-02-04 01:54:13,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 01:54:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-02-04 01:54:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 01:54:13,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:13,063 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:13,063 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1764425155, now seen corresponding path program 34 times [2018-02-04 01:54:13,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:13,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:13,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:13,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 01:54:13,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:13,516 INFO L182 omatonBuilderFactory]: Interpolants [21312#(<= main_~i~0 3), 21313#(<= main_~i~0 4), 21314#(<= main_~i~0 5), 21315#(<= main_~i~0 6), 21316#(<= main_~i~0 7), 21317#(<= main_~i~0 8), 21318#(<= main_~i~0 9), 21319#(<= main_~i~0 10), 21320#(<= main_~i~0 11), 21321#(<= main_~i~0 12), 21322#(<= main_~i~0 13), 21323#(<= main_~i~0 14), 21324#(<= main_~i~0 15), 21325#(<= main_~i~0 16), 21326#(<= main_~i~0 17), 21327#(<= main_~i~0 18), 21328#(<= main_~i~0 19), 21329#(<= main_~i~0 20), 21330#(<= main_~i~0 21), 21331#(<= main_~i~0 22), 21332#(<= main_~i~0 23), 21333#(<= main_~i~0 24), 21334#(<= main_~i~0 25), 21335#(<= main_~i~0 26), 21336#(<= main_~i~0 27), 21337#(<= main_~i~0 28), 21338#(<= main_~i~0 29), 21339#(<= main_~i~0 30), 21340#(<= main_~i~0 31), 21341#(<= main_~i~0 32), 21342#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 21343#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 21344#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 21307#true, 21308#false, 21309#(<= main_~i~0 0), 21310#(<= main_~i~0 1), 21311#(<= main_~i~0 2)] [2018-02-04 01:54:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:13,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 01:54:13,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 01:54:13,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 01:54:13,516 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 38 states. [2018-02-04 01:54:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:14,626 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-02-04 01:54:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 01:54:14,627 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 178 [2018-02-04 01:54:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:14,628 INFO L225 Difference]: With dead ends: 561 [2018-02-04 01:54:14,628 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 01:54:14,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 01:54:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 01:54:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-02-04 01:54:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-04 01:54:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-02-04 01:54:14,633 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-02-04 01:54:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:14,633 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-02-04 01:54:14,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 01:54:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-02-04 01:54:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 01:54:14,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:14,634 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:14,634 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 997174415, now seen corresponding path program 35 times [2018-02-04 01:54:14,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:14,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:15,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:15,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 01:54:15,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:15,134 INFO L182 omatonBuilderFactory]: Interpolants [22528#(<= main_~i~0 30), 22529#(<= main_~i~0 31), 22530#(<= main_~i~0 32), 22531#(<= main_~i~0 33), 22532#(<= main_~i~0 34), 22533#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 22534#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 22496#true, 22497#false, 22498#(<= main_~i~0 0), 22499#(<= main_~i~0 1), 22500#(<= main_~i~0 2), 22501#(<= main_~i~0 3), 22502#(<= main_~i~0 4), 22503#(<= main_~i~0 5), 22504#(<= main_~i~0 6), 22505#(<= main_~i~0 7), 22506#(<= main_~i~0 8), 22507#(<= main_~i~0 9), 22508#(<= main_~i~0 10), 22509#(<= main_~i~0 11), 22510#(<= main_~i~0 12), 22511#(<= main_~i~0 13), 22512#(<= main_~i~0 14), 22513#(<= main_~i~0 15), 22514#(<= main_~i~0 16), 22515#(<= main_~i~0 17), 22516#(<= main_~i~0 18), 22517#(<= main_~i~0 19), 22518#(<= main_~i~0 20), 22519#(<= main_~i~0 21), 22520#(<= main_~i~0 22), 22521#(<= main_~i~0 23), 22522#(<= main_~i~0 24), 22523#(<= main_~i~0 25), 22524#(<= main_~i~0 26), 22525#(<= main_~i~0 27), 22526#(<= main_~i~0 28), 22527#(<= main_~i~0 29)] [2018-02-04 01:54:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:15,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 01:54:15,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 01:54:15,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 01:54:15,135 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 39 states. [2018-02-04 01:54:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:16,219 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-02-04 01:54:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 01:54:16,219 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 183 [2018-02-04 01:54:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:16,221 INFO L225 Difference]: With dead ends: 576 [2018-02-04 01:54:16,221 INFO L226 Difference]: Without dead ends: 576 [2018-02-04 01:54:16,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 01:54:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-04 01:54:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-02-04 01:54:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-04 01:54:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-02-04 01:54:16,226 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-02-04 01:54:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:16,226 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-02-04 01:54:16,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 01:54:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-02-04 01:54:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 01:54:16,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:16,228 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:16,228 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 182232445, now seen corresponding path program 36 times [2018-02-04 01:54:16,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:16,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:16,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:16,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 01:54:16,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:16,820 INFO L182 omatonBuilderFactory]: Interpolants [23744#(<= main_~i~0 25), 23745#(<= main_~i~0 26), 23746#(<= main_~i~0 27), 23747#(<= main_~i~0 28), 23748#(<= main_~i~0 29), 23749#(<= main_~i~0 30), 23750#(<= main_~i~0 31), 23751#(<= main_~i~0 32), 23752#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 23753#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 23754#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 23755#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 23756#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 23717#true, 23718#false, 23719#(<= main_~i~0 0), 23720#(<= main_~i~0 1), 23721#(<= main_~i~0 2), 23722#(<= main_~i~0 3), 23723#(<= main_~i~0 4), 23724#(<= main_~i~0 5), 23725#(<= main_~i~0 6), 23726#(<= main_~i~0 7), 23727#(<= main_~i~0 8), 23728#(<= main_~i~0 9), 23729#(<= main_~i~0 10), 23730#(<= main_~i~0 11), 23731#(<= main_~i~0 12), 23732#(<= main_~i~0 13), 23733#(<= main_~i~0 14), 23734#(<= main_~i~0 15), 23735#(<= main_~i~0 16), 23736#(<= main_~i~0 17), 23737#(<= main_~i~0 18), 23738#(<= main_~i~0 19), 23739#(<= main_~i~0 20), 23740#(<= main_~i~0 21), 23741#(<= main_~i~0 22), 23742#(<= main_~i~0 23), 23743#(<= main_~i~0 24)] [2018-02-04 01:54:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:16,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 01:54:16,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 01:54:16,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 01:54:16,821 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 40 states. [2018-02-04 01:54:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:18,079 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-02-04 01:54:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 01:54:18,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 188 [2018-02-04 01:54:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:18,081 INFO L225 Difference]: With dead ends: 591 [2018-02-04 01:54:18,081 INFO L226 Difference]: Without dead ends: 591 [2018-02-04 01:54:18,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 01:54:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-04 01:54:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-02-04 01:54:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 01:54:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-02-04 01:54:18,086 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-02-04 01:54:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:18,086 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-02-04 01:54:18,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 01:54:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-02-04 01:54:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 01:54:18,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:18,087 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:18,087 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash -957607601, now seen corresponding path program 37 times [2018-02-04 01:54:18,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:18,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:18,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:18,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 01:54:18,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:18,625 INFO L182 omatonBuilderFactory]: Interpolants [24970#true, 24971#false, 24972#(<= main_~i~0 0), 24973#(<= main_~i~0 1), 24974#(<= main_~i~0 2), 24975#(<= main_~i~0 3), 24976#(<= main_~i~0 4), 24977#(<= main_~i~0 5), 24978#(<= main_~i~0 6), 24979#(<= main_~i~0 7), 24980#(<= main_~i~0 8), 24981#(<= main_~i~0 9), 24982#(<= main_~i~0 10), 24983#(<= main_~i~0 11), 24984#(<= main_~i~0 12), 24985#(<= main_~i~0 13), 24986#(<= main_~i~0 14), 24987#(<= main_~i~0 15), 24988#(<= main_~i~0 16), 24989#(<= main_~i~0 17), 24990#(<= main_~i~0 18), 24991#(<= main_~i~0 19), 24992#(<= main_~i~0 20), 24993#(<= main_~i~0 21), 24994#(<= main_~i~0 22), 24995#(<= main_~i~0 23), 24996#(<= main_~i~0 24), 24997#(<= main_~i~0 25), 24998#(<= main_~i~0 26), 24999#(<= main_~i~0 27), 25000#(<= main_~i~0 28), 25001#(<= main_~i~0 29), 25002#(<= main_~i~0 30), 25003#(<= main_~i~0 31), 25004#(<= main_~i~0 32), 25005#(<= main_~i~0 33), 25006#(<= main_~i~0 34), 25007#(<= main_~i~0 35), 25008#(<= main_~i~0 36), 25009#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 25010#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-02-04 01:54:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:18,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 01:54:18,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 01:54:18,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 01:54:18,626 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-02-04 01:54:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:19,901 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-02-04 01:54:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 01:54:19,901 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-02-04 01:54:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:19,903 INFO L225 Difference]: With dead ends: 606 [2018-02-04 01:54:19,903 INFO L226 Difference]: Without dead ends: 606 [2018-02-04 01:54:19,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 01:54:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-04 01:54:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-02-04 01:54:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-04 01:54:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-02-04 01:54:19,909 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-02-04 01:54:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:19,909 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-02-04 01:54:19,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 01:54:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-02-04 01:54:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 01:54:19,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:19,910 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:19,910 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 38 times [2018-02-04 01:54:19,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:19,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:20,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:20,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 01:54:20,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:20,469 INFO L182 omatonBuilderFactory]: Interpolants [26255#true, 26256#false, 26257#(<= main_~i~0 0), 26258#(<= main_~i~0 1), 26259#(<= main_~i~0 2), 26260#(<= main_~i~0 3), 26261#(<= main_~i~0 4), 26262#(<= main_~i~0 5), 26263#(<= main_~i~0 6), 26264#(<= main_~i~0 7), 26265#(<= main_~i~0 8), 26266#(<= main_~i~0 9), 26267#(<= main_~i~0 10), 26268#(<= main_~i~0 11), 26269#(<= main_~i~0 12), 26270#(<= main_~i~0 13), 26271#(<= main_~i~0 14), 26272#(<= main_~i~0 15), 26273#(<= main_~i~0 16), 26274#(<= main_~i~0 17), 26275#(<= main_~i~0 18), 26276#(<= main_~i~0 19), 26277#(<= main_~i~0 20), 26278#(<= main_~i~0 21), 26279#(<= main_~i~0 22), 26280#(<= main_~i~0 23), 26281#(<= main_~i~0 24), 26282#(<= main_~i~0 25), 26283#(<= main_~i~0 26), 26284#(<= main_~i~0 27), 26285#(<= main_~i~0 28), 26286#(<= main_~i~0 29), 26287#(<= main_~i~0 30), 26288#(<= main_~i~0 31), 26289#(<= main_~i~0 32), 26290#(<= main_~i~0 33), 26291#(<= main_~i~0 34), 26292#(<= main_~i~0 35), 26293#(<= main_~i~0 36), 26294#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 26295#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 26296#(and (<= 2 main_~i~0) (<= main_~i~0 38))] [2018-02-04 01:54:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:20,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 01:54:20,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 01:54:20,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 01:54:20,470 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 42 states. [2018-02-04 01:54:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:21,845 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-02-04 01:54:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 01:54:21,846 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 198 [2018-02-04 01:54:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:21,847 INFO L225 Difference]: With dead ends: 621 [2018-02-04 01:54:21,847 INFO L226 Difference]: Without dead ends: 621 [2018-02-04 01:54:21,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 01:54:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-04 01:54:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-02-04 01:54:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-04 01:54:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-02-04 01:54:21,855 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-02-04 01:54:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:21,856 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-02-04 01:54:21,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 01:54:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-02-04 01:54:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 01:54:21,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:21,857 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:21,857 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:21,857 INFO L82 PathProgramCache]: Analyzing trace with hash 683771407, now seen corresponding path program 39 times [2018-02-04 01:54:21,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:21,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:22,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:22,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 01:54:22,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:22,348 INFO L182 omatonBuilderFactory]: Interpolants [27584#(<= main_~i~0 10), 27585#(<= main_~i~0 11), 27586#(<= main_~i~0 12), 27587#(<= main_~i~0 13), 27588#(<= main_~i~0 14), 27589#(<= main_~i~0 15), 27590#(<= main_~i~0 16), 27591#(<= main_~i~0 17), 27592#(<= main_~i~0 18), 27593#(<= main_~i~0 19), 27594#(<= main_~i~0 20), 27595#(<= main_~i~0 21), 27596#(<= main_~i~0 22), 27597#(<= main_~i~0 23), 27598#(<= main_~i~0 24), 27599#(<= main_~i~0 25), 27600#(<= main_~i~0 26), 27601#(<= main_~i~0 27), 27602#(<= main_~i~0 28), 27603#(<= main_~i~0 29), 27604#(<= main_~i~0 30), 27605#(<= main_~i~0 31), 27606#(<= main_~i~0 32), 27607#(<= main_~i~0 33), 27608#(<= main_~i~0 34), 27609#(<= main_~i~0 35), 27610#(<= main_~i~0 36), 27611#(<= main_~i~0 37), 27612#(<= main_~i~0 38), 27613#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 27614#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 27572#true, 27573#false, 27574#(<= main_~i~0 0), 27575#(<= main_~i~0 1), 27576#(<= main_~i~0 2), 27577#(<= main_~i~0 3), 27578#(<= main_~i~0 4), 27579#(<= main_~i~0 5), 27580#(<= main_~i~0 6), 27581#(<= main_~i~0 7), 27582#(<= main_~i~0 8), 27583#(<= main_~i~0 9)] [2018-02-04 01:54:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:22,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 01:54:22,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 01:54:22,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 01:54:22,349 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 43 states. [2018-02-04 01:54:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:23,550 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-02-04 01:54:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 01:54:23,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 203 [2018-02-04 01:54:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:23,552 INFO L225 Difference]: With dead ends: 636 [2018-02-04 01:54:23,552 INFO L226 Difference]: Without dead ends: 636 [2018-02-04 01:54:23,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 01:54:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-02-04 01:54:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-02-04 01:54:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-02-04 01:54:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-02-04 01:54:23,561 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-02-04 01:54:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:23,561 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-02-04 01:54:23,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 01:54:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-02-04 01:54:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 01:54:23,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:23,563 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:23,563 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -298402819, now seen corresponding path program 40 times [2018-02-04 01:54:23,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:23,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:24,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:24,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 01:54:24,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:24,244 INFO L182 omatonBuilderFactory]: Interpolants [28928#(<= main_~i~0 5), 28929#(<= main_~i~0 6), 28930#(<= main_~i~0 7), 28931#(<= main_~i~0 8), 28932#(<= main_~i~0 9), 28933#(<= main_~i~0 10), 28934#(<= main_~i~0 11), 28935#(<= main_~i~0 12), 28936#(<= main_~i~0 13), 28937#(<= main_~i~0 14), 28938#(<= main_~i~0 15), 28939#(<= main_~i~0 16), 28940#(<= main_~i~0 17), 28941#(<= main_~i~0 18), 28942#(<= main_~i~0 19), 28943#(<= main_~i~0 20), 28944#(<= main_~i~0 21), 28945#(<= main_~i~0 22), 28946#(<= main_~i~0 23), 28947#(<= main_~i~0 24), 28948#(<= main_~i~0 25), 28949#(<= main_~i~0 26), 28950#(<= main_~i~0 27), 28951#(<= main_~i~0 28), 28952#(<= main_~i~0 29), 28953#(<= main_~i~0 30), 28954#(<= main_~i~0 31), 28955#(<= main_~i~0 32), 28956#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 28957#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 28958#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 28959#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 28960#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 28961#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 28962#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 28963#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 28964#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 28921#true, 28922#false, 28923#(<= main_~i~0 0), 28924#(<= main_~i~0 1), 28925#(<= main_~i~0 2), 28926#(<= main_~i~0 3), 28927#(<= main_~i~0 4)] [2018-02-04 01:54:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:24,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 01:54:24,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 01:54:24,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 01:54:24,245 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 44 states. [2018-02-04 01:54:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:26,144 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-02-04 01:54:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 01:54:26,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-02-04 01:54:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:26,146 INFO L225 Difference]: With dead ends: 651 [2018-02-04 01:54:26,146 INFO L226 Difference]: Without dead ends: 651 [2018-02-04 01:54:26,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 01:54:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-02-04 01:54:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-02-04 01:54:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-04 01:54:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-02-04 01:54:26,151 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-02-04 01:54:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:26,151 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-02-04 01:54:26,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 01:54:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-02-04 01:54:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 01:54:26,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:26,152 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:26,152 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1356597967, now seen corresponding path program 41 times [2018-02-04 01:54:26,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:26,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:26,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:26,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 01:54:26,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:26,671 INFO L182 omatonBuilderFactory]: Interpolants [30336#(<= main_~i~0 32), 30337#(<= main_~i~0 33), 30338#(<= main_~i~0 34), 30339#(<= main_~i~0 35), 30340#(<= main_~i~0 36), 30341#(<= main_~i~0 37), 30342#(<= main_~i~0 38), 30343#(<= main_~i~0 39), 30344#(<= main_~i~0 40), 30345#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30346#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30302#true, 30303#false, 30304#(<= main_~i~0 0), 30305#(<= main_~i~0 1), 30306#(<= main_~i~0 2), 30307#(<= main_~i~0 3), 30308#(<= main_~i~0 4), 30309#(<= main_~i~0 5), 30310#(<= main_~i~0 6), 30311#(<= main_~i~0 7), 30312#(<= main_~i~0 8), 30313#(<= main_~i~0 9), 30314#(<= main_~i~0 10), 30315#(<= main_~i~0 11), 30316#(<= main_~i~0 12), 30317#(<= main_~i~0 13), 30318#(<= main_~i~0 14), 30319#(<= main_~i~0 15), 30320#(<= main_~i~0 16), 30321#(<= main_~i~0 17), 30322#(<= main_~i~0 18), 30323#(<= main_~i~0 19), 30324#(<= main_~i~0 20), 30325#(<= main_~i~0 21), 30326#(<= main_~i~0 22), 30327#(<= main_~i~0 23), 30328#(<= main_~i~0 24), 30329#(<= main_~i~0 25), 30330#(<= main_~i~0 26), 30331#(<= main_~i~0 27), 30332#(<= main_~i~0 28), 30333#(<= main_~i~0 29), 30334#(<= main_~i~0 30), 30335#(<= main_~i~0 31)] [2018-02-04 01:54:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:26,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 01:54:26,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 01:54:26,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 01:54:26,672 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 45 states. [2018-02-04 01:54:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:28,024 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-02-04 01:54:28,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 01:54:28,024 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-02-04 01:54:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:28,026 INFO L225 Difference]: With dead ends: 666 [2018-02-04 01:54:28,026 INFO L226 Difference]: Without dead ends: 666 [2018-02-04 01:54:28,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 01:54:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-04 01:54:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-02-04 01:54:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 01:54:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-02-04 01:54:28,031 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-02-04 01:54:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:28,031 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-02-04 01:54:28,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 01:54:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-02-04 01:54:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-02-04 01:54:28,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:28,032 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:28,032 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1303457597, now seen corresponding path program 42 times [2018-02-04 01:54:28,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:28,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:28,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:28,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 01:54:28,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:28,629 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 27), 31745#(<= main_~i~0 28), 31746#(<= main_~i~0 29), 31747#(<= main_~i~0 30), 31748#(<= main_~i~0 31), 31749#(<= main_~i~0 32), 31750#(<= main_~i~0 33), 31751#(<= main_~i~0 34), 31752#(<= main_~i~0 35), 31753#(<= main_~i~0 36), 31754#(<= main_~i~0 37), 31755#(<= main_~i~0 38), 31756#(<= main_~i~0 39), 31757#(<= main_~i~0 40), 31758#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 31759#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 31760#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 31715#true, 31716#false, 31717#(<= main_~i~0 0), 31718#(<= main_~i~0 1), 31719#(<= main_~i~0 2), 31720#(<= main_~i~0 3), 31721#(<= main_~i~0 4), 31722#(<= main_~i~0 5), 31723#(<= main_~i~0 6), 31724#(<= main_~i~0 7), 31725#(<= main_~i~0 8), 31726#(<= main_~i~0 9), 31727#(<= main_~i~0 10), 31728#(<= main_~i~0 11), 31729#(<= main_~i~0 12), 31730#(<= main_~i~0 13), 31731#(<= main_~i~0 14), 31732#(<= main_~i~0 15), 31733#(<= main_~i~0 16), 31734#(<= main_~i~0 17), 31735#(<= main_~i~0 18), 31736#(<= main_~i~0 19), 31737#(<= main_~i~0 20), 31738#(<= main_~i~0 21), 31739#(<= main_~i~0 22), 31740#(<= main_~i~0 23), 31741#(<= main_~i~0 24), 31742#(<= main_~i~0 25), 31743#(<= main_~i~0 26)] [2018-02-04 01:54:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:28,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 01:54:28,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 01:54:28,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:54:28,630 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 46 states. [2018-02-04 01:54:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:30,068 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-02-04 01:54:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 01:54:30,069 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 218 [2018-02-04 01:54:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:30,070 INFO L225 Difference]: With dead ends: 681 [2018-02-04 01:54:30,070 INFO L226 Difference]: Without dead ends: 681 [2018-02-04 01:54:30,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 01:54:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-04 01:54:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-02-04 01:54:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-04 01:54:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-02-04 01:54:30,076 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-02-04 01:54:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:30,076 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-02-04 01:54:30,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 01:54:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-02-04 01:54:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 01:54:30,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:30,077 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:30,077 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash 942120847, now seen corresponding path program 43 times [2018-02-04 01:54:30,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:30,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:30,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:30,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 01:54:30,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:30,677 INFO L182 omatonBuilderFactory]: Interpolants [33160#true, 33161#false, 33162#(<= main_~i~0 0), 33163#(<= main_~i~0 1), 33164#(<= main_~i~0 2), 33165#(<= main_~i~0 3), 33166#(<= main_~i~0 4), 33167#(<= main_~i~0 5), 33168#(<= main_~i~0 6), 33169#(<= main_~i~0 7), 33170#(<= main_~i~0 8), 33171#(<= main_~i~0 9), 33172#(<= main_~i~0 10), 33173#(<= main_~i~0 11), 33174#(<= main_~i~0 12), 33175#(<= main_~i~0 13), 33176#(<= main_~i~0 14), 33177#(<= main_~i~0 15), 33178#(<= main_~i~0 16), 33179#(<= main_~i~0 17), 33180#(<= main_~i~0 18), 33181#(<= main_~i~0 19), 33182#(<= main_~i~0 20), 33183#(<= main_~i~0 21), 33184#(<= main_~i~0 22), 33185#(<= main_~i~0 23), 33186#(<= main_~i~0 24), 33187#(<= main_~i~0 25), 33188#(<= main_~i~0 26), 33189#(<= main_~i~0 27), 33190#(<= main_~i~0 28), 33191#(<= main_~i~0 29), 33192#(<= main_~i~0 30), 33193#(<= main_~i~0 31), 33194#(<= main_~i~0 32), 33195#(<= main_~i~0 33), 33196#(<= main_~i~0 34), 33197#(<= main_~i~0 35), 33198#(<= main_~i~0 36), 33199#(<= main_~i~0 37), 33200#(<= main_~i~0 38), 33201#(<= main_~i~0 39), 33202#(<= main_~i~0 40), 33203#(<= main_~i~0 41), 33204#(<= main_~i~0 42), 33205#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 33206#(and (<= 1 main_~i~0) (<= main_~i~0 43))] [2018-02-04 01:54:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:30,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 01:54:30,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 01:54:30,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 01:54:30,678 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-02-04 01:54:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:32,305 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-02-04 01:54:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 01:54:32,322 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-02-04 01:54:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:32,324 INFO L225 Difference]: With dead ends: 696 [2018-02-04 01:54:32,324 INFO L226 Difference]: Without dead ends: 696 [2018-02-04 01:54:32,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 01:54:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-04 01:54:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-02-04 01:54:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-02-04 01:54:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-02-04 01:54:32,330 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-02-04 01:54:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:32,330 INFO L432 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-02-04 01:54:32,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 01:54:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-02-04 01:54:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-04 01:54:32,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:32,331 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:32,331 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 304386685, now seen corresponding path program 44 times [2018-02-04 01:54:32,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:32,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:32,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:32,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 01:54:32,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:32,963 INFO L182 omatonBuilderFactory]: Interpolants [34637#true, 34638#false, 34639#(<= main_~i~0 0), 34640#(<= main_~i~0 1), 34641#(<= main_~i~0 2), 34642#(<= main_~i~0 3), 34643#(<= main_~i~0 4), 34644#(<= main_~i~0 5), 34645#(<= main_~i~0 6), 34646#(<= main_~i~0 7), 34647#(<= main_~i~0 8), 34648#(<= main_~i~0 9), 34649#(<= main_~i~0 10), 34650#(<= main_~i~0 11), 34651#(<= main_~i~0 12), 34652#(<= main_~i~0 13), 34653#(<= main_~i~0 14), 34654#(<= main_~i~0 15), 34655#(<= main_~i~0 16), 34656#(<= main_~i~0 17), 34657#(<= main_~i~0 18), 34658#(<= main_~i~0 19), 34659#(<= main_~i~0 20), 34660#(<= main_~i~0 21), 34661#(<= main_~i~0 22), 34662#(<= main_~i~0 23), 34663#(<= main_~i~0 24), 34664#(<= main_~i~0 25), 34665#(<= main_~i~0 26), 34666#(<= main_~i~0 27), 34667#(<= main_~i~0 28), 34668#(<= main_~i~0 29), 34669#(<= main_~i~0 30), 34670#(<= main_~i~0 31), 34671#(<= main_~i~0 32), 34672#(<= main_~i~0 33), 34673#(<= main_~i~0 34), 34674#(<= main_~i~0 35), 34675#(<= main_~i~0 36), 34676#(<= main_~i~0 37), 34677#(<= main_~i~0 38), 34678#(<= main_~i~0 39), 34679#(<= main_~i~0 40), 34680#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 34681#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 34682#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 34683#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 34684#(and (<= main_~i~0 44) (<= 4 main_~i~0))] [2018-02-04 01:54:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:32,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 01:54:32,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 01:54:32,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 01:54:32,964 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 48 states. [2018-02-04 01:54:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:34,906 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-02-04 01:54:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 01:54:34,906 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2018-02-04 01:54:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:34,908 INFO L225 Difference]: With dead ends: 711 [2018-02-04 01:54:34,908 INFO L226 Difference]: Without dead ends: 711 [2018-02-04 01:54:34,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 01:54:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-04 01:54:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-02-04 01:54:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-04 01:54:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-02-04 01:54:34,913 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-02-04 01:54:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:34,913 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-02-04 01:54:34,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 01:54:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-02-04 01:54:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 01:54:34,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:34,914 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:34,914 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1601158065, now seen corresponding path program 45 times [2018-02-04 01:54:34,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:34,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:35,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:35,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 01:54:35,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:35,626 INFO L182 omatonBuilderFactory]: Interpolants [36146#true, 36147#false, 36148#(<= main_~i~0 0), 36149#(<= main_~i~0 1), 36150#(<= main_~i~0 2), 36151#(<= main_~i~0 3), 36152#(<= main_~i~0 4), 36153#(<= main_~i~0 5), 36154#(<= main_~i~0 6), 36155#(<= main_~i~0 7), 36156#(<= main_~i~0 8), 36157#(<= main_~i~0 9), 36158#(<= main_~i~0 10), 36159#(<= main_~i~0 11), 36160#(<= main_~i~0 12), 36161#(<= main_~i~0 13), 36162#(<= main_~i~0 14), 36163#(<= main_~i~0 15), 36164#(<= main_~i~0 16), 36165#(<= main_~i~0 17), 36166#(<= main_~i~0 18), 36167#(<= main_~i~0 19), 36168#(<= main_~i~0 20), 36169#(<= main_~i~0 21), 36170#(<= main_~i~0 22), 36171#(<= main_~i~0 23), 36172#(<= main_~i~0 24), 36173#(<= main_~i~0 25), 36174#(<= main_~i~0 26), 36175#(<= main_~i~0 27), 36176#(<= main_~i~0 28), 36177#(<= main_~i~0 29), 36178#(<= main_~i~0 30), 36179#(<= main_~i~0 31), 36180#(<= main_~i~0 32), 36181#(<= main_~i~0 33), 36182#(<= main_~i~0 34), 36183#(<= main_~i~0 35), 36184#(<= main_~i~0 36), 36185#(<= main_~i~0 37), 36186#(<= main_~i~0 38), 36187#(<= main_~i~0 39), 36188#(<= main_~i~0 40), 36189#(<= main_~i~0 41), 36190#(<= main_~i~0 42), 36191#(<= main_~i~0 43), 36192#(<= main_~i~0 44), 36193#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 36194#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-02-04 01:54:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:35,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 01:54:35,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 01:54:35,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 01:54:35,627 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 49 states. [2018-02-04 01:54:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:37,269 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-02-04 01:54:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 01:54:37,269 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 233 [2018-02-04 01:54:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:37,271 INFO L225 Difference]: With dead ends: 726 [2018-02-04 01:54:37,271 INFO L226 Difference]: Without dead ends: 726 [2018-02-04 01:54:37,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 01:54:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-02-04 01:54:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-02-04 01:54:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-02-04 01:54:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-02-04 01:54:37,276 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-02-04 01:54:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:37,276 INFO L432 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-02-04 01:54:37,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 01:54:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-02-04 01:54:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 01:54:37,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:37,278 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:37,278 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -853219907, now seen corresponding path program 46 times [2018-02-04 01:54:37,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:37,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:37,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:37,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 01:54:37,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:37,902 INFO L182 omatonBuilderFactory]: Interpolants [37687#true, 37688#false, 37689#(<= main_~i~0 0), 37690#(<= main_~i~0 1), 37691#(<= main_~i~0 2), 37692#(<= main_~i~0 3), 37693#(<= main_~i~0 4), 37694#(<= main_~i~0 5), 37695#(<= main_~i~0 6), 37696#(<= main_~i~0 7), 37697#(<= main_~i~0 8), 37698#(<= main_~i~0 9), 37699#(<= main_~i~0 10), 37700#(<= main_~i~0 11), 37701#(<= main_~i~0 12), 37702#(<= main_~i~0 13), 37703#(<= main_~i~0 14), 37704#(<= main_~i~0 15), 37705#(<= main_~i~0 16), 37706#(<= main_~i~0 17), 37707#(<= main_~i~0 18), 37708#(<= main_~i~0 19), 37709#(<= main_~i~0 20), 37710#(<= main_~i~0 21), 37711#(<= main_~i~0 22), 37712#(<= main_~i~0 23), 37713#(<= main_~i~0 24), 37714#(<= main_~i~0 25), 37715#(<= main_~i~0 26), 37716#(<= main_~i~0 27), 37717#(<= main_~i~0 28), 37718#(<= main_~i~0 29), 37719#(<= main_~i~0 30), 37720#(<= main_~i~0 31), 37721#(<= main_~i~0 32), 37722#(<= main_~i~0 33), 37723#(<= main_~i~0 34), 37724#(<= main_~i~0 35), 37725#(<= main_~i~0 36), 37726#(<= main_~i~0 37), 37727#(<= main_~i~0 38), 37728#(<= main_~i~0 39), 37729#(<= main_~i~0 40), 37730#(<= main_~i~0 41), 37731#(<= main_~i~0 42), 37732#(<= main_~i~0 43), 37733#(<= main_~i~0 44), 37734#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 37735#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 37736#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-02-04 01:54:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:37,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 01:54:37,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 01:54:37,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 01:54:37,903 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 50 states. [2018-02-04 01:54:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:39,662 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-02-04 01:54:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 01:54:39,662 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 238 [2018-02-04 01:54:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:39,664 INFO L225 Difference]: With dead ends: 741 [2018-02-04 01:54:39,664 INFO L226 Difference]: Without dead ends: 741 [2018-02-04 01:54:39,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 01:54:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-02-04 01:54:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-02-04 01:54:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-02-04 01:54:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-02-04 01:54:39,668 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-02-04 01:54:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:39,668 INFO L432 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-02-04 01:54:39,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 01:54:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-02-04 01:54:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-04 01:54:39,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:39,670 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:39,670 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -721290993, now seen corresponding path program 47 times [2018-02-04 01:54:39,670 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:39,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:40,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:40,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 01:54:40,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:40,304 INFO L182 omatonBuilderFactory]: Interpolants [39296#(<= main_~i~0 34), 39297#(<= main_~i~0 35), 39298#(<= main_~i~0 36), 39299#(<= main_~i~0 37), 39300#(<= main_~i~0 38), 39301#(<= main_~i~0 39), 39302#(<= main_~i~0 40), 39303#(<= main_~i~0 41), 39304#(<= main_~i~0 42), 39305#(<= main_~i~0 43), 39306#(<= main_~i~0 44), 39307#(<= main_~i~0 45), 39308#(<= main_~i~0 46), 39309#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 39310#(and (<= 1 main_~i~0) (<= main_~i~0 47)), 39260#true, 39261#false, 39262#(<= main_~i~0 0), 39263#(<= main_~i~0 1), 39264#(<= main_~i~0 2), 39265#(<= main_~i~0 3), 39266#(<= main_~i~0 4), 39267#(<= main_~i~0 5), 39268#(<= main_~i~0 6), 39269#(<= main_~i~0 7), 39270#(<= main_~i~0 8), 39271#(<= main_~i~0 9), 39272#(<= main_~i~0 10), 39273#(<= main_~i~0 11), 39274#(<= main_~i~0 12), 39275#(<= main_~i~0 13), 39276#(<= main_~i~0 14), 39277#(<= main_~i~0 15), 39278#(<= main_~i~0 16), 39279#(<= main_~i~0 17), 39280#(<= main_~i~0 18), 39281#(<= main_~i~0 19), 39282#(<= main_~i~0 20), 39283#(<= main_~i~0 21), 39284#(<= main_~i~0 22), 39285#(<= main_~i~0 23), 39286#(<= main_~i~0 24), 39287#(<= main_~i~0 25), 39288#(<= main_~i~0 26), 39289#(<= main_~i~0 27), 39290#(<= main_~i~0 28), 39291#(<= main_~i~0 29), 39292#(<= main_~i~0 30), 39293#(<= main_~i~0 31), 39294#(<= main_~i~0 32), 39295#(<= main_~i~0 33)] [2018-02-04 01:54:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:40,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 01:54:40,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 01:54:40,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 01:54:40,305 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 51 states. [2018-02-04 01:54:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:42,082 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-02-04 01:54:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 01:54:42,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 243 [2018-02-04 01:54:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:42,083 INFO L225 Difference]: With dead ends: 756 [2018-02-04 01:54:42,083 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 01:54:42,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 01:54:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 01:54:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-02-04 01:54:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-02-04 01:54:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-02-04 01:54:42,088 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-02-04 01:54:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:42,088 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-02-04 01:54:42,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 01:54:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-02-04 01:54:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-04 01:54:42,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:42,090 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:42,090 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash 658909437, now seen corresponding path program 48 times [2018-02-04 01:54:42,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:42,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:42,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:42,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 01:54:42,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:42,767 INFO L182 omatonBuilderFactory]: Interpolants [40865#true, 40866#false, 40867#(<= main_~i~0 0), 40868#(<= main_~i~0 1), 40869#(<= main_~i~0 2), 40870#(<= main_~i~0 3), 40871#(<= main_~i~0 4), 40872#(<= main_~i~0 5), 40873#(<= main_~i~0 6), 40874#(<= main_~i~0 7), 40875#(<= main_~i~0 8), 40876#(<= main_~i~0 9), 40877#(<= main_~i~0 10), 40878#(<= main_~i~0 11), 40879#(<= main_~i~0 12), 40880#(<= main_~i~0 13), 40881#(<= main_~i~0 14), 40882#(<= main_~i~0 15), 40883#(<= main_~i~0 16), 40884#(<= main_~i~0 17), 40885#(<= main_~i~0 18), 40886#(<= main_~i~0 19), 40887#(<= main_~i~0 20), 40888#(<= main_~i~0 21), 40889#(<= main_~i~0 22), 40890#(<= main_~i~0 23), 40891#(<= main_~i~0 24), 40892#(<= main_~i~0 25), 40893#(<= main_~i~0 26), 40894#(<= main_~i~0 27), 40895#(<= main_~i~0 28), 40896#(<= main_~i~0 29), 40897#(<= main_~i~0 30), 40898#(<= main_~i~0 31), 40899#(<= main_~i~0 32), 40900#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 40901#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 40902#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 40903#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 40904#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 40905#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 40906#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 40907#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 40908#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 40909#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 40910#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 40911#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 40912#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 40913#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 40914#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 40915#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 40916#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-02-04 01:54:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:42,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 01:54:42,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 01:54:42,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 01:54:42,767 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 52 states. [2018-02-04 01:54:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:46,513 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-02-04 01:54:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 01:54:46,514 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 248 [2018-02-04 01:54:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:46,516 INFO L225 Difference]: With dead ends: 771 [2018-02-04 01:54:46,516 INFO L226 Difference]: Without dead ends: 771 [2018-02-04 01:54:46,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 01:54:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-04 01:54:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-02-04 01:54:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-02-04 01:54:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-02-04 01:54:46,529 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-02-04 01:54:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:46,529 INFO L432 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-02-04 01:54:46,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 01:54:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-02-04 01:54:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 01:54:46,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:46,534 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:46,534 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1768472015, now seen corresponding path program 49 times [2018-02-04 01:54:46,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:46,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:47,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:47,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 01:54:47,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:47,308 INFO L182 omatonBuilderFactory]: Interpolants [42502#true, 42503#false, 42504#(<= main_~i~0 0), 42505#(<= main_~i~0 1), 42506#(<= main_~i~0 2), 42507#(<= main_~i~0 3), 42508#(<= main_~i~0 4), 42509#(<= main_~i~0 5), 42510#(<= main_~i~0 6), 42511#(<= main_~i~0 7), 42512#(<= main_~i~0 8), 42513#(<= main_~i~0 9), 42514#(<= main_~i~0 10), 42515#(<= main_~i~0 11), 42516#(<= main_~i~0 12), 42517#(<= main_~i~0 13), 42518#(<= main_~i~0 14), 42519#(<= main_~i~0 15), 42520#(<= main_~i~0 16), 42521#(<= main_~i~0 17), 42522#(<= main_~i~0 18), 42523#(<= main_~i~0 19), 42524#(<= main_~i~0 20), 42525#(<= main_~i~0 21), 42526#(<= main_~i~0 22), 42527#(<= main_~i~0 23), 42528#(<= main_~i~0 24), 42529#(<= main_~i~0 25), 42530#(<= main_~i~0 26), 42531#(<= main_~i~0 27), 42532#(<= main_~i~0 28), 42533#(<= main_~i~0 29), 42534#(<= main_~i~0 30), 42535#(<= main_~i~0 31), 42536#(<= main_~i~0 32), 42537#(<= main_~i~0 33), 42538#(<= main_~i~0 34), 42539#(<= main_~i~0 35), 42540#(<= main_~i~0 36), 42541#(<= main_~i~0 37), 42542#(<= main_~i~0 38), 42543#(<= main_~i~0 39), 42544#(<= main_~i~0 40), 42545#(<= main_~i~0 41), 42546#(<= main_~i~0 42), 42547#(<= main_~i~0 43), 42548#(<= main_~i~0 44), 42549#(<= main_~i~0 45), 42550#(<= main_~i~0 46), 42551#(<= main_~i~0 47), 42552#(<= main_~i~0 48), 42553#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 42554#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-02-04 01:54:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:47,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 01:54:47,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 01:54:47,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 01:54:47,309 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-02-04 01:54:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:49,354 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-02-04 01:54:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 01:54:49,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-02-04 01:54:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:49,356 INFO L225 Difference]: With dead ends: 786 [2018-02-04 01:54:49,356 INFO L226 Difference]: Without dead ends: 786 [2018-02-04 01:54:49,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 01:54:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-02-04 01:54:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-02-04 01:54:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-02-04 01:54:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-02-04 01:54:49,363 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-02-04 01:54:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:49,364 INFO L432 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-02-04 01:54:49,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 01:54:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-02-04 01:54:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-04 01:54:49,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:49,365 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:49,365 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 538729533, now seen corresponding path program 50 times [2018-02-04 01:54:49,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:49,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:50,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:50,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 01:54:50,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:50,081 INFO L182 omatonBuilderFactory]: Interpolants [44171#true, 44172#false, 44173#(<= main_~i~0 0), 44174#(<= main_~i~0 1), 44175#(<= main_~i~0 2), 44176#(<= main_~i~0 3), 44177#(<= main_~i~0 4), 44178#(<= main_~i~0 5), 44179#(<= main_~i~0 6), 44180#(<= main_~i~0 7), 44181#(<= main_~i~0 8), 44182#(<= main_~i~0 9), 44183#(<= main_~i~0 10), 44184#(<= main_~i~0 11), 44185#(<= main_~i~0 12), 44186#(<= main_~i~0 13), 44187#(<= main_~i~0 14), 44188#(<= main_~i~0 15), 44189#(<= main_~i~0 16), 44190#(<= main_~i~0 17), 44191#(<= main_~i~0 18), 44192#(<= main_~i~0 19), 44193#(<= main_~i~0 20), 44194#(<= main_~i~0 21), 44195#(<= main_~i~0 22), 44196#(<= main_~i~0 23), 44197#(<= main_~i~0 24), 44198#(<= main_~i~0 25), 44199#(<= main_~i~0 26), 44200#(<= main_~i~0 27), 44201#(<= main_~i~0 28), 44202#(<= main_~i~0 29), 44203#(<= main_~i~0 30), 44204#(<= main_~i~0 31), 44205#(<= main_~i~0 32), 44206#(<= main_~i~0 33), 44207#(<= main_~i~0 34), 44208#(<= main_~i~0 35), 44209#(<= main_~i~0 36), 44210#(<= main_~i~0 37), 44211#(<= main_~i~0 38), 44212#(<= main_~i~0 39), 44213#(<= main_~i~0 40), 44214#(<= main_~i~0 41), 44215#(<= main_~i~0 42), 44216#(<= main_~i~0 43), 44217#(<= main_~i~0 44), 44218#(<= main_~i~0 45), 44219#(<= main_~i~0 46), 44220#(<= main_~i~0 47), 44221#(<= main_~i~0 48), 44222#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 44223#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 44224#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-02-04 01:54:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:50,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 01:54:50,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 01:54:50,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 01:54:50,082 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 54 states. [2018-02-04 01:54:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:52,267 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-02-04 01:54:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 01:54:52,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 258 [2018-02-04 01:54:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:52,269 INFO L225 Difference]: With dead ends: 801 [2018-02-04 01:54:52,269 INFO L226 Difference]: Without dead ends: 801 [2018-02-04 01:54:52,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-02-04 01:54:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-02-04 01:54:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-02-04 01:54:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-04 01:54:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-02-04 01:54:52,277 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-02-04 01:54:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:52,278 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-02-04 01:54:52,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 01:54:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-02-04 01:54:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-04 01:54:52,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:52,280 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:52,280 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash -89091441, now seen corresponding path program 51 times [2018-02-04 01:54:52,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:52,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:53,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:53,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 01:54:53,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:53,054 INFO L182 omatonBuilderFactory]: Interpolants [45872#true, 45873#false, 45874#(<= main_~i~0 0), 45875#(<= main_~i~0 1), 45876#(<= main_~i~0 2), 45877#(<= main_~i~0 3), 45878#(<= main_~i~0 4), 45879#(<= main_~i~0 5), 45880#(<= main_~i~0 6), 45881#(<= main_~i~0 7), 45882#(<= main_~i~0 8), 45883#(<= main_~i~0 9), 45884#(<= main_~i~0 10), 45885#(<= main_~i~0 11), 45886#(<= main_~i~0 12), 45887#(<= main_~i~0 13), 45888#(<= main_~i~0 14), 45889#(<= main_~i~0 15), 45890#(<= main_~i~0 16), 45891#(<= main_~i~0 17), 45892#(<= main_~i~0 18), 45893#(<= main_~i~0 19), 45894#(<= main_~i~0 20), 45895#(<= main_~i~0 21), 45896#(<= main_~i~0 22), 45897#(<= main_~i~0 23), 45898#(<= main_~i~0 24), 45899#(<= main_~i~0 25), 45900#(<= main_~i~0 26), 45901#(<= main_~i~0 27), 45902#(<= main_~i~0 28), 45903#(<= main_~i~0 29), 45904#(<= main_~i~0 30), 45905#(<= main_~i~0 31), 45906#(<= main_~i~0 32), 45907#(<= main_~i~0 33), 45908#(<= main_~i~0 34), 45909#(<= main_~i~0 35), 45910#(<= main_~i~0 36), 45911#(<= main_~i~0 37), 45912#(<= main_~i~0 38), 45913#(<= main_~i~0 39), 45914#(<= main_~i~0 40), 45915#(<= main_~i~0 41), 45916#(<= main_~i~0 42), 45917#(<= main_~i~0 43), 45918#(<= main_~i~0 44), 45919#(<= main_~i~0 45), 45920#(<= main_~i~0 46), 45921#(<= main_~i~0 47), 45922#(<= main_~i~0 48), 45923#(<= main_~i~0 49), 45924#(<= main_~i~0 50), 45925#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 45926#(and (<= 1 main_~i~0) (<= main_~i~0 51))] [2018-02-04 01:54:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:53,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 01:54:53,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 01:54:53,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 01:54:53,055 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 55 states. [2018-02-04 01:54:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:55,254 INFO L93 Difference]: Finished difference Result 816 states and 1080 transitions. [2018-02-04 01:54:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 01:54:55,254 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 263 [2018-02-04 01:54:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:55,256 INFO L225 Difference]: With dead ends: 816 [2018-02-04 01:54:55,256 INFO L226 Difference]: Without dead ends: 816 [2018-02-04 01:54:55,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 01:54:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-02-04 01:54:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 760. [2018-02-04 01:54:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-02-04 01:54:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1022 transitions. [2018-02-04 01:54:55,262 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1022 transitions. Word has length 263 [2018-02-04 01:54:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:55,262 INFO L432 AbstractCegarLoop]: Abstraction has 760 states and 1022 transitions. [2018-02-04 01:54:55,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 01:54:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1022 transitions. [2018-02-04 01:54:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-02-04 01:54:55,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:55,263 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:55,263 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1312522109, now seen corresponding path program 52 times [2018-02-04 01:54:55,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:55,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:56,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:56,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 01:54:56,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:56,118 INFO L182 omatonBuilderFactory]: Interpolants [47616#(<= main_~i~0 9), 47617#(<= main_~i~0 10), 47618#(<= main_~i~0 11), 47619#(<= main_~i~0 12), 47620#(<= main_~i~0 13), 47621#(<= main_~i~0 14), 47622#(<= main_~i~0 15), 47623#(<= main_~i~0 16), 47624#(<= main_~i~0 17), 47625#(<= main_~i~0 18), 47626#(<= main_~i~0 19), 47627#(<= main_~i~0 20), 47628#(<= main_~i~0 21), 47629#(<= main_~i~0 22), 47630#(<= main_~i~0 23), 47631#(<= main_~i~0 24), 47632#(<= main_~i~0 25), 47633#(<= main_~i~0 26), 47634#(<= main_~i~0 27), 47635#(<= main_~i~0 28), 47636#(<= main_~i~0 29), 47637#(<= main_~i~0 30), 47638#(<= main_~i~0 31), 47639#(<= main_~i~0 32), 47640#(<= main_~i~0 33), 47641#(<= main_~i~0 34), 47642#(<= main_~i~0 35), 47643#(<= main_~i~0 36), 47644#(<= main_~i~0 37), 47645#(<= main_~i~0 38), 47646#(<= main_~i~0 39), 47647#(<= main_~i~0 40), 47648#(<= main_~i~0 41), 47649#(<= main_~i~0 42), 47650#(<= main_~i~0 43), 47651#(<= main_~i~0 44), 47652#(<= main_~i~0 45), 47653#(<= main_~i~0 46), 47654#(<= main_~i~0 47), 47655#(<= main_~i~0 48), 47656#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 47657#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 47658#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 47659#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 47660#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 47605#true, 47606#false, 47607#(<= main_~i~0 0), 47608#(<= main_~i~0 1), 47609#(<= main_~i~0 2), 47610#(<= main_~i~0 3), 47611#(<= main_~i~0 4), 47612#(<= main_~i~0 5), 47613#(<= main_~i~0 6), 47614#(<= main_~i~0 7), 47615#(<= main_~i~0 8)] [2018-02-04 01:54:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:56,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 01:54:56,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 01:54:56,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 01:54:56,118 INFO L87 Difference]: Start difference. First operand 760 states and 1022 transitions. Second operand 56 states. [2018-02-04 01:54:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:54:58,571 INFO L93 Difference]: Finished difference Result 831 states and 1100 transitions. [2018-02-04 01:54:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 01:54:58,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 268 [2018-02-04 01:54:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:54:58,573 INFO L225 Difference]: With dead ends: 831 [2018-02-04 01:54:58,573 INFO L226 Difference]: Without dead ends: 831 [2018-02-04 01:54:58,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 01:54:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-02-04 01:54:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 774. [2018-02-04 01:54:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-02-04 01:54:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1041 transitions. [2018-02-04 01:54:58,581 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1041 transitions. Word has length 268 [2018-02-04 01:54:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:54:58,581 INFO L432 AbstractCegarLoop]: Abstraction has 774 states and 1041 transitions. [2018-02-04 01:54:58,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 01:54:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2018-02-04 01:54:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 01:54:58,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:54:58,584 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 01:54:58,584 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:54:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash -289048753, now seen corresponding path program 53 times [2018-02-04 01:54:58,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:54:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:54:58,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:54:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:59,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:54:59,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 01:54:59,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:54:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:59,410 INFO L182 omatonBuilderFactory]: Interpolants [49408#(<= main_~i~0 36), 49409#(<= main_~i~0 37), 49410#(<= main_~i~0 38), 49411#(<= main_~i~0 39), 49412#(<= main_~i~0 40), 49413#(<= main_~i~0 41), 49414#(<= main_~i~0 42), 49415#(<= main_~i~0 43), 49416#(<= main_~i~0 44), 49417#(<= main_~i~0 45), 49418#(<= main_~i~0 46), 49419#(<= main_~i~0 47), 49420#(<= main_~i~0 48), 49421#(<= main_~i~0 49), 49422#(<= main_~i~0 50), 49423#(<= main_~i~0 51), 49424#(<= main_~i~0 52), 49425#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 49426#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 49370#true, 49371#false, 49372#(<= main_~i~0 0), 49373#(<= main_~i~0 1), 49374#(<= main_~i~0 2), 49375#(<= main_~i~0 3), 49376#(<= main_~i~0 4), 49377#(<= main_~i~0 5), 49378#(<= main_~i~0 6), 49379#(<= main_~i~0 7), 49380#(<= main_~i~0 8), 49381#(<= main_~i~0 9), 49382#(<= main_~i~0 10), 49383#(<= main_~i~0 11), 49384#(<= main_~i~0 12), 49385#(<= main_~i~0 13), 49386#(<= main_~i~0 14), 49387#(<= main_~i~0 15), 49388#(<= main_~i~0 16), 49389#(<= main_~i~0 17), 49390#(<= main_~i~0 18), 49391#(<= main_~i~0 19), 49392#(<= main_~i~0 20), 49393#(<= main_~i~0 21), 49394#(<= main_~i~0 22), 49395#(<= main_~i~0 23), 49396#(<= main_~i~0 24), 49397#(<= main_~i~0 25), 49398#(<= main_~i~0 26), 49399#(<= main_~i~0 27), 49400#(<= main_~i~0 28), 49401#(<= main_~i~0 29), 49402#(<= main_~i~0 30), 49403#(<= main_~i~0 31), 49404#(<= main_~i~0 32), 49405#(<= main_~i~0 33), 49406#(<= main_~i~0 34), 49407#(<= main_~i~0 35)] [2018-02-04 01:54:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:54:59,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 01:54:59,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 01:54:59,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 01:54:59,411 INFO L87 Difference]: Start difference. First operand 774 states and 1041 transitions. Second operand 57 states. [2018-02-04 01:55:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:01,550 INFO L93 Difference]: Finished difference Result 846 states and 1120 transitions. [2018-02-04 01:55:01,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 01:55:01,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 273 [2018-02-04 01:55:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:01,552 INFO L225 Difference]: With dead ends: 846 [2018-02-04 01:55:01,552 INFO L226 Difference]: Without dead ends: 846 [2018-02-04 01:55:01,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 01:55:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-02-04 01:55:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 788. [2018-02-04 01:55:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-02-04 01:55:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1060 transitions. [2018-02-04 01:55:01,558 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1060 transitions. Word has length 273 [2018-02-04 01:55:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:01,558 INFO L432 AbstractCegarLoop]: Abstraction has 788 states and 1060 transitions. [2018-02-04 01:55:01,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 01:55:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1060 transitions. [2018-02-04 01:55:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-02-04 01:55:01,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:01,560 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:01,560 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash 523735741, now seen corresponding path program 54 times [2018-02-04 01:55:01,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:01,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:02,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:02,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 01:55:02,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:02,671 INFO L182 omatonBuilderFactory]: Interpolants [51200#(<= main_~i~0 31), 51201#(<= main_~i~0 32), 51202#(<= main_~i~0 33), 51203#(<= main_~i~0 34), 51204#(<= main_~i~0 35), 51205#(<= main_~i~0 36), 51206#(<= main_~i~0 37), 51207#(<= main_~i~0 38), 51208#(<= main_~i~0 39), 51209#(<= main_~i~0 40), 51210#(<= main_~i~0 41), 51211#(<= main_~i~0 42), 51212#(<= main_~i~0 43), 51213#(<= main_~i~0 44), 51214#(<= main_~i~0 45), 51215#(<= main_~i~0 46), 51216#(<= main_~i~0 47), 51217#(<= main_~i~0 48), 51218#(<= main_~i~0 49), 51219#(<= main_~i~0 50), 51220#(<= main_~i~0 51), 51221#(<= main_~i~0 52), 51222#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 51223#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 51224#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 51167#true, 51168#false, 51169#(<= main_~i~0 0), 51170#(<= main_~i~0 1), 51171#(<= main_~i~0 2), 51172#(<= main_~i~0 3), 51173#(<= main_~i~0 4), 51174#(<= main_~i~0 5), 51175#(<= main_~i~0 6), 51176#(<= main_~i~0 7), 51177#(<= main_~i~0 8), 51178#(<= main_~i~0 9), 51179#(<= main_~i~0 10), 51180#(<= main_~i~0 11), 51181#(<= main_~i~0 12), 51182#(<= main_~i~0 13), 51183#(<= main_~i~0 14), 51184#(<= main_~i~0 15), 51185#(<= main_~i~0 16), 51186#(<= main_~i~0 17), 51187#(<= main_~i~0 18), 51188#(<= main_~i~0 19), 51189#(<= main_~i~0 20), 51190#(<= main_~i~0 21), 51191#(<= main_~i~0 22), 51192#(<= main_~i~0 23), 51193#(<= main_~i~0 24), 51194#(<= main_~i~0 25), 51195#(<= main_~i~0 26), 51196#(<= main_~i~0 27), 51197#(<= main_~i~0 28), 51198#(<= main_~i~0 29), 51199#(<= main_~i~0 30)] [2018-02-04 01:55:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:02,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 01:55:02,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 01:55:02,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:55:02,672 INFO L87 Difference]: Start difference. First operand 788 states and 1060 transitions. Second operand 58 states. [2018-02-04 01:55:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:05,036 INFO L93 Difference]: Finished difference Result 861 states and 1140 transitions. [2018-02-04 01:55:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 01:55:05,036 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 278 [2018-02-04 01:55:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:05,038 INFO L225 Difference]: With dead ends: 861 [2018-02-04 01:55:05,038 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 01:55:05,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 01:55:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 01:55:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 802. [2018-02-04 01:55:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-02-04 01:55:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1079 transitions. [2018-02-04 01:55:05,044 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1079 transitions. Word has length 278 [2018-02-04 01:55:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:05,044 INFO L432 AbstractCegarLoop]: Abstraction has 802 states and 1079 transitions. [2018-02-04 01:55:05,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 01:55:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1079 transitions. [2018-02-04 01:55:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-02-04 01:55:05,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:05,045 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:05,045 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:05,045 INFO L82 PathProgramCache]: Analyzing trace with hash 882076687, now seen corresponding path program 55 times [2018-02-04 01:55:05,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:05,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:05,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:05,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 01:55:05,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:05,974 INFO L182 omatonBuilderFactory]: Interpolants [52996#true, 52997#false, 52998#(<= main_~i~0 0), 52999#(<= main_~i~0 1), 53000#(<= main_~i~0 2), 53001#(<= main_~i~0 3), 53002#(<= main_~i~0 4), 53003#(<= main_~i~0 5), 53004#(<= main_~i~0 6), 53005#(<= main_~i~0 7), 53006#(<= main_~i~0 8), 53007#(<= main_~i~0 9), 53008#(<= main_~i~0 10), 53009#(<= main_~i~0 11), 53010#(<= main_~i~0 12), 53011#(<= main_~i~0 13), 53012#(<= main_~i~0 14), 53013#(<= main_~i~0 15), 53014#(<= main_~i~0 16), 53015#(<= main_~i~0 17), 53016#(<= main_~i~0 18), 53017#(<= main_~i~0 19), 53018#(<= main_~i~0 20), 53019#(<= main_~i~0 21), 53020#(<= main_~i~0 22), 53021#(<= main_~i~0 23), 53022#(<= main_~i~0 24), 53023#(<= main_~i~0 25), 53024#(<= main_~i~0 26), 53025#(<= main_~i~0 27), 53026#(<= main_~i~0 28), 53027#(<= main_~i~0 29), 53028#(<= main_~i~0 30), 53029#(<= main_~i~0 31), 53030#(<= main_~i~0 32), 53031#(<= main_~i~0 33), 53032#(<= main_~i~0 34), 53033#(<= main_~i~0 35), 53034#(<= main_~i~0 36), 53035#(<= main_~i~0 37), 53036#(<= main_~i~0 38), 53037#(<= main_~i~0 39), 53038#(<= main_~i~0 40), 53039#(<= main_~i~0 41), 53040#(<= main_~i~0 42), 53041#(<= main_~i~0 43), 53042#(<= main_~i~0 44), 53043#(<= main_~i~0 45), 53044#(<= main_~i~0 46), 53045#(<= main_~i~0 47), 53046#(<= main_~i~0 48), 53047#(<= main_~i~0 49), 53048#(<= main_~i~0 50), 53049#(<= main_~i~0 51), 53050#(<= main_~i~0 52), 53051#(<= main_~i~0 53), 53052#(<= main_~i~0 54), 53053#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 53054#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-02-04 01:55:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:05,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 01:55:05,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 01:55:05,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 01:55:05,975 INFO L87 Difference]: Start difference. First operand 802 states and 1079 transitions. Second operand 59 states. [2018-02-04 01:55:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:08,455 INFO L93 Difference]: Finished difference Result 876 states and 1160 transitions. [2018-02-04 01:55:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 01:55:08,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 283 [2018-02-04 01:55:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:08,457 INFO L225 Difference]: With dead ends: 876 [2018-02-04 01:55:08,457 INFO L226 Difference]: Without dead ends: 876 [2018-02-04 01:55:08,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 01:55:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-02-04 01:55:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 816. [2018-02-04 01:55:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-02-04 01:55:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1098 transitions. [2018-02-04 01:55:08,463 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1098 transitions. Word has length 283 [2018-02-04 01:55:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:08,463 INFO L432 AbstractCegarLoop]: Abstraction has 816 states and 1098 transitions. [2018-02-04 01:55:08,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 01:55:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1098 transitions. [2018-02-04 01:55:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-04 01:55:08,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:08,464 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:08,464 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash 396662269, now seen corresponding path program 56 times [2018-02-04 01:55:08,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:08,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:09,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:09,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 01:55:09,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:09,362 INFO L182 omatonBuilderFactory]: Interpolants [54912#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 54913#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 54914#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 54915#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 54916#(and (<= main_~i~0 56) (<= 8 main_~i~0)), 54857#true, 54858#false, 54859#(<= main_~i~0 0), 54860#(<= main_~i~0 1), 54861#(<= main_~i~0 2), 54862#(<= main_~i~0 3), 54863#(<= main_~i~0 4), 54864#(<= main_~i~0 5), 54865#(<= main_~i~0 6), 54866#(<= main_~i~0 7), 54867#(<= main_~i~0 8), 54868#(<= main_~i~0 9), 54869#(<= main_~i~0 10), 54870#(<= main_~i~0 11), 54871#(<= main_~i~0 12), 54872#(<= main_~i~0 13), 54873#(<= main_~i~0 14), 54874#(<= main_~i~0 15), 54875#(<= main_~i~0 16), 54876#(<= main_~i~0 17), 54877#(<= main_~i~0 18), 54878#(<= main_~i~0 19), 54879#(<= main_~i~0 20), 54880#(<= main_~i~0 21), 54881#(<= main_~i~0 22), 54882#(<= main_~i~0 23), 54883#(<= main_~i~0 24), 54884#(<= main_~i~0 25), 54885#(<= main_~i~0 26), 54886#(<= main_~i~0 27), 54887#(<= main_~i~0 28), 54888#(<= main_~i~0 29), 54889#(<= main_~i~0 30), 54890#(<= main_~i~0 31), 54891#(<= main_~i~0 32), 54892#(<= main_~i~0 33), 54893#(<= main_~i~0 34), 54894#(<= main_~i~0 35), 54895#(<= main_~i~0 36), 54896#(<= main_~i~0 37), 54897#(<= main_~i~0 38), 54898#(<= main_~i~0 39), 54899#(<= main_~i~0 40), 54900#(<= main_~i~0 41), 54901#(<= main_~i~0 42), 54902#(<= main_~i~0 43), 54903#(<= main_~i~0 44), 54904#(<= main_~i~0 45), 54905#(<= main_~i~0 46), 54906#(<= main_~i~0 47), 54907#(<= main_~i~0 48), 54908#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 54909#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 54910#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 54911#(and (<= main_~i~0 51) (<= 3 main_~i~0))] [2018-02-04 01:55:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:09,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 01:55:09,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 01:55:09,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 01:55:09,363 INFO L87 Difference]: Start difference. First operand 816 states and 1098 transitions. Second operand 60 states. [2018-02-04 01:55:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:12,835 INFO L93 Difference]: Finished difference Result 891 states and 1180 transitions. [2018-02-04 01:55:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 01:55:12,835 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 288 [2018-02-04 01:55:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:12,837 INFO L225 Difference]: With dead ends: 891 [2018-02-04 01:55:12,837 INFO L226 Difference]: Without dead ends: 891 [2018-02-04 01:55:12,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 01:55:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-02-04 01:55:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 830. [2018-02-04 01:55:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-02-04 01:55:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1117 transitions. [2018-02-04 01:55:12,843 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1117 transitions. Word has length 288 [2018-02-04 01:55:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:12,843 INFO L432 AbstractCegarLoop]: Abstraction has 830 states and 1117 transitions. [2018-02-04 01:55:12,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 01:55:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1117 transitions. [2018-02-04 01:55:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 01:55:12,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:12,845 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:12,845 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 67530959, now seen corresponding path program 57 times [2018-02-04 01:55:12,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:12,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:13,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:13,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 01:55:13,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:13,811 INFO L182 omatonBuilderFactory]: Interpolants [56750#true, 56751#false, 56752#(<= main_~i~0 0), 56753#(<= main_~i~0 1), 56754#(<= main_~i~0 2), 56755#(<= main_~i~0 3), 56756#(<= main_~i~0 4), 56757#(<= main_~i~0 5), 56758#(<= main_~i~0 6), 56759#(<= main_~i~0 7), 56760#(<= main_~i~0 8), 56761#(<= main_~i~0 9), 56762#(<= main_~i~0 10), 56763#(<= main_~i~0 11), 56764#(<= main_~i~0 12), 56765#(<= main_~i~0 13), 56766#(<= main_~i~0 14), 56767#(<= main_~i~0 15), 56768#(<= main_~i~0 16), 56769#(<= main_~i~0 17), 56770#(<= main_~i~0 18), 56771#(<= main_~i~0 19), 56772#(<= main_~i~0 20), 56773#(<= main_~i~0 21), 56774#(<= main_~i~0 22), 56775#(<= main_~i~0 23), 56776#(<= main_~i~0 24), 56777#(<= main_~i~0 25), 56778#(<= main_~i~0 26), 56779#(<= main_~i~0 27), 56780#(<= main_~i~0 28), 56781#(<= main_~i~0 29), 56782#(<= main_~i~0 30), 56783#(<= main_~i~0 31), 56784#(<= main_~i~0 32), 56785#(<= main_~i~0 33), 56786#(<= main_~i~0 34), 56787#(<= main_~i~0 35), 56788#(<= main_~i~0 36), 56789#(<= main_~i~0 37), 56790#(<= main_~i~0 38), 56791#(<= main_~i~0 39), 56792#(<= main_~i~0 40), 56793#(<= main_~i~0 41), 56794#(<= main_~i~0 42), 56795#(<= main_~i~0 43), 56796#(<= main_~i~0 44), 56797#(<= main_~i~0 45), 56798#(<= main_~i~0 46), 56799#(<= main_~i~0 47), 56800#(<= main_~i~0 48), 56801#(<= main_~i~0 49), 56802#(<= main_~i~0 50), 56803#(<= main_~i~0 51), 56804#(<= main_~i~0 52), 56805#(<= main_~i~0 53), 56806#(<= main_~i~0 54), 56807#(<= main_~i~0 55), 56808#(<= main_~i~0 56), 56809#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 56810#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-02-04 01:55:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:13,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 01:55:13,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 01:55:13,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 01:55:13,812 INFO L87 Difference]: Start difference. First operand 830 states and 1117 transitions. Second operand 61 states. [2018-02-04 01:55:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:16,463 INFO L93 Difference]: Finished difference Result 906 states and 1200 transitions. [2018-02-04 01:55:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 01:55:16,463 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 293 [2018-02-04 01:55:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:16,465 INFO L225 Difference]: With dead ends: 906 [2018-02-04 01:55:16,465 INFO L226 Difference]: Without dead ends: 906 [2018-02-04 01:55:16,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 01:55:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-02-04 01:55:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 844. [2018-02-04 01:55:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-02-04 01:55:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1136 transitions. [2018-02-04 01:55:16,472 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1136 transitions. Word has length 293 [2018-02-04 01:55:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:16,472 INFO L432 AbstractCegarLoop]: Abstraction has 844 states and 1136 transitions. [2018-02-04 01:55:16,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 01:55:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1136 transitions. [2018-02-04 01:55:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-04 01:55:16,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:16,474 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:16,474 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 320244029, now seen corresponding path program 58 times [2018-02-04 01:55:16,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:16,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:17,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:17,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 01:55:17,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:17,503 INFO L182 omatonBuilderFactory]: Interpolants [58675#true, 58676#false, 58677#(<= main_~i~0 0), 58678#(<= main_~i~0 1), 58679#(<= main_~i~0 2), 58680#(<= main_~i~0 3), 58681#(<= main_~i~0 4), 58682#(<= main_~i~0 5), 58683#(<= main_~i~0 6), 58684#(<= main_~i~0 7), 58685#(<= main_~i~0 8), 58686#(<= main_~i~0 9), 58687#(<= main_~i~0 10), 58688#(<= main_~i~0 11), 58689#(<= main_~i~0 12), 58690#(<= main_~i~0 13), 58691#(<= main_~i~0 14), 58692#(<= main_~i~0 15), 58693#(<= main_~i~0 16), 58694#(<= main_~i~0 17), 58695#(<= main_~i~0 18), 58696#(<= main_~i~0 19), 58697#(<= main_~i~0 20), 58698#(<= main_~i~0 21), 58699#(<= main_~i~0 22), 58700#(<= main_~i~0 23), 58701#(<= main_~i~0 24), 58702#(<= main_~i~0 25), 58703#(<= main_~i~0 26), 58704#(<= main_~i~0 27), 58705#(<= main_~i~0 28), 58706#(<= main_~i~0 29), 58707#(<= main_~i~0 30), 58708#(<= main_~i~0 31), 58709#(<= main_~i~0 32), 58710#(<= main_~i~0 33), 58711#(<= main_~i~0 34), 58712#(<= main_~i~0 35), 58713#(<= main_~i~0 36), 58714#(<= main_~i~0 37), 58715#(<= main_~i~0 38), 58716#(<= main_~i~0 39), 58717#(<= main_~i~0 40), 58718#(<= main_~i~0 41), 58719#(<= main_~i~0 42), 58720#(<= main_~i~0 43), 58721#(<= main_~i~0 44), 58722#(<= main_~i~0 45), 58723#(<= main_~i~0 46), 58724#(<= main_~i~0 47), 58725#(<= main_~i~0 48), 58726#(<= main_~i~0 49), 58727#(<= main_~i~0 50), 58728#(<= main_~i~0 51), 58729#(<= main_~i~0 52), 58730#(<= main_~i~0 53), 58731#(<= main_~i~0 54), 58732#(<= main_~i~0 55), 58733#(<= main_~i~0 56), 58734#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 58735#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 58736#(and (<= 2 main_~i~0) (<= main_~i~0 58))] [2018-02-04 01:55:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:17,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 01:55:17,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 01:55:17,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 01:55:17,504 INFO L87 Difference]: Start difference. First operand 844 states and 1136 transitions. Second operand 62 states. [2018-02-04 01:55:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:20,332 INFO L93 Difference]: Finished difference Result 921 states and 1220 transitions. [2018-02-04 01:55:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 01:55:20,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 298 [2018-02-04 01:55:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:20,333 INFO L225 Difference]: With dead ends: 921 [2018-02-04 01:55:20,334 INFO L226 Difference]: Without dead ends: 921 [2018-02-04 01:55:20,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 01:55:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-02-04 01:55:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 858. [2018-02-04 01:55:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-02-04 01:55:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1155 transitions. [2018-02-04 01:55:20,339 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1155 transitions. Word has length 298 [2018-02-04 01:55:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:20,339 INFO L432 AbstractCegarLoop]: Abstraction has 858 states and 1155 transitions. [2018-02-04 01:55:20,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 01:55:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1155 transitions. [2018-02-04 01:55:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-04 01:55:20,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:20,341 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:20,341 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1643477617, now seen corresponding path program 59 times [2018-02-04 01:55:20,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:20,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:21,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:21,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 01:55:21,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:21,367 INFO L182 omatonBuilderFactory]: Interpolants [60672#(<= main_~i~0 38), 60673#(<= main_~i~0 39), 60674#(<= main_~i~0 40), 60675#(<= main_~i~0 41), 60676#(<= main_~i~0 42), 60677#(<= main_~i~0 43), 60678#(<= main_~i~0 44), 60679#(<= main_~i~0 45), 60680#(<= main_~i~0 46), 60681#(<= main_~i~0 47), 60682#(<= main_~i~0 48), 60683#(<= main_~i~0 49), 60684#(<= main_~i~0 50), 60685#(<= main_~i~0 51), 60686#(<= main_~i~0 52), 60687#(<= main_~i~0 53), 60688#(<= main_~i~0 54), 60689#(<= main_~i~0 55), 60690#(<= main_~i~0 56), 60691#(<= main_~i~0 57), 60692#(<= main_~i~0 58), 60693#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 60694#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 60632#true, 60633#false, 60634#(<= main_~i~0 0), 60635#(<= main_~i~0 1), 60636#(<= main_~i~0 2), 60637#(<= main_~i~0 3), 60638#(<= main_~i~0 4), 60639#(<= main_~i~0 5), 60640#(<= main_~i~0 6), 60641#(<= main_~i~0 7), 60642#(<= main_~i~0 8), 60643#(<= main_~i~0 9), 60644#(<= main_~i~0 10), 60645#(<= main_~i~0 11), 60646#(<= main_~i~0 12), 60647#(<= main_~i~0 13), 60648#(<= main_~i~0 14), 60649#(<= main_~i~0 15), 60650#(<= main_~i~0 16), 60651#(<= main_~i~0 17), 60652#(<= main_~i~0 18), 60653#(<= main_~i~0 19), 60654#(<= main_~i~0 20), 60655#(<= main_~i~0 21), 60656#(<= main_~i~0 22), 60657#(<= main_~i~0 23), 60658#(<= main_~i~0 24), 60659#(<= main_~i~0 25), 60660#(<= main_~i~0 26), 60661#(<= main_~i~0 27), 60662#(<= main_~i~0 28), 60663#(<= main_~i~0 29), 60664#(<= main_~i~0 30), 60665#(<= main_~i~0 31), 60666#(<= main_~i~0 32), 60667#(<= main_~i~0 33), 60668#(<= main_~i~0 34), 60669#(<= main_~i~0 35), 60670#(<= main_~i~0 36), 60671#(<= main_~i~0 37)] [2018-02-04 01:55:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:21,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 01:55:21,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 01:55:21,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 01:55:21,368 INFO L87 Difference]: Start difference. First operand 858 states and 1155 transitions. Second operand 63 states. [2018-02-04 01:55:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:23,772 INFO L93 Difference]: Finished difference Result 936 states and 1240 transitions. [2018-02-04 01:55:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 01:55:23,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 303 [2018-02-04 01:55:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:23,774 INFO L225 Difference]: With dead ends: 936 [2018-02-04 01:55:23,774 INFO L226 Difference]: Without dead ends: 936 [2018-02-04 01:55:23,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 01:55:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-02-04 01:55:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 872. [2018-02-04 01:55:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-02-04 01:55:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1174 transitions. [2018-02-04 01:55:23,781 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1174 transitions. Word has length 303 [2018-02-04 01:55:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:23,781 INFO L432 AbstractCegarLoop]: Abstraction has 872 states and 1174 transitions. [2018-02-04 01:55:23,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 01:55:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1174 transitions. [2018-02-04 01:55:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-02-04 01:55:23,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:23,782 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:23,783 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2078184323, now seen corresponding path program 60 times [2018-02-04 01:55:23,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:23,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:24,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:24,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 01:55:24,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:24,895 INFO L182 omatonBuilderFactory]: Interpolants [62621#true, 62622#false, 62623#(<= main_~i~0 0), 62624#(<= main_~i~0 1), 62625#(<= main_~i~0 2), 62626#(<= main_~i~0 3), 62627#(<= main_~i~0 4), 62628#(<= main_~i~0 5), 62629#(<= main_~i~0 6), 62630#(<= main_~i~0 7), 62631#(<= main_~i~0 8), 62632#(<= main_~i~0 9), 62633#(<= main_~i~0 10), 62634#(<= main_~i~0 11), 62635#(<= main_~i~0 12), 62636#(<= main_~i~0 13), 62637#(<= main_~i~0 14), 62638#(<= main_~i~0 15), 62639#(<= main_~i~0 16), 62640#(<= main_~i~0 17), 62641#(<= main_~i~0 18), 62642#(<= main_~i~0 19), 62643#(<= main_~i~0 20), 62644#(<= main_~i~0 21), 62645#(<= main_~i~0 22), 62646#(<= main_~i~0 23), 62647#(<= main_~i~0 24), 62648#(<= main_~i~0 25), 62649#(<= main_~i~0 26), 62650#(<= main_~i~0 27), 62651#(<= main_~i~0 28), 62652#(<= main_~i~0 29), 62653#(<= main_~i~0 30), 62654#(<= main_~i~0 31), 62655#(<= main_~i~0 32), 62656#(<= main_~i~0 33), 62657#(<= main_~i~0 34), 62658#(<= main_~i~0 35), 62659#(<= main_~i~0 36), 62660#(<= main_~i~0 37), 62661#(<= main_~i~0 38), 62662#(<= main_~i~0 39), 62663#(<= main_~i~0 40), 62664#(<= main_~i~0 41), 62665#(<= main_~i~0 42), 62666#(<= main_~i~0 43), 62667#(<= main_~i~0 44), 62668#(<= main_~i~0 45), 62669#(<= main_~i~0 46), 62670#(<= main_~i~0 47), 62671#(<= main_~i~0 48), 62672#(<= main_~i~0 49), 62673#(<= main_~i~0 50), 62674#(<= main_~i~0 51), 62675#(<= main_~i~0 52), 62676#(<= main_~i~0 53), 62677#(<= main_~i~0 54), 62678#(<= main_~i~0 55), 62679#(<= main_~i~0 56), 62680#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 62681#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 62682#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 62683#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 62684#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-02-04 01:55:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:24,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 01:55:24,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 01:55:24,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 01:55:24,896 INFO L87 Difference]: Start difference. First operand 872 states and 1174 transitions. Second operand 64 states. [2018-02-04 01:55:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:28,089 INFO L93 Difference]: Finished difference Result 951 states and 1260 transitions. [2018-02-04 01:55:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 01:55:28,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 308 [2018-02-04 01:55:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:28,091 INFO L225 Difference]: With dead ends: 951 [2018-02-04 01:55:28,091 INFO L226 Difference]: Without dead ends: 951 [2018-02-04 01:55:28,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 01:55:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-02-04 01:55:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 886. [2018-02-04 01:55:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-02-04 01:55:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1193 transitions. [2018-02-04 01:55:28,097 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1193 transitions. Word has length 308 [2018-02-04 01:55:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:28,097 INFO L432 AbstractCegarLoop]: Abstraction has 886 states and 1193 transitions. [2018-02-04 01:55:28,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 01:55:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1193 transitions. [2018-02-04 01:55:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-02-04 01:55:28,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:28,098 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:28,098 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 210479695, now seen corresponding path program 61 times [2018-02-04 01:55:28,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:28,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:29,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:29,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 01:55:29,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:29,196 INFO L182 omatonBuilderFactory]: Interpolants [64642#true, 64643#false, 64644#(<= main_~i~0 0), 64645#(<= main_~i~0 1), 64646#(<= main_~i~0 2), 64647#(<= main_~i~0 3), 64648#(<= main_~i~0 4), 64649#(<= main_~i~0 5), 64650#(<= main_~i~0 6), 64651#(<= main_~i~0 7), 64652#(<= main_~i~0 8), 64653#(<= main_~i~0 9), 64654#(<= main_~i~0 10), 64655#(<= main_~i~0 11), 64656#(<= main_~i~0 12), 64657#(<= main_~i~0 13), 64658#(<= main_~i~0 14), 64659#(<= main_~i~0 15), 64660#(<= main_~i~0 16), 64661#(<= main_~i~0 17), 64662#(<= main_~i~0 18), 64663#(<= main_~i~0 19), 64664#(<= main_~i~0 20), 64665#(<= main_~i~0 21), 64666#(<= main_~i~0 22), 64667#(<= main_~i~0 23), 64668#(<= main_~i~0 24), 64669#(<= main_~i~0 25), 64670#(<= main_~i~0 26), 64671#(<= main_~i~0 27), 64672#(<= main_~i~0 28), 64673#(<= main_~i~0 29), 64674#(<= main_~i~0 30), 64675#(<= main_~i~0 31), 64676#(<= main_~i~0 32), 64677#(<= main_~i~0 33), 64678#(<= main_~i~0 34), 64679#(<= main_~i~0 35), 64680#(<= main_~i~0 36), 64681#(<= main_~i~0 37), 64682#(<= main_~i~0 38), 64683#(<= main_~i~0 39), 64684#(<= main_~i~0 40), 64685#(<= main_~i~0 41), 64686#(<= main_~i~0 42), 64687#(<= main_~i~0 43), 64688#(<= main_~i~0 44), 64689#(<= main_~i~0 45), 64690#(<= main_~i~0 46), 64691#(<= main_~i~0 47), 64692#(<= main_~i~0 48), 64693#(<= main_~i~0 49), 64694#(<= main_~i~0 50), 64695#(<= main_~i~0 51), 64696#(<= main_~i~0 52), 64697#(<= main_~i~0 53), 64698#(<= main_~i~0 54), 64699#(<= main_~i~0 55), 64700#(<= main_~i~0 56), 64701#(<= main_~i~0 57), 64702#(<= main_~i~0 58), 64703#(<= main_~i~0 59), 64704#(<= main_~i~0 60), 64705#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 64706#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-02-04 01:55:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:29,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 01:55:29,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 01:55:29,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 01:55:29,197 INFO L87 Difference]: Start difference. First operand 886 states and 1193 transitions. Second operand 65 states. [2018-02-04 01:55:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:32,165 INFO L93 Difference]: Finished difference Result 966 states and 1280 transitions. [2018-02-04 01:55:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 01:55:32,166 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 313 [2018-02-04 01:55:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:32,167 INFO L225 Difference]: With dead ends: 966 [2018-02-04 01:55:32,167 INFO L226 Difference]: Without dead ends: 966 [2018-02-04 01:55:32,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 01:55:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-02-04 01:55:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 900. [2018-02-04 01:55:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-02-04 01:55:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1212 transitions. [2018-02-04 01:55:32,173 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1212 transitions. Word has length 313 [2018-02-04 01:55:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:32,173 INFO L432 AbstractCegarLoop]: Abstraction has 900 states and 1212 transitions. [2018-02-04 01:55:32,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 01:55:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1212 transitions. [2018-02-04 01:55:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-02-04 01:55:32,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:32,175 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:32,175 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1269219395, now seen corresponding path program 62 times [2018-02-04 01:55:32,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:32,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:33,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:33,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 01:55:33,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:33,301 INFO L182 omatonBuilderFactory]: Interpolants [66695#true, 66697#(<= main_~i~0 0), 66696#false, 66699#(<= main_~i~0 2), 66698#(<= main_~i~0 1), 66701#(<= main_~i~0 4), 66700#(<= main_~i~0 3), 66703#(<= main_~i~0 6), 66702#(<= main_~i~0 5), 66705#(<= main_~i~0 8), 66704#(<= main_~i~0 7), 66707#(<= main_~i~0 10), 66706#(<= main_~i~0 9), 66709#(<= main_~i~0 12), 66708#(<= main_~i~0 11), 66711#(<= main_~i~0 14), 66710#(<= main_~i~0 13), 66713#(<= main_~i~0 16), 66712#(<= main_~i~0 15), 66715#(<= main_~i~0 18), 66714#(<= main_~i~0 17), 66717#(<= main_~i~0 20), 66716#(<= main_~i~0 19), 66719#(<= main_~i~0 22), 66718#(<= main_~i~0 21), 66721#(<= main_~i~0 24), 66720#(<= main_~i~0 23), 66723#(<= main_~i~0 26), 66722#(<= main_~i~0 25), 66725#(<= main_~i~0 28), 66724#(<= main_~i~0 27), 66727#(<= main_~i~0 30), 66726#(<= main_~i~0 29), 66729#(<= main_~i~0 32), 66728#(<= main_~i~0 31), 66731#(<= main_~i~0 34), 66730#(<= main_~i~0 33), 66733#(<= main_~i~0 36), 66732#(<= main_~i~0 35), 66735#(<= main_~i~0 38), 66734#(<= main_~i~0 37), 66737#(<= main_~i~0 40), 66736#(<= main_~i~0 39), 66739#(<= main_~i~0 42), 66738#(<= main_~i~0 41), 66741#(<= main_~i~0 44), 66740#(<= main_~i~0 43), 66743#(<= main_~i~0 46), 66742#(<= main_~i~0 45), 66745#(<= main_~i~0 48), 66744#(<= main_~i~0 47), 66747#(<= main_~i~0 50), 66746#(<= main_~i~0 49), 66749#(<= main_~i~0 52), 66748#(<= main_~i~0 51), 66751#(<= main_~i~0 54), 66750#(<= main_~i~0 53), 66753#(<= main_~i~0 56), 66752#(<= main_~i~0 55), 66755#(<= main_~i~0 58), 66754#(<= main_~i~0 57), 66757#(<= main_~i~0 60), 66756#(<= main_~i~0 59), 66759#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 66758#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 66760#(and (<= 2 main_~i~0) (<= main_~i~0 62))] [2018-02-04 01:55:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:33,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 01:55:33,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 01:55:33,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 01:55:33,302 INFO L87 Difference]: Start difference. First operand 900 states and 1212 transitions. Second operand 66 states. [2018-02-04 01:55:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:36,064 INFO L93 Difference]: Finished difference Result 981 states and 1300 transitions. [2018-02-04 01:55:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 01:55:36,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 318 [2018-02-04 01:55:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:36,065 INFO L225 Difference]: With dead ends: 981 [2018-02-04 01:55:36,065 INFO L226 Difference]: Without dead ends: 981 [2018-02-04 01:55:36,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 01:55:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-02-04 01:55:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 914. [2018-02-04 01:55:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-02-04 01:55:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1231 transitions. [2018-02-04 01:55:36,072 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1231 transitions. Word has length 318 [2018-02-04 01:55:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:36,072 INFO L432 AbstractCegarLoop]: Abstraction has 914 states and 1231 transitions. [2018-02-04 01:55:36,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 01:55:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1231 transitions. [2018-02-04 01:55:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-02-04 01:55:36,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:36,073 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:36,073 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash -495591665, now seen corresponding path program 63 times [2018-02-04 01:55:36,074 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:36,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:37,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:37,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 01:55:37,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:37,297 INFO L182 omatonBuilderFactory]: Interpolants [68781#false, 68780#true, 68783#(<= main_~i~0 1), 68782#(<= main_~i~0 0), 68785#(<= main_~i~0 3), 68784#(<= main_~i~0 2), 68787#(<= main_~i~0 5), 68786#(<= main_~i~0 4), 68789#(<= main_~i~0 7), 68788#(<= main_~i~0 6), 68791#(<= main_~i~0 9), 68790#(<= main_~i~0 8), 68793#(<= main_~i~0 11), 68792#(<= main_~i~0 10), 68795#(<= main_~i~0 13), 68794#(<= main_~i~0 12), 68797#(<= main_~i~0 15), 68796#(<= main_~i~0 14), 68799#(<= main_~i~0 17), 68798#(<= main_~i~0 16), 68801#(<= main_~i~0 19), 68800#(<= main_~i~0 18), 68803#(<= main_~i~0 21), 68802#(<= main_~i~0 20), 68805#(<= main_~i~0 23), 68804#(<= main_~i~0 22), 68807#(<= main_~i~0 25), 68806#(<= main_~i~0 24), 68809#(<= main_~i~0 27), 68808#(<= main_~i~0 26), 68811#(<= main_~i~0 29), 68810#(<= main_~i~0 28), 68813#(<= main_~i~0 31), 68812#(<= main_~i~0 30), 68815#(<= main_~i~0 33), 68814#(<= main_~i~0 32), 68817#(<= main_~i~0 35), 68816#(<= main_~i~0 34), 68819#(<= main_~i~0 37), 68818#(<= main_~i~0 36), 68821#(<= main_~i~0 39), 68820#(<= main_~i~0 38), 68823#(<= main_~i~0 41), 68822#(<= main_~i~0 40), 68825#(<= main_~i~0 43), 68824#(<= main_~i~0 42), 68827#(<= main_~i~0 45), 68826#(<= main_~i~0 44), 68829#(<= main_~i~0 47), 68828#(<= main_~i~0 46), 68831#(<= main_~i~0 49), 68830#(<= main_~i~0 48), 68833#(<= main_~i~0 51), 68832#(<= main_~i~0 50), 68835#(<= main_~i~0 53), 68834#(<= main_~i~0 52), 68837#(<= main_~i~0 55), 68836#(<= main_~i~0 54), 68839#(<= main_~i~0 57), 68838#(<= main_~i~0 56), 68841#(<= main_~i~0 59), 68840#(<= main_~i~0 58), 68843#(<= main_~i~0 61), 68842#(<= main_~i~0 60), 68845#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 68844#(<= main_~i~0 62), 68846#(and (<= 1 main_~i~0) (<= main_~i~0 63))] [2018-02-04 01:55:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:37,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 01:55:37,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 01:55:37,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 01:55:37,299 INFO L87 Difference]: Start difference. First operand 914 states and 1231 transitions. Second operand 67 states. [2018-02-04 01:55:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:40,097 INFO L93 Difference]: Finished difference Result 996 states and 1320 transitions. [2018-02-04 01:55:40,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 01:55:40,097 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 323 [2018-02-04 01:55:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:40,098 INFO L225 Difference]: With dead ends: 996 [2018-02-04 01:55:40,098 INFO L226 Difference]: Without dead ends: 996 [2018-02-04 01:55:40,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 01:55:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2018-02-04 01:55:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 928. [2018-02-04 01:55:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-02-04 01:55:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1250 transitions. [2018-02-04 01:55:40,106 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1250 transitions. Word has length 323 [2018-02-04 01:55:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:40,107 INFO L432 AbstractCegarLoop]: Abstraction has 928 states and 1250 transitions. [2018-02-04 01:55:40,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 01:55:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1250 transitions. [2018-02-04 01:55:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-02-04 01:55:40,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:40,109 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:40,109 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 72483581, now seen corresponding path program 64 times [2018-02-04 01:55:40,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:40,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:41,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:41,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 01:55:41,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:41,648 INFO L182 omatonBuilderFactory]: Interpolants [70913#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 70912#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 70915#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 70914#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 70917#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 70916#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 70919#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 70918#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 70921#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 70920#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 70923#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 70922#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 70925#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 70924#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 70927#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 70926#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 70929#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 70928#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 70931#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 70930#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 70933#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 70932#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 70935#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 70934#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 70937#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 70936#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 70939#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 70938#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 70941#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 70940#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 70943#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 70942#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 70945#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 70944#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 70947#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 70946#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 70949#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 70948#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 70951#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 70950#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 70953#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 70952#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 70955#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 70954#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 70957#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 70956#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 70959#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 70958#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 70961#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 70960#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 70963#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 70962#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 70897#true, 70899#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 70898#false, 70901#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 70900#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 70903#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 70902#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 70905#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 70904#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 70907#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 70906#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 70909#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 70908#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 70911#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 70910#(and (<= main_~i~0 11) (<= 11 main_~i~0))] [2018-02-04 01:55:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:41,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 01:55:41,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 01:55:41,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 01:55:41,649 INFO L87 Difference]: Start difference. First operand 928 states and 1250 transitions. Second operand 67 states. [2018-02-04 01:55:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:55:58,482 INFO L93 Difference]: Finished difference Result 1011 states and 1340 transitions. [2018-02-04 01:55:58,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 01:55:58,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2018-02-04 01:55:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:55:58,483 INFO L225 Difference]: With dead ends: 1011 [2018-02-04 01:55:58,483 INFO L226 Difference]: Without dead ends: 1011 [2018-02-04 01:55:58,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 01:55:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-02-04 01:55:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 942. [2018-02-04 01:55:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-02-04 01:55:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1269 transitions. [2018-02-04 01:55:58,492 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1269 transitions. Word has length 328 [2018-02-04 01:55:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:55:58,492 INFO L432 AbstractCegarLoop]: Abstraction has 942 states and 1269 transitions. [2018-02-04 01:55:58,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 01:55:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1269 transitions. [2018-02-04 01:55:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-04 01:55:58,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:55:58,494 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 01:55:58,494 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:55:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -72014897, now seen corresponding path program 65 times [2018-02-04 01:55:58,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:55:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:55:58,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:55:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:59,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:55:59,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 01:55:59,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:55:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:59,735 INFO L182 omatonBuilderFactory]: Interpolants [72961#(<= main_~i~0 42), 72960#(<= main_~i~0 41), 72963#(<= main_~i~0 44), 72962#(<= main_~i~0 43), 72965#(<= main_~i~0 46), 72964#(<= main_~i~0 45), 72967#(<= main_~i~0 48), 72966#(<= main_~i~0 47), 72969#(<= main_~i~0 50), 72968#(<= main_~i~0 49), 72971#(<= main_~i~0 52), 72970#(<= main_~i~0 51), 72973#(<= main_~i~0 54), 72972#(<= main_~i~0 53), 72975#(<= main_~i~0 56), 72974#(<= main_~i~0 55), 72977#(<= main_~i~0 58), 72976#(<= main_~i~0 57), 72979#(<= main_~i~0 60), 72978#(<= main_~i~0 59), 72981#(<= main_~i~0 62), 72980#(<= main_~i~0 61), 72983#(<= main_~i~0 64), 72982#(<= main_~i~0 63), 72985#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 72984#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 72917#true, 72919#(<= main_~i~0 0), 72918#false, 72921#(<= main_~i~0 2), 72920#(<= main_~i~0 1), 72923#(<= main_~i~0 4), 72922#(<= main_~i~0 3), 72925#(<= main_~i~0 6), 72924#(<= main_~i~0 5), 72927#(<= main_~i~0 8), 72926#(<= main_~i~0 7), 72929#(<= main_~i~0 10), 72928#(<= main_~i~0 9), 72931#(<= main_~i~0 12), 72930#(<= main_~i~0 11), 72933#(<= main_~i~0 14), 72932#(<= main_~i~0 13), 72935#(<= main_~i~0 16), 72934#(<= main_~i~0 15), 72937#(<= main_~i~0 18), 72936#(<= main_~i~0 17), 72939#(<= main_~i~0 20), 72938#(<= main_~i~0 19), 72941#(<= main_~i~0 22), 72940#(<= main_~i~0 21), 72943#(<= main_~i~0 24), 72942#(<= main_~i~0 23), 72945#(<= main_~i~0 26), 72944#(<= main_~i~0 25), 72947#(<= main_~i~0 28), 72946#(<= main_~i~0 27), 72949#(<= main_~i~0 30), 72948#(<= main_~i~0 29), 72951#(<= main_~i~0 32), 72950#(<= main_~i~0 31), 72953#(<= main_~i~0 34), 72952#(<= main_~i~0 33), 72955#(<= main_~i~0 36), 72954#(<= main_~i~0 35), 72957#(<= main_~i~0 38), 72956#(<= main_~i~0 37), 72959#(<= main_~i~0 40), 72958#(<= main_~i~0 39)] [2018-02-04 01:55:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:55:59,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 01:55:59,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 01:55:59,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 01:55:59,736 INFO L87 Difference]: Start difference. First operand 942 states and 1269 transitions. Second operand 69 states. [2018-02-04 01:56:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:02,836 INFO L93 Difference]: Finished difference Result 1026 states and 1360 transitions. [2018-02-04 01:56:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 01:56:02,836 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 333 [2018-02-04 01:56:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:02,838 INFO L225 Difference]: With dead ends: 1026 [2018-02-04 01:56:02,838 INFO L226 Difference]: Without dead ends: 1026 [2018-02-04 01:56:02,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 01:56:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-02-04 01:56:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 956. [2018-02-04 01:56:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-02-04 01:56:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1288 transitions. [2018-02-04 01:56:02,851 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1288 transitions. Word has length 333 [2018-02-04 01:56:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:02,851 INFO L432 AbstractCegarLoop]: Abstraction has 956 states and 1288 transitions. [2018-02-04 01:56:02,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 01:56:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1288 transitions. [2018-02-04 01:56:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-02-04 01:56:02,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:02,854 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:02,854 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 731887165, now seen corresponding path program 66 times [2018-02-04 01:56:02,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:02,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:04,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:04,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 01:56:04,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:04,190 INFO L182 omatonBuilderFactory]: Interpolants [75137#(<= main_~i~0 37), 75136#(<= main_~i~0 36), 75139#(<= main_~i~0 39), 75138#(<= main_~i~0 38), 75141#(<= main_~i~0 41), 75140#(<= main_~i~0 40), 75143#(<= main_~i~0 43), 75142#(<= main_~i~0 42), 75145#(<= main_~i~0 45), 75144#(<= main_~i~0 44), 75147#(<= main_~i~0 47), 75146#(<= main_~i~0 46), 75149#(<= main_~i~0 49), 75148#(<= main_~i~0 48), 75151#(<= main_~i~0 51), 75150#(<= main_~i~0 50), 75153#(<= main_~i~0 53), 75152#(<= main_~i~0 52), 75155#(<= main_~i~0 55), 75154#(<= main_~i~0 54), 75157#(<= main_~i~0 57), 75156#(<= main_~i~0 56), 75159#(<= main_~i~0 59), 75158#(<= main_~i~0 58), 75161#(<= main_~i~0 61), 75160#(<= main_~i~0 60), 75163#(<= main_~i~0 63), 75162#(<= main_~i~0 62), 75165#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 75164#(<= main_~i~0 64), 75167#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 75166#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 75099#false, 75098#true, 75101#(<= main_~i~0 1), 75100#(<= main_~i~0 0), 75103#(<= main_~i~0 3), 75102#(<= main_~i~0 2), 75105#(<= main_~i~0 5), 75104#(<= main_~i~0 4), 75107#(<= main_~i~0 7), 75106#(<= main_~i~0 6), 75109#(<= main_~i~0 9), 75108#(<= main_~i~0 8), 75111#(<= main_~i~0 11), 75110#(<= main_~i~0 10), 75113#(<= main_~i~0 13), 75112#(<= main_~i~0 12), 75115#(<= main_~i~0 15), 75114#(<= main_~i~0 14), 75117#(<= main_~i~0 17), 75116#(<= main_~i~0 16), 75119#(<= main_~i~0 19), 75118#(<= main_~i~0 18), 75121#(<= main_~i~0 21), 75120#(<= main_~i~0 20), 75123#(<= main_~i~0 23), 75122#(<= main_~i~0 22), 75125#(<= main_~i~0 25), 75124#(<= main_~i~0 24), 75127#(<= main_~i~0 27), 75126#(<= main_~i~0 26), 75129#(<= main_~i~0 29), 75128#(<= main_~i~0 28), 75131#(<= main_~i~0 31), 75130#(<= main_~i~0 30), 75133#(<= main_~i~0 33), 75132#(<= main_~i~0 32), 75135#(<= main_~i~0 35), 75134#(<= main_~i~0 34)] [2018-02-04 01:56:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:04,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 01:56:04,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 01:56:04,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 01:56:04,191 INFO L87 Difference]: Start difference. First operand 956 states and 1288 transitions. Second operand 70 states. [2018-02-04 01:56:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:07,164 INFO L93 Difference]: Finished difference Result 1041 states and 1380 transitions. [2018-02-04 01:56:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 01:56:07,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 338 [2018-02-04 01:56:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:07,166 INFO L225 Difference]: With dead ends: 1041 [2018-02-04 01:56:07,166 INFO L226 Difference]: Without dead ends: 1041 [2018-02-04 01:56:07,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-02-04 01:56:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-02-04 01:56:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 970. [2018-02-04 01:56:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-02-04 01:56:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1307 transitions. [2018-02-04 01:56:07,174 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1307 transitions. Word has length 338 [2018-02-04 01:56:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:07,175 INFO L432 AbstractCegarLoop]: Abstraction has 970 states and 1307 transitions. [2018-02-04 01:56:07,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 01:56:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1307 transitions. [2018-02-04 01:56:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-02-04 01:56:07,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:07,178 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:07,178 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1026914447, now seen corresponding path program 67 times [2018-02-04 01:56:07,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:07,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:08,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:08,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 01:56:08,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:08,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-04 01:56:08,539 INFO L182 omatonBuilderFactory]: Interpolants [77313#(<= main_~i~0 0), 77312#false, 77315#(<= main_~i~0 2), 77314#(<= main_~i~0 1), 77317#(<= main_~i~0 4), 77316#(<= main_~i~0 3), 77319#(<= main_~i~0 6), 77318#(<= main_~i~0 5), 77321#(<= main_~i~0 8), 77320#(<= main_~i~0 7), 77323#(<= main_~i~0 10), 77322#(<= main_~i~0 9), 77325#(<= main_~i~0 12), 77324#(<= main_~i~0 11), 77327#(<= main_~i~0 14), 77326#(<= main_~i~0 13), 77329#(<= main_~i~0 16), 77328#(<= main_~i~0 15), 77331#(<= main_~i~0 18), 77330#(<= main_~i~0 17), 77333#(<= main_~i~0 20), 77332#(<= main_~i~0 19), 77335#(<= main_~i~0 22), 77334#(<= main_~i~0 21), 77337#(<= main_~i~0 24), 77336#(<= main_~i~0 23), 77339#(<= main_~i~0 26), 77338#(<= main_~i~0 25), 77341#(<= main_~i~0 28), 77340#(<= main_~i~0 27), 77343#(<= main_~i~0 30), 77342#(<= main_~i~0 29), 77345#(<= main_~i~0 32), 77344#(<= main_~i~0 31), 77347#(<= main_~i~0 34), 77346#(<= main_~i~0 33), 77349#(<= main_~i~0 36), 77348#(<= main_~i~0 35), 77351#(<= main_~i~0 38), 77350#(<= main_~i~0 37), 77353#(<= main_~i~0 40), 77352#(<= main_~i~0 39), 77355#(<= main_~i~0 42), 77354#(<= main_~i~0 41), 77357#(<= main_~i~0 44), 77356#(<= main_~i~0 43), 77359#(<= main_~i~0 46), 77358#(<= main_~i~0 45), 77361#(<= main_~i~0 48), 77360#(<= main_~i~0 47), 77363#(<= main_~i~0 50), 77362#(<= main_~i~0 49), 77365#(<= main_~i~0 52), 77364#(<= main_~i~0 51), 77367#(<= main_~i~0 54), 77366#(<= main_~i~0 53), 77369#(<= main_~i~0 56), 77368#(<= main_~i~0 55), 77371#(<= main_~i~0 58), 77370#(<= main_~i~0 57), 77373#(<= main_~i~0 60), 77372#(<= main_~i~0 59), 77375#(<= main_~i~0 62), 77374#(<= main_~i~0 61), 77377#(<= main_~i~0 64), 77376#(<= main_~i~0 63), 77379#(<= main_~i~0 66), 77378#(<= main_~i~0 65), 77381#(and (<= main_~i~0 67) (<= 1 main_~i~0)), 77380#(and (<= main_~i~0 66) (<= 0 main_~i~0)), 77311#true] [2018-02-04 01:56:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:08,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 01:56:08,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 01:56:08,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 01:56:08,540 INFO L87 Difference]: Start difference. First operand 970 states and 1307 transitions. Second operand 71 states. [2018-02-04 01:56:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:11,607 INFO L93 Difference]: Finished difference Result 1056 states and 1400 transitions. [2018-02-04 01:56:11,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 01:56:11,608 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 343 [2018-02-04 01:56:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:11,609 INFO L225 Difference]: With dead ends: 1056 [2018-02-04 01:56:11,609 INFO L226 Difference]: Without dead ends: 1056 [2018-02-04 01:56:11,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 01:56:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-02-04 01:56:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 984. [2018-02-04 01:56:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-02-04 01:56:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1326 transitions. [2018-02-04 01:56:11,615 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1326 transitions. Word has length 343 [2018-02-04 01:56:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:11,615 INFO L432 AbstractCegarLoop]: Abstraction has 984 states and 1326 transitions. [2018-02-04 01:56:11,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 01:56:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1326 transitions. [2018-02-04 01:56:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-02-04 01:56:11,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:11,617 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:11,617 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2027313533, now seen corresponding path program 68 times [2018-02-04 01:56:11,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:11,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:12,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:12,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 01:56:12,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:12,948 INFO L182 omatonBuilderFactory]: Interpolants [79617#(<= main_~i~0 59), 79616#(<= main_~i~0 58), 79619#(<= main_~i~0 61), 79618#(<= main_~i~0 60), 79621#(<= main_~i~0 63), 79620#(<= main_~i~0 62), 79623#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 79622#(<= main_~i~0 64), 79625#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 79624#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 79627#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 79626#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 79557#false, 79556#true, 79559#(<= main_~i~0 1), 79558#(<= main_~i~0 0), 79561#(<= main_~i~0 3), 79560#(<= main_~i~0 2), 79563#(<= main_~i~0 5), 79562#(<= main_~i~0 4), 79565#(<= main_~i~0 7), 79564#(<= main_~i~0 6), 79567#(<= main_~i~0 9), 79566#(<= main_~i~0 8), 79569#(<= main_~i~0 11), 79568#(<= main_~i~0 10), 79571#(<= main_~i~0 13), 79570#(<= main_~i~0 12), 79573#(<= main_~i~0 15), 79572#(<= main_~i~0 14), 79575#(<= main_~i~0 17), 79574#(<= main_~i~0 16), 79577#(<= main_~i~0 19), 79576#(<= main_~i~0 18), 79579#(<= main_~i~0 21), 79578#(<= main_~i~0 20), 79581#(<= main_~i~0 23), 79580#(<= main_~i~0 22), 79583#(<= main_~i~0 25), 79582#(<= main_~i~0 24), 79585#(<= main_~i~0 27), 79584#(<= main_~i~0 26), 79587#(<= main_~i~0 29), 79586#(<= main_~i~0 28), 79589#(<= main_~i~0 31), 79588#(<= main_~i~0 30), 79591#(<= main_~i~0 33), 79590#(<= main_~i~0 32), 79593#(<= main_~i~0 35), 79592#(<= main_~i~0 34), 79595#(<= main_~i~0 37), 79594#(<= main_~i~0 36), 79597#(<= main_~i~0 39), 79596#(<= main_~i~0 38), 79599#(<= main_~i~0 41), 79598#(<= main_~i~0 40), 79601#(<= main_~i~0 43), 79600#(<= main_~i~0 42), 79603#(<= main_~i~0 45), 79602#(<= main_~i~0 44), 79605#(<= main_~i~0 47), 79604#(<= main_~i~0 46), 79607#(<= main_~i~0 49), 79606#(<= main_~i~0 48), 79609#(<= main_~i~0 51), 79608#(<= main_~i~0 50), 79611#(<= main_~i~0 53), 79610#(<= main_~i~0 52), 79613#(<= main_~i~0 55), 79612#(<= main_~i~0 54), 79615#(<= main_~i~0 57), 79614#(<= main_~i~0 56)] [2018-02-04 01:56:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:12,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 01:56:12,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 01:56:12,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 01:56:12,949 INFO L87 Difference]: Start difference. First operand 984 states and 1326 transitions. Second operand 72 states. [2018-02-04 01:56:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:16,557 INFO L93 Difference]: Finished difference Result 1071 states and 1420 transitions. [2018-02-04 01:56:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 01:56:16,558 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 348 [2018-02-04 01:56:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:16,558 INFO L225 Difference]: With dead ends: 1071 [2018-02-04 01:56:16,559 INFO L226 Difference]: Without dead ends: 1071 [2018-02-04 01:56:16,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 01:56:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-02-04 01:56:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 998. [2018-02-04 01:56:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-02-04 01:56:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1345 transitions. [2018-02-04 01:56:16,565 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1345 transitions. Word has length 348 [2018-02-04 01:56:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:16,565 INFO L432 AbstractCegarLoop]: Abstraction has 998 states and 1345 transitions. [2018-02-04 01:56:16,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 01:56:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1345 transitions. [2018-02-04 01:56:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 01:56:16,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:16,567 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:16,567 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1424153935, now seen corresponding path program 69 times [2018-02-04 01:56:16,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:16,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:17,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:17,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 01:56:17,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:17,950 INFO L182 omatonBuilderFactory]: Interpolants [81833#true, 81835#(<= main_~i~0 0), 81834#false, 81837#(<= main_~i~0 2), 81836#(<= main_~i~0 1), 81839#(<= main_~i~0 4), 81838#(<= main_~i~0 3), 81841#(<= main_~i~0 6), 81840#(<= main_~i~0 5), 81843#(<= main_~i~0 8), 81842#(<= main_~i~0 7), 81845#(<= main_~i~0 10), 81844#(<= main_~i~0 9), 81847#(<= main_~i~0 12), 81846#(<= main_~i~0 11), 81849#(<= main_~i~0 14), 81848#(<= main_~i~0 13), 81851#(<= main_~i~0 16), 81850#(<= main_~i~0 15), 81853#(<= main_~i~0 18), 81852#(<= main_~i~0 17), 81855#(<= main_~i~0 20), 81854#(<= main_~i~0 19), 81857#(<= main_~i~0 22), 81856#(<= main_~i~0 21), 81859#(<= main_~i~0 24), 81858#(<= main_~i~0 23), 81861#(<= main_~i~0 26), 81860#(<= main_~i~0 25), 81863#(<= main_~i~0 28), 81862#(<= main_~i~0 27), 81865#(<= main_~i~0 30), 81864#(<= main_~i~0 29), 81867#(<= main_~i~0 32), 81866#(<= main_~i~0 31), 81869#(<= main_~i~0 34), 81868#(<= main_~i~0 33), 81871#(<= main_~i~0 36), 81870#(<= main_~i~0 35), 81873#(<= main_~i~0 38), 81872#(<= main_~i~0 37), 81875#(<= main_~i~0 40), 81874#(<= main_~i~0 39), 81877#(<= main_~i~0 42), 81876#(<= main_~i~0 41), 81879#(<= main_~i~0 44), 81878#(<= main_~i~0 43), 81881#(<= main_~i~0 46), 81880#(<= main_~i~0 45), 81883#(<= main_~i~0 48), 81882#(<= main_~i~0 47), 81885#(<= main_~i~0 50), 81884#(<= main_~i~0 49), 81887#(<= main_~i~0 52), 81886#(<= main_~i~0 51), 81889#(<= main_~i~0 54), 81888#(<= main_~i~0 53), 81891#(<= main_~i~0 56), 81890#(<= main_~i~0 55), 81893#(<= main_~i~0 58), 81892#(<= main_~i~0 57), 81895#(<= main_~i~0 60), 81894#(<= main_~i~0 59), 81897#(<= main_~i~0 62), 81896#(<= main_~i~0 61), 81899#(<= main_~i~0 64), 81898#(<= main_~i~0 63), 81901#(<= main_~i~0 66), 81900#(<= main_~i~0 65), 81903#(<= main_~i~0 68), 81902#(<= main_~i~0 67), 81905#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 81904#(and (<= 0 main_~i~0) (<= main_~i~0 68))] [2018-02-04 01:56:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:17,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 01:56:17,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 01:56:17,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 01:56:17,951 INFO L87 Difference]: Start difference. First operand 998 states and 1345 transitions. Second operand 73 states. [2018-02-04 01:56:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:21,201 INFO L93 Difference]: Finished difference Result 1086 states and 1440 transitions. [2018-02-04 01:56:21,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 01:56:21,201 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 353 [2018-02-04 01:56:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:21,203 INFO L225 Difference]: With dead ends: 1086 [2018-02-04 01:56:21,203 INFO L226 Difference]: Without dead ends: 1086 [2018-02-04 01:56:21,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-02-04 01:56:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2018-02-04 01:56:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1012. [2018-02-04 01:56:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-02-04 01:56:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1364 transitions. [2018-02-04 01:56:21,210 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1364 transitions. Word has length 353 [2018-02-04 01:56:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:21,210 INFO L432 AbstractCegarLoop]: Abstraction has 1012 states and 1364 transitions. [2018-02-04 01:56:21,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 01:56:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1364 transitions. [2018-02-04 01:56:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-02-04 01:56:21,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:21,212 INFO L351 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:21,212 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:21,212 INFO L82 PathProgramCache]: Analyzing trace with hash 294251709, now seen corresponding path program 70 times [2018-02-04 01:56:21,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:21,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:22,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:22,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 01:56:22,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:22,690 INFO L182 omatonBuilderFactory]: Interpolants [84143#false, 84142#true, 84145#(<= main_~i~0 1), 84144#(<= main_~i~0 0), 84147#(<= main_~i~0 3), 84146#(<= main_~i~0 2), 84149#(<= main_~i~0 5), 84148#(<= main_~i~0 4), 84151#(<= main_~i~0 7), 84150#(<= main_~i~0 6), 84153#(<= main_~i~0 9), 84152#(<= main_~i~0 8), 84155#(<= main_~i~0 11), 84154#(<= main_~i~0 10), 84157#(<= main_~i~0 13), 84156#(<= main_~i~0 12), 84159#(<= main_~i~0 15), 84158#(<= main_~i~0 14), 84161#(<= main_~i~0 17), 84160#(<= main_~i~0 16), 84163#(<= main_~i~0 19), 84162#(<= main_~i~0 18), 84165#(<= main_~i~0 21), 84164#(<= main_~i~0 20), 84167#(<= main_~i~0 23), 84166#(<= main_~i~0 22), 84169#(<= main_~i~0 25), 84168#(<= main_~i~0 24), 84171#(<= main_~i~0 27), 84170#(<= main_~i~0 26), 84173#(<= main_~i~0 29), 84172#(<= main_~i~0 28), 84175#(<= main_~i~0 31), 84174#(<= main_~i~0 30), 84177#(<= main_~i~0 33), 84176#(<= main_~i~0 32), 84179#(<= main_~i~0 35), 84178#(<= main_~i~0 34), 84181#(<= main_~i~0 37), 84180#(<= main_~i~0 36), 84183#(<= main_~i~0 39), 84182#(<= main_~i~0 38), 84185#(<= main_~i~0 41), 84184#(<= main_~i~0 40), 84187#(<= main_~i~0 43), 84186#(<= main_~i~0 42), 84189#(<= main_~i~0 45), 84188#(<= main_~i~0 44), 84191#(<= main_~i~0 47), 84190#(<= main_~i~0 46), 84193#(<= main_~i~0 49), 84192#(<= main_~i~0 48), 84195#(<= main_~i~0 51), 84194#(<= main_~i~0 50), 84197#(<= main_~i~0 53), 84196#(<= main_~i~0 52), 84199#(<= main_~i~0 55), 84198#(<= main_~i~0 54), 84201#(<= main_~i~0 57), 84200#(<= main_~i~0 56), 84203#(<= main_~i~0 59), 84202#(<= main_~i~0 58), 84205#(<= main_~i~0 61), 84204#(<= main_~i~0 60), 84207#(<= main_~i~0 63), 84206#(<= main_~i~0 62), 84209#(<= main_~i~0 65), 84208#(<= main_~i~0 64), 84211#(<= main_~i~0 67), 84210#(<= main_~i~0 66), 84213#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 84212#(<= main_~i~0 68), 84215#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 84214#(and (<= main_~i~0 69) (<= 1 main_~i~0))] [2018-02-04 01:56:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:22,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 01:56:22,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 01:56:22,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 01:56:22,691 INFO L87 Difference]: Start difference. First operand 1012 states and 1364 transitions. Second operand 74 states. [2018-02-04 01:56:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:26,136 INFO L93 Difference]: Finished difference Result 1101 states and 1460 transitions. [2018-02-04 01:56:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 01:56:26,136 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 358 [2018-02-04 01:56:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:26,137 INFO L225 Difference]: With dead ends: 1101 [2018-02-04 01:56:26,137 INFO L226 Difference]: Without dead ends: 1101 [2018-02-04 01:56:26,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 01:56:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-02-04 01:56:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1026. [2018-02-04 01:56:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-02-04 01:56:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1383 transitions. [2018-02-04 01:56:26,145 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1383 transitions. Word has length 358 [2018-02-04 01:56:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:26,145 INFO L432 AbstractCegarLoop]: Abstraction has 1026 states and 1383 transitions. [2018-02-04 01:56:26,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 01:56:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1383 transitions. [2018-02-04 01:56:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-02-04 01:56:26,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:26,147 INFO L351 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:26,147 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2041139727, now seen corresponding path program 71 times [2018-02-04 01:56:26,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:26,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:27,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:27,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 01:56:27,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:27,647 INFO L182 omatonBuilderFactory]: Interpolants [86529#(<= main_~i~0 44), 86528#(<= main_~i~0 43), 86531#(<= main_~i~0 46), 86530#(<= main_~i~0 45), 86533#(<= main_~i~0 48), 86532#(<= main_~i~0 47), 86535#(<= main_~i~0 50), 86534#(<= main_~i~0 49), 86537#(<= main_~i~0 52), 86536#(<= main_~i~0 51), 86539#(<= main_~i~0 54), 86538#(<= main_~i~0 53), 86541#(<= main_~i~0 56), 86540#(<= main_~i~0 55), 86543#(<= main_~i~0 58), 86542#(<= main_~i~0 57), 86545#(<= main_~i~0 60), 86544#(<= main_~i~0 59), 86547#(<= main_~i~0 62), 86546#(<= main_~i~0 61), 86549#(<= main_~i~0 64), 86548#(<= main_~i~0 63), 86551#(<= main_~i~0 66), 86550#(<= main_~i~0 65), 86553#(<= main_~i~0 68), 86552#(<= main_~i~0 67), 86555#(<= main_~i~0 70), 86554#(<= main_~i~0 69), 86557#(and (<= 1 main_~i~0) (<= main_~i~0 71)), 86556#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 86483#true, 86485#(<= main_~i~0 0), 86484#false, 86487#(<= main_~i~0 2), 86486#(<= main_~i~0 1), 86489#(<= main_~i~0 4), 86488#(<= main_~i~0 3), 86491#(<= main_~i~0 6), 86490#(<= main_~i~0 5), 86493#(<= main_~i~0 8), 86492#(<= main_~i~0 7), 86495#(<= main_~i~0 10), 86494#(<= main_~i~0 9), 86497#(<= main_~i~0 12), 86496#(<= main_~i~0 11), 86499#(<= main_~i~0 14), 86498#(<= main_~i~0 13), 86501#(<= main_~i~0 16), 86500#(<= main_~i~0 15), 86503#(<= main_~i~0 18), 86502#(<= main_~i~0 17), 86505#(<= main_~i~0 20), 86504#(<= main_~i~0 19), 86507#(<= main_~i~0 22), 86506#(<= main_~i~0 21), 86509#(<= main_~i~0 24), 86508#(<= main_~i~0 23), 86511#(<= main_~i~0 26), 86510#(<= main_~i~0 25), 86513#(<= main_~i~0 28), 86512#(<= main_~i~0 27), 86515#(<= main_~i~0 30), 86514#(<= main_~i~0 29), 86517#(<= main_~i~0 32), 86516#(<= main_~i~0 31), 86519#(<= main_~i~0 34), 86518#(<= main_~i~0 33), 86521#(<= main_~i~0 36), 86520#(<= main_~i~0 35), 86523#(<= main_~i~0 38), 86522#(<= main_~i~0 37), 86525#(<= main_~i~0 40), 86524#(<= main_~i~0 39), 86527#(<= main_~i~0 42), 86526#(<= main_~i~0 41)] [2018-02-04 01:56:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:27,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 01:56:27,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 01:56:27,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 01:56:27,648 INFO L87 Difference]: Start difference. First operand 1026 states and 1383 transitions. Second operand 75 states. [2018-02-04 01:56:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:30,907 INFO L93 Difference]: Finished difference Result 1116 states and 1480 transitions. [2018-02-04 01:56:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 01:56:30,907 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 363 [2018-02-04 01:56:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:30,909 INFO L225 Difference]: With dead ends: 1116 [2018-02-04 01:56:30,909 INFO L226 Difference]: Without dead ends: 1116 [2018-02-04 01:56:30,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-02-04 01:56:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-02-04 01:56:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1040. [2018-02-04 01:56:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-02-04 01:56:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1402 transitions. [2018-02-04 01:56:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1402 transitions. Word has length 363 [2018-02-04 01:56:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:30,919 INFO L432 AbstractCegarLoop]: Abstraction has 1040 states and 1402 transitions. [2018-02-04 01:56:30,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 01:56:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1402 transitions. [2018-02-04 01:56:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-02-04 01:56:30,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:30,921 INFO L351 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:30,921 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 844001277, now seen corresponding path program 72 times [2018-02-04 01:56:30,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:30,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:32,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:32,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 01:56:32,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:32,397 INFO L182 omatonBuilderFactory]: Interpolants [88857#false, 88856#true, 88859#(<= main_~i~0 1), 88858#(<= main_~i~0 0), 88861#(<= main_~i~0 3), 88860#(<= main_~i~0 2), 88863#(<= main_~i~0 5), 88862#(<= main_~i~0 4), 88865#(<= main_~i~0 7), 88864#(<= main_~i~0 6), 88867#(<= main_~i~0 9), 88866#(<= main_~i~0 8), 88869#(<= main_~i~0 11), 88868#(<= main_~i~0 10), 88871#(<= main_~i~0 13), 88870#(<= main_~i~0 12), 88873#(<= main_~i~0 15), 88872#(<= main_~i~0 14), 88875#(<= main_~i~0 17), 88874#(<= main_~i~0 16), 88877#(<= main_~i~0 19), 88876#(<= main_~i~0 18), 88879#(<= main_~i~0 21), 88878#(<= main_~i~0 20), 88881#(<= main_~i~0 23), 88880#(<= main_~i~0 22), 88883#(<= main_~i~0 25), 88882#(<= main_~i~0 24), 88885#(<= main_~i~0 27), 88884#(<= main_~i~0 26), 88887#(<= main_~i~0 29), 88886#(<= main_~i~0 28), 88889#(<= main_~i~0 31), 88888#(<= main_~i~0 30), 88891#(<= main_~i~0 33), 88890#(<= main_~i~0 32), 88893#(<= main_~i~0 35), 88892#(<= main_~i~0 34), 88895#(<= main_~i~0 37), 88894#(<= main_~i~0 36), 88897#(<= main_~i~0 39), 88896#(<= main_~i~0 38), 88899#(<= main_~i~0 41), 88898#(<= main_~i~0 40), 88901#(<= main_~i~0 43), 88900#(<= main_~i~0 42), 88903#(<= main_~i~0 45), 88902#(<= main_~i~0 44), 88905#(<= main_~i~0 47), 88904#(<= main_~i~0 46), 88907#(<= main_~i~0 49), 88906#(<= main_~i~0 48), 88909#(<= main_~i~0 51), 88908#(<= main_~i~0 50), 88911#(<= main_~i~0 53), 88910#(<= main_~i~0 52), 88913#(<= main_~i~0 55), 88912#(<= main_~i~0 54), 88915#(<= main_~i~0 57), 88914#(<= main_~i~0 56), 88917#(<= main_~i~0 59), 88916#(<= main_~i~0 58), 88919#(<= main_~i~0 61), 88918#(<= main_~i~0 60), 88921#(<= main_~i~0 63), 88920#(<= main_~i~0 62), 88923#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 88922#(<= main_~i~0 64), 88925#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 88924#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 88927#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 88926#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 88929#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 88928#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 88931#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 88930#(and (<= 7 main_~i~0) (<= main_~i~0 71))] [2018-02-04 01:56:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:32,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 01:56:32,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 01:56:32,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 01:56:32,398 INFO L87 Difference]: Start difference. First operand 1040 states and 1402 transitions. Second operand 76 states. [2018-02-04 01:56:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:36,974 INFO L93 Difference]: Finished difference Result 1131 states and 1500 transitions. [2018-02-04 01:56:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 01:56:36,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 368 [2018-02-04 01:56:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:36,975 INFO L225 Difference]: With dead ends: 1131 [2018-02-04 01:56:36,975 INFO L226 Difference]: Without dead ends: 1131 [2018-02-04 01:56:36,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-02-04 01:56:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-02-04 01:56:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1054. [2018-02-04 01:56:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-02-04 01:56:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1421 transitions. [2018-02-04 01:56:36,984 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1421 transitions. Word has length 368 [2018-02-04 01:56:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:36,984 INFO L432 AbstractCegarLoop]: Abstraction has 1054 states and 1421 transitions. [2018-02-04 01:56:36,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 01:56:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1421 transitions. [2018-02-04 01:56:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-02-04 01:56:36,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:36,987 INFO L351 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:36,987 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 729077455, now seen corresponding path program 73 times [2018-02-04 01:56:36,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:37,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:38,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:38,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-02-04 01:56:38,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:38,517 INFO L182 omatonBuilderFactory]: Interpolants [91265#(<= main_~i~0 2), 91264#(<= main_~i~0 1), 91267#(<= main_~i~0 4), 91266#(<= main_~i~0 3), 91269#(<= main_~i~0 6), 91268#(<= main_~i~0 5), 91271#(<= main_~i~0 8), 91270#(<= main_~i~0 7), 91273#(<= main_~i~0 10), 91272#(<= main_~i~0 9), 91275#(<= main_~i~0 12), 91274#(<= main_~i~0 11), 91277#(<= main_~i~0 14), 91276#(<= main_~i~0 13), 91279#(<= main_~i~0 16), 91278#(<= main_~i~0 15), 91281#(<= main_~i~0 18), 91280#(<= main_~i~0 17), 91283#(<= main_~i~0 20), 91282#(<= main_~i~0 19), 91285#(<= main_~i~0 22), 91284#(<= main_~i~0 21), 91287#(<= main_~i~0 24), 91286#(<= main_~i~0 23), 91289#(<= main_~i~0 26), 91288#(<= main_~i~0 25), 91291#(<= main_~i~0 28), 91290#(<= main_~i~0 27), 91293#(<= main_~i~0 30), 91292#(<= main_~i~0 29), 91295#(<= main_~i~0 32), 91294#(<= main_~i~0 31), 91297#(<= main_~i~0 34), 91296#(<= main_~i~0 33), 91299#(<= main_~i~0 36), 91298#(<= main_~i~0 35), 91301#(<= main_~i~0 38), 91300#(<= main_~i~0 37), 91303#(<= main_~i~0 40), 91302#(<= main_~i~0 39), 91305#(<= main_~i~0 42), 91304#(<= main_~i~0 41), 91307#(<= main_~i~0 44), 91306#(<= main_~i~0 43), 91309#(<= main_~i~0 46), 91308#(<= main_~i~0 45), 91311#(<= main_~i~0 48), 91310#(<= main_~i~0 47), 91313#(<= main_~i~0 50), 91312#(<= main_~i~0 49), 91315#(<= main_~i~0 52), 91314#(<= main_~i~0 51), 91317#(<= main_~i~0 54), 91316#(<= main_~i~0 53), 91319#(<= main_~i~0 56), 91318#(<= main_~i~0 55), 91321#(<= main_~i~0 58), 91320#(<= main_~i~0 57), 91323#(<= main_~i~0 60), 91322#(<= main_~i~0 59), 91325#(<= main_~i~0 62), 91324#(<= main_~i~0 61), 91327#(<= main_~i~0 64), 91326#(<= main_~i~0 63), 91329#(<= main_~i~0 66), 91328#(<= main_~i~0 65), 91331#(<= main_~i~0 68), 91330#(<= main_~i~0 67), 91333#(<= main_~i~0 70), 91332#(<= main_~i~0 69), 91335#(<= main_~i~0 72), 91334#(<= main_~i~0 71), 91337#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 91336#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 91261#true, 91263#(<= main_~i~0 0), 91262#false] [2018-02-04 01:56:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:38,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 01:56:38,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 01:56:38,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 01:56:38,518 INFO L87 Difference]: Start difference. First operand 1054 states and 1421 transitions. Second operand 77 states. [2018-02-04 01:56:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:56:42,189 INFO L93 Difference]: Finished difference Result 1146 states and 1520 transitions. [2018-02-04 01:56:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 01:56:42,189 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 373 [2018-02-04 01:56:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:56:42,190 INFO L225 Difference]: With dead ends: 1146 [2018-02-04 01:56:42,190 INFO L226 Difference]: Without dead ends: 1146 [2018-02-04 01:56:42,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-02-04 01:56:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-02-04 01:56:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1068. [2018-02-04 01:56:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-02-04 01:56:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1440 transitions. [2018-02-04 01:56:42,196 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1440 transitions. Word has length 373 [2018-02-04 01:56:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:56:42,196 INFO L432 AbstractCegarLoop]: Abstraction has 1068 states and 1440 transitions. [2018-02-04 01:56:42,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 01:56:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1440 transitions. [2018-02-04 01:56:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-02-04 01:56:42,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:56:42,198 INFO L351 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-02-04 01:56:42,198 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 01:56:42,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1857545021, now seen corresponding path program 74 times [2018-02-04 01:56:42,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:56:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:56:42,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:56:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:43,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:56:43,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 01:56:43,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:56:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:43,802 INFO L182 omatonBuilderFactory]: Interpolants [93699#false, 93698#true, 93701#(<= main_~i~0 1), 93700#(<= main_~i~0 0), 93703#(<= main_~i~0 3), 93702#(<= main_~i~0 2), 93705#(<= main_~i~0 5), 93704#(<= main_~i~0 4), 93707#(<= main_~i~0 7), 93706#(<= main_~i~0 6), 93709#(<= main_~i~0 9), 93708#(<= main_~i~0 8), 93711#(<= main_~i~0 11), 93710#(<= main_~i~0 10), 93713#(<= main_~i~0 13), 93712#(<= main_~i~0 12), 93715#(<= main_~i~0 15), 93714#(<= main_~i~0 14), 93717#(<= main_~i~0 17), 93716#(<= main_~i~0 16), 93719#(<= main_~i~0 19), 93718#(<= main_~i~0 18), 93721#(<= main_~i~0 21), 93720#(<= main_~i~0 20), 93723#(<= main_~i~0 23), 93722#(<= main_~i~0 22), 93725#(<= main_~i~0 25), 93724#(<= main_~i~0 24), 93727#(<= main_~i~0 27), 93726#(<= main_~i~0 26), 93729#(<= main_~i~0 29), 93728#(<= main_~i~0 28), 93731#(<= main_~i~0 31), 93730#(<= main_~i~0 30), 93733#(<= main_~i~0 33), 93732#(<= main_~i~0 32), 93735#(<= main_~i~0 35), 93734#(<= main_~i~0 34), 93737#(<= main_~i~0 37), 93736#(<= main_~i~0 36), 93739#(<= main_~i~0 39), 93738#(<= main_~i~0 38), 93741#(<= main_~i~0 41), 93740#(<= main_~i~0 40), 93743#(<= main_~i~0 43), 93742#(<= main_~i~0 42), 93745#(<= main_~i~0 45), 93744#(<= main_~i~0 44), 93747#(<= main_~i~0 47), 93746#(<= main_~i~0 46), 93749#(<= main_~i~0 49), 93748#(<= main_~i~0 48), 93751#(<= main_~i~0 51), 93750#(<= main_~i~0 50), 93753#(<= main_~i~0 53), 93752#(<= main_~i~0 52), 93755#(<= main_~i~0 55), 93754#(<= main_~i~0 54), 93757#(<= main_~i~0 57), 93756#(<= main_~i~0 56), 93759#(<= main_~i~0 59), 93758#(<= main_~i~0 58), 93761#(<= main_~i~0 61), 93760#(<= main_~i~0 60), 93763#(<= main_~i~0 63), 93762#(<= main_~i~0 62), 93765#(<= main_~i~0 65), 93764#(<= main_~i~0 64), 93767#(<= main_~i~0 67), 93766#(<= main_~i~0 66), 93769#(<= main_~i~0 69), 93768#(<= main_~i~0 68), 93771#(<= main_~i~0 71), 93770#(<= main_~i~0 70), 93773#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 93772#(<= main_~i~0 72), 93775#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 93774#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-02-04 01:56:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:56:43,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 01:56:43,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 01:56:43,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 01:56:43,803 INFO L87 Difference]: Start difference. First operand 1068 states and 1440 transitions. Second operand 78 states. Received shutdown request... [2018-02-04 01:56:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 01:56:43,804 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 01:56:43,808 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 01:56:43,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:56:43 BoogieIcfgContainer [2018-02-04 01:56:43,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:56:43,809 INFO L168 Benchmark]: Toolchain (without parser) took 181964.85 ms. Allocated memory was 388.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 346.4 MB in the beginning and 1.0 GB in the end (delta: -658.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-02-04 01:56:43,809 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 388.5 MB. Free memory is still 351.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:56:43,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.90 ms. Allocated memory is still 388.5 MB. Free memory was 346.4 MB in the beginning and 338.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:56:43,810 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 ms. Allocated memory is still 388.5 MB. Free memory was 338.4 MB in the beginning and 337.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:56:43,810 INFO L168 Benchmark]: RCFGBuilder took 151.92 ms. Allocated memory is still 388.5 MB. Free memory was 337.1 MB in the beginning and 321.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:56:43,810 INFO L168 Benchmark]: TraceAbstraction took 181639.22 ms. Allocated memory was 388.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 321.2 MB in the beginning and 1.0 GB in the end (delta: -684.2 MB). Peak memory consumption was 988.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:56:43,811 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.13 ms. Allocated memory is still 388.5 MB. Free memory is still 351.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.90 ms. Allocated memory is still 388.5 MB. Free memory was 346.4 MB in the beginning and 338.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.14 ms. Allocated memory is still 388.5 MB. Free memory was 338.4 MB in the beginning and 337.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 151.92 ms. Allocated memory is still 388.5 MB. Free memory was 337.1 MB in the beginning and 321.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 181639.22 ms. Allocated memory was 388.5 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 321.2 MB in the beginning and 1.0 GB in the end (delta: -684.2 MB). Peak memory consumption was 988.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (1068states) and interpolant automaton (currently 2 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (1068states) and interpolant automaton (currently 2 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (1068states) and interpolant automaton (currently 2 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (1068states) and interpolant automaton (currently 2 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 181.5s OverallTime, 75 OverallIterations, 75 TraceHistogramMax, 134.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8939 SDtfs, 121879 SDslu, 75152 SDs, 0 SdLazy, 234869 SolverSat, 45371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5566 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70533 ImplicationChecksByTransitivity, 75.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/345950 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, 74 MinimizatonAttempts, 3071 StatesRemovedByMinimization, 74 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 43.0s InterpolantComputationTime, 14475 NumberOfCodeBlocks, 14475 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 14400 ConstructedInterpolants, 0 QuantifiedInterpolants, 12048102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 1 PerfectInterpolantSequences, 0/345950 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/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-56-43-815.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-56-43-815.csv Completed graceful shutdown