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/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:09:10,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:09:10,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:09:10,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:09:10,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:09:10,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:09:10,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:09:10,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:09:10,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:09:10,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:09:10,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:09:10,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:09:10,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:09:10,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:09:10,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:09:10,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:09:10,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:09:10,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:09:10,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:09:10,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:09:10,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:09:10,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:09:10,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:09:10,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:09:10,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:09:10,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:09:10,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:09:10,649 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:09:10,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:09:10,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:09:10,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:09:10,650 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 15:09:10,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:09:10,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:09:10,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:09:10,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:09:10,661 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:09:10,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:09:10,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:09:10,662 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:09:10,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:09:10,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:09:10,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:09:10,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:09:10,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:09:10,701 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:09:10,704 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:09:10,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:09:10,705 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:09:10,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-02-04 15:09:10,812 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:09:10,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:09:10,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:09:10,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:09:10,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:09:10,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378098f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10, skipping insertion in model container [2018-02-04 15:09:10,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:09:10,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:09:10,931 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:09:10,939 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:09:10,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10 WrapperNode [2018-02-04 15:09:10,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:09:10,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:09:10,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:09:10,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:09:10,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (1/1) ... [2018-02-04 15:09:10,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:09:10,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:09:10,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:09:10,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:09:10,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (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 15:09:10,995 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:09:10,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:09:10,996 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 15:09:10,996 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:09:10,996 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 15:09:10,996 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 15:09:10,996 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:09:10,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:09:10,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:09:11,116 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:09:11,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:09:11 BoogieIcfgContainer [2018-02-04 15:09:11,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:09:11,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:09:11,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:09:11,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:09:11,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:09:10" (1/3) ... [2018-02-04 15:09:11,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b356ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:09:11, skipping insertion in model container [2018-02-04 15:09:11,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:09:10" (2/3) ... [2018-02-04 15:09:11,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b356ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:09:11, skipping insertion in model container [2018-02-04 15:09:11,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:09:11" (3/3) ... [2018-02-04 15:09:11,120 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-04 15:09:11,125 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:09:11,131 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 15:09:11,154 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:09:11,155 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:09:11,155 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:09:11,155 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:09:11,155 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:09:11,155 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:09:11,155 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:09:11,155 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:09:11,156 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:09:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-04 15:09:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 15:09:11,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,177 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,177 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times [2018-02-04 15:09:11,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,292 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 15:09:11,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:09:11,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:09:11,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,295 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 15:09:11,295 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 37#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-04 15:09:11,295 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 15:09:11,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:09:11,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:09:11,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:09:11,310 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-04 15:09:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,358 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 15:09:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:09:11,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 15:09:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,364 INFO L225 Difference]: With dead ends: 49 [2018-02-04 15:09:11,364 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 15:09:11,365 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 15:09:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 15:09:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-04 15:09:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 15:09:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 15:09:11,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-02-04 15:09:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,395 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 15:09:11,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:09:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 15:09:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:09:11,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,396 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,396 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times [2018-02-04 15:09:11,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:11,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 15:09:11,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,501 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 15:09:11,501 INFO L182 omatonBuilderFactory]: Interpolants [118#true, 119#false, 120#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 121#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-02-04 15:09:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:09:11,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:09:11,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:09:11,503 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-02-04 15:09:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,571 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 15:09:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:09:11,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 15:09:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,573 INFO L225 Difference]: With dead ends: 54 [2018-02-04 15:09:11,573 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 15:09:11,574 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 15:09:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 15:09:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-02-04 15:09:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 15:09:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-04 15:09:11,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2018-02-04 15:09:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,578 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-04 15:09:11,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:09:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-04 15:09:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:09:11,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,579 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,579 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times [2018-02-04 15:09:11,581 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,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 15:09:11,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:09:11,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:09:11,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,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 15:09:11,626 INFO L182 omatonBuilderFactory]: Interpolants [212#true, 213#false, 214#(<= main_~i~0 0), 215#(and (= main_~x~0 0) (<= main_~i~0 0))] [2018-02-04 15:09:11,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 15:09:11,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:09:11,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:09:11,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:09:11,627 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-02-04 15:09:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,660 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 15:09:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:09:11,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 15:09:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,660 INFO L225 Difference]: With dead ends: 39 [2018-02-04 15:09:11,661 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 15:09:11,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:09:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 15:09:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 15:09:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 15:09:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 15:09:11,664 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-02-04 15:09:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,665 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 15:09:11,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:09:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 15:09:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:09:11,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,665 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,665 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times [2018-02-04 15:09:11,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:11,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 15:09:11,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,705 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 15:09:11,705 INFO L182 omatonBuilderFactory]: Interpolants [291#true, 292#false, 293#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 294#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 295#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-02-04 15:09:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:09:11,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:09:11,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:09:11,706 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 15:09:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,786 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 15:09:11,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:09:11,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 15:09:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,787 INFO L225 Difference]: With dead ends: 59 [2018-02-04 15:09:11,788 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 15:09:11,788 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 15:09:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 15:09:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-04 15:09:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 15:09:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 15:09:11,792 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2018-02-04 15:09:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,792 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 15:09:11,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:09:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 15:09:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:09:11,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,793 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,793 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2131223963, now seen corresponding path program 1 times [2018-02-04 15:09:11,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:09:11,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:09:11,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:09:11,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,814 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 15:09:11,814 INFO L182 omatonBuilderFactory]: Interpolants [396#true, 397#false, 398#(= main_~x~0 0)] [2018-02-04 15:09:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:09:11,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:09:11,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:09:11,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:09:11,815 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-02-04 15:09:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,831 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 15:09:11,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:09:11,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 15:09:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,832 INFO L225 Difference]: With dead ends: 47 [2018-02-04 15:09:11,833 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 15:09:11,833 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 15:09:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 15:09:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-04 15:09:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 15:09:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 15:09:11,837 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-02-04 15:09:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,837 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 15:09:11,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:09:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 15:09:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 15:09:11,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,838 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,838 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times [2018-02-04 15:09:11,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:11,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 15:09:11,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:11,889 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 15:09:11,889 INFO L182 omatonBuilderFactory]: Interpolants [496#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 497#(and (<= main_~i~0 3) (<= 1 main_~i~0)), 491#true, 492#false, 493#(<= main_~i~0 0), 494#(<= main_~i~0 1), 495#(<= main_~i~0 2)] [2018-02-04 15:09:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:11,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:09:11,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:09:11,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:09:11,890 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-02-04 15:09:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:11,977 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 15:09:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:09:11,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 15:09:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:11,978 INFO L225 Difference]: With dead ends: 89 [2018-02-04 15:09:11,978 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 15:09:11,979 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 15:09:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 15:09:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-02-04 15:09:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:09:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 15:09:11,983 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-02-04 15:09:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:11,983 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 15:09:11,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:09:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 15:09:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:09:11,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:11,984 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:11,984 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times [2018-02-04 15:09:11,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:11,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 15:09:12,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,035 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 15:09:12,035 INFO L182 omatonBuilderFactory]: Interpolants [643#true, 644#false, 645#(<= main_~i~0 0), 646#(<= main_~i~0 1), 647#(<= main_~i~0 (+ main_~x~0 1)), 648#(<= main_~i~0 main_~x~0)] [2018-02-04 15:09:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:09:12,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:09:12,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:09:12,036 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-02-04 15:09:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,097 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 15:09:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:09:12,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 15:09:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,098 INFO L225 Difference]: With dead ends: 59 [2018-02-04 15:09:12,099 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:09:12,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:09:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:09:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 15:09:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:09:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 15:09:12,102 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-02-04 15:09:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,102 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 15:09:12,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:09:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 15:09:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:09:12,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,103 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,103 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times [2018-02-04 15:09:12,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 15:09:12,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,175 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 15:09:12,175 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 762#true, 763#false, 764#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 765#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 766#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 767#(and (<= main_~i~0 3) (<= 3 main_~i~0))] [2018-02-04 15:09:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:09:12,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:09:12,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:09:12,176 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-02-04 15:09:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,248 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 15:09:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:09:12,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 15:09:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,249 INFO L225 Difference]: With dead ends: 94 [2018-02-04 15:09:12,249 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 15:09:12,249 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 15:09:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 15:09:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-02-04 15:09:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 15:09:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 15:09:12,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-02-04 15:09:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,253 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 15:09:12,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:09:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 15:09:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:09:12,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,254 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,254 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 155329936, now seen corresponding path program 2 times [2018-02-04 15:09:12,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 15:09:12,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 15:09:12,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,311 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 15:09:12,311 INFO L182 omatonBuilderFactory]: Interpolants [918#true, 919#false, 920#(<= main_~i~0 99999), 921#(and (<= main_~i~0 99999) (<= 0 main_~x~0)), 922#(and (<= 1 main_~x~0) (<= main_~i~0 99999)), 923#(and (<= 1 main_~x~0) (<= main_~x~0 99998))] [2018-02-04 15:09:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 15:09:12,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:09:12,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:09:12,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:09:12,312 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 15:09:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,340 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-04 15:09:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:09:12,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 15:09:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,340 INFO L225 Difference]: With dead ends: 55 [2018-02-04 15:09:12,340 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 15:09:12,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:09:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 15:09:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 15:09:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 15:09:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 15:09:12,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-02-04 15:09:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,342 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 15:09:12,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:09:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 15:09:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:09:12,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,343 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,343 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times [2018-02-04 15:09:12,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 15:09:12,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,413 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 15:09:12,413 INFO L182 omatonBuilderFactory]: Interpolants [1024#(<= main_~i~0 3), 1025#(<= main_~i~0 4), 1026#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1027#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1019#true, 1020#false, 1021#(<= main_~i~0 0), 1022#(<= main_~i~0 1), 1023#(<= main_~i~0 2)] [2018-02-04 15:09:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:09:12,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:09:12,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:09:12,414 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 9 states. [2018-02-04 15:09:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,493 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 15:09:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:09:12,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 15:09:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,494 INFO L225 Difference]: With dead ends: 43 [2018-02-04 15:09:12,494 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 15:09:12,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:09:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 15:09:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 15:09:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 15:09:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 15:09:12,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-02-04 15:09:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,498 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 15:09:12,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:09:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 15:09:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 15:09:12,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,498 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,499 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times [2018-02-04 15:09:12,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:09:12,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,574 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 15:09:12,574 INFO L182 omatonBuilderFactory]: Interpolants [1124#true, 1125#false, 1126#(<= main_~i~0 0), 1127#(<= main_~i~0 1), 1128#(<= main_~i~0 2), 1129#(<= main_~i~0 3), 1130#(<= main_~i~0 4), 1131#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1132#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1133#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-02-04 15:09:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:09:12,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:09:12,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:09:12,575 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 10 states. [2018-02-04 15:09:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,692 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 15:09:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:09:12,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 15:09:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,692 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:09:12,692 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 15:09:12,693 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 15:09:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 15:09:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 15:09:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:09:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 15:09:12,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-02-04 15:09:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,695 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 15:09:12,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:09:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 15:09:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 15:09:12,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,695 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,695 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times [2018-02-04 15:09:12,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:09:12,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,788 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 15:09:12,788 INFO L182 omatonBuilderFactory]: Interpolants [1248#(<= main_~i~0 4), 1249#(<= main_~i~0 5), 1250#(<= main_~i~0 6), 1251#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1252#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1242#true, 1243#false, 1244#(<= main_~i~0 0), 1245#(<= main_~i~0 1), 1246#(<= main_~i~0 2), 1247#(<= main_~i~0 3)] [2018-02-04 15:09:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:09:12,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:09:12,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:09:12,789 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-02-04 15:09:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:12,877 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 15:09:12,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:09:12,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 15:09:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:12,878 INFO L225 Difference]: With dead ends: 53 [2018-02-04 15:09:12,878 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 15:09:12,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:09:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 15:09:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 15:09:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 15:09:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 15:09:12,880 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-02-04 15:09:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:12,880 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 15:09:12,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:09:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 15:09:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 15:09:12,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:12,881 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:12,881 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times [2018-02-04 15:09:12,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:12,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:12,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:09:12,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:12,970 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 15:09:12,970 INFO L182 omatonBuilderFactory]: Interpolants [1376#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1377#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1378#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1379#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1380#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1381#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1382#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1383#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 1373#true, 1374#false, 1375#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-02-04 15:09:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:12,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:09:12,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:09:12,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:09:12,971 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-02-04 15:09:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:13,080 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-04 15:09:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:09:13,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 15:09:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:13,081 INFO L225 Difference]: With dead ends: 58 [2018-02-04 15:09:13,081 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 15:09:13,081 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 15:09:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 15:09:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 15:09:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 15:09:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-04 15:09:13,084 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-02-04 15:09:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:13,084 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-04 15:09:13,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:09:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-04 15:09:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 15:09:13,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:13,085 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:13,085 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times [2018-02-04 15:09:13,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:13,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:13,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:09:13,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:13,152 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 15:09:13,152 INFO L182 omatonBuilderFactory]: Interpolants [1504#(<= main_~i~0 2), 1505#(<= main_~i~0 3), 1506#(<= main_~i~0 4), 1507#(<= main_~i~0 5), 1508#(<= main_~i~0 6), 1509#(<= main_~i~0 7), 1510#(<= main_~i~0 8), 1511#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1512#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1500#true, 1501#false, 1502#(<= main_~i~0 0), 1503#(<= main_~i~0 1)] [2018-02-04 15:09:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:09:13,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:09:13,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:09:13,152 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2018-02-04 15:09:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:13,245 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 15:09:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:09:13,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-04 15:09:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:13,245 INFO L225 Difference]: With dead ends: 63 [2018-02-04 15:09:13,245 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 15:09:13,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:09:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 15:09:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 15:09:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 15:09:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 15:09:13,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-02-04 15:09:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:13,248 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 15:09:13,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:09:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 15:09:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 15:09:13,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:13,248 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:13,248 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times [2018-02-04 15:09:13,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:13,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:13,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:09:13,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:13,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 15:09:13,354 INFO L182 omatonBuilderFactory]: Interpolants [1664#(<= main_~i~0 5), 1665#(<= main_~i~0 6), 1666#(<= main_~i~0 7), 1667#(<= main_~i~0 8), 1668#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1669#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1670#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 1657#true, 1658#false, 1659#(<= main_~i~0 0), 1660#(<= main_~i~0 1), 1661#(<= main_~i~0 2), 1662#(<= main_~i~0 3), 1663#(<= main_~i~0 4)] [2018-02-04 15:09:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:09:13,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:09:13,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:09:13,355 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-04 15:09:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:13,525 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 15:09:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:09:13,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-04 15:09:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:13,526 INFO L225 Difference]: With dead ends: 68 [2018-02-04 15:09:13,526 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 15:09:13,527 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 15:09:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 15:09:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 15:09:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 15:09:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 15:09:13,529 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-02-04 15:09:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:13,529 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 15:09:13,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:09:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 15:09:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 15:09:13,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:13,530 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:13,530 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:13,535 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times [2018-02-04 15:09:13,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:13,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:13,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:09:13,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:13,638 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 15:09:13,638 INFO L182 omatonBuilderFactory]: Interpolants [1827#true, 1828#false, 1829#(<= main_~i~0 0), 1830#(<= main_~i~0 1), 1831#(<= main_~i~0 2), 1832#(<= main_~i~0 3), 1833#(<= main_~i~0 4), 1834#(<= main_~i~0 5), 1835#(<= main_~i~0 6), 1836#(<= main_~i~0 7), 1837#(<= main_~i~0 8), 1838#(<= main_~i~0 9), 1839#(<= main_~i~0 10), 1840#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 1841#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-02-04 15:09:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:09:13,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:09:13,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:09:13,639 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 15 states. [2018-02-04 15:09:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:13,772 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-04 15:09:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:09:13,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 15:09:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:13,773 INFO L225 Difference]: With dead ends: 73 [2018-02-04 15:09:13,773 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 15:09:13,773 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 15:09:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 15:09:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 15:09:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 15:09:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-04 15:09:13,775 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-02-04 15:09:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:13,775 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-04 15:09:13,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:09:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-04 15:09:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 15:09:13,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:13,776 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:13,776 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times [2018-02-04 15:09:13,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:13,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:13,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:09:13,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:13,890 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 15:09:13,890 INFO L182 omatonBuilderFactory]: Interpolants [2016#(<= main_~i~0 4), 2017#(<= main_~i~0 5), 2018#(<= main_~i~0 6), 2019#(<= main_~i~0 7), 2020#(<= main_~i~0 8), 2021#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2022#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2023#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2024#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2025#(and (<= 4 main_~i~0) (<= main_~i~0 12)), 2010#true, 2011#false, 2012#(<= main_~i~0 0), 2013#(<= main_~i~0 1), 2014#(<= main_~i~0 2), 2015#(<= main_~i~0 3)] [2018-02-04 15:09:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:13,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:09:13,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:09:13,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:09:13,891 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 16 states. [2018-02-04 15:09:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:14,082 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-04 15:09:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:09:14,082 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-04 15:09:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:14,083 INFO L225 Difference]: With dead ends: 78 [2018-02-04 15:09:14,083 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 15:09:14,083 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 15:09:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 15:09:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 15:09:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 15:09:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-04 15:09:14,085 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-02-04 15:09:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:14,086 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-04 15:09:14,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:09:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-04 15:09:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 15:09:14,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:14,087 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:14,087 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times [2018-02-04 15:09:14,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:14,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:14,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 15:09:14,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:14,215 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 15:09:14,215 INFO L182 omatonBuilderFactory]: Interpolants [2208#(<= main_~i~0 0), 2209#(<= main_~i~0 1), 2210#(<= main_~i~0 2), 2211#(<= main_~i~0 3), 2212#(<= main_~i~0 4), 2213#(<= main_~i~0 5), 2214#(<= main_~i~0 6), 2215#(<= main_~i~0 7), 2216#(<= main_~i~0 8), 2217#(<= main_~i~0 9), 2218#(<= main_~i~0 10), 2219#(<= main_~i~0 11), 2220#(<= main_~i~0 12), 2221#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2222#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 2206#true, 2207#false] [2018-02-04 15:09:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 15:09:14,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 15:09:14,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:09:14,216 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-02-04 15:09:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:14,432 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-04 15:09:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:09:14,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 15:09:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:14,433 INFO L225 Difference]: With dead ends: 83 [2018-02-04 15:09:14,433 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 15:09:14,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:09:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 15:09:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 15:09:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 15:09:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-04 15:09:14,436 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-02-04 15:09:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:14,436 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-04 15:09:14,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 15:09:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-04 15:09:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 15:09:14,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:14,437 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:14,437 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times [2018-02-04 15:09:14,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:14,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:14,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:09:14,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:14,572 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 15:09:14,572 INFO L182 omatonBuilderFactory]: Interpolants [2432#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 2415#true, 2416#false, 2417#(<= main_~i~0 0), 2418#(<= main_~i~0 1), 2419#(<= main_~i~0 2), 2420#(<= main_~i~0 3), 2421#(<= main_~i~0 4), 2422#(<= main_~i~0 5), 2423#(<= main_~i~0 6), 2424#(<= main_~i~0 7), 2425#(<= main_~i~0 8), 2426#(<= main_~i~0 9), 2427#(<= main_~i~0 10), 2428#(<= main_~i~0 11), 2429#(<= main_~i~0 12), 2430#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2431#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-02-04 15:09:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:09:14,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:09:14,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:09:14,573 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-02-04 15:09:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:14,776 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-04 15:09:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:09:14,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 15:09:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:14,777 INFO L225 Difference]: With dead ends: 88 [2018-02-04 15:09:14,777 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 15:09:14,777 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 15:09:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 15:09:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 15:09:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 15:09:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-04 15:09:14,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-02-04 15:09:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:14,779 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-04 15:09:14,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:09:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-04 15:09:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 15:09:14,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:14,779 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:14,779 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times [2018-02-04 15:09:14,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:14,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:14,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:09:14,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:14,882 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 15:09:14,882 INFO L182 omatonBuilderFactory]: Interpolants [2637#true, 2638#false, 2639#(<= main_~i~0 0), 2640#(<= main_~i~0 1), 2641#(<= main_~i~0 2), 2642#(<= main_~i~0 3), 2643#(<= main_~i~0 4), 2644#(<= main_~i~0 5), 2645#(<= main_~i~0 6), 2646#(<= main_~i~0 7), 2647#(<= main_~i~0 8), 2648#(<= main_~i~0 9), 2649#(<= main_~i~0 10), 2650#(<= main_~i~0 11), 2651#(<= main_~i~0 12), 2652#(<= main_~i~0 13), 2653#(<= main_~i~0 14), 2654#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 2655#(and (<= 1 main_~i~0) (<= main_~i~0 15))] [2018-02-04 15:09:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:14,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:09:14,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:09:14,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:09:14,883 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 19 states. [2018-02-04 15:09:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:15,078 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-04 15:09:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 15:09:15,079 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-04 15:09:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:15,079 INFO L225 Difference]: With dead ends: 93 [2018-02-04 15:09:15,079 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 15:09:15,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:09:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 15:09:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 15:09:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 15:09:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-04 15:09:15,081 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-02-04 15:09:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:15,081 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-04 15:09:15,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:09:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-04 15:09:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 15:09:15,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:15,082 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:15,082 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times [2018-02-04 15:09:15,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:15,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:15,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:15,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:09:15,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:15,281 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 15:09:15,281 INFO L182 omatonBuilderFactory]: Interpolants [2880#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 2881#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 2882#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 2883#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 2884#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 2885#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 2886#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 2887#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 2888#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 2889#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 2890#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 2872#true, 2873#false, 2874#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 2875#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 2876#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 2877#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 2878#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 2879#(and (<= 5 main_~i~0) (<= main_~i~0 5))] [2018-02-04 15:09:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:15,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:09:15,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:09:15,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:09:15,282 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-02-04 15:09:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:15,623 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-04 15:09:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 15:09:15,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 15:09:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:15,624 INFO L225 Difference]: With dead ends: 98 [2018-02-04 15:09:15,624 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 15:09:15,624 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 15:09:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 15:09:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 15:09:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 15:09:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-02-04 15:09:15,626 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-02-04 15:09:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:15,626 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-02-04 15:09:15,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:09:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-02-04 15:09:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 15:09:15,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:15,627 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:15,627 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times [2018-02-04 15:09:15,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:15,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:15,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:15,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 15:09:15,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:15,776 INFO L182 omatonBuilderFactory]: Interpolants [3104#(<= main_~i~0 15), 3105#(<= main_~i~0 16), 3106#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3107#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3087#true, 3088#false, 3089#(<= main_~i~0 0), 3090#(<= main_~i~0 1), 3091#(<= main_~i~0 2), 3092#(<= main_~i~0 3), 3093#(<= main_~i~0 4), 3094#(<= main_~i~0 5), 3095#(<= main_~i~0 6), 3096#(<= main_~i~0 7), 3097#(<= main_~i~0 8), 3098#(<= main_~i~0 9), 3099#(<= main_~i~0 10), 3100#(<= main_~i~0 11), 3101#(<= main_~i~0 12), 3102#(<= main_~i~0 13), 3103#(<= main_~i~0 14)] [2018-02-04 15:09:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:15,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 15:09:15,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 15:09:15,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:09:15,777 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 21 states. [2018-02-04 15:09:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:16,000 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-02-04 15:09:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 15:09:16,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-02-04 15:09:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:16,000 INFO L225 Difference]: With dead ends: 103 [2018-02-04 15:09:16,000 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 15:09:16,001 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 15:09:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 15:09:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-04 15:09:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 15:09:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-02-04 15:09:16,002 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-02-04 15:09:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:16,003 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-02-04 15:09:16,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 15:09:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-02-04 15:09:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 15:09:16,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:16,003 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:16,003 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:16,003 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times [2018-02-04 15:09:16,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:16,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:16,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:16,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 15:09:16,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:16,150 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 15:09:16,150 INFO L182 omatonBuilderFactory]: Interpolants [3360#(<= main_~i~0 10), 3361#(<= main_~i~0 11), 3362#(<= main_~i~0 12), 3363#(<= main_~i~0 13), 3364#(<= main_~i~0 14), 3365#(<= main_~i~0 15), 3366#(<= main_~i~0 16), 3367#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3368#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3369#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3348#true, 3349#false, 3350#(<= main_~i~0 0), 3351#(<= main_~i~0 1), 3352#(<= main_~i~0 2), 3353#(<= main_~i~0 3), 3354#(<= main_~i~0 4), 3355#(<= main_~i~0 5), 3356#(<= main_~i~0 6), 3357#(<= main_~i~0 7), 3358#(<= main_~i~0 8), 3359#(<= main_~i~0 9)] [2018-02-04 15:09:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:16,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:09:16,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:09:16,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:09:16,152 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 22 states. [2018-02-04 15:09:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:16,376 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-02-04 15:09:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:09:16,376 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-02-04 15:09:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:16,377 INFO L225 Difference]: With dead ends: 108 [2018-02-04 15:09:16,377 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 15:09:16,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:09:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 15:09:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 15:09:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 15:09:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-04 15:09:16,380 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-02-04 15:09:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:16,380 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-04 15:09:16,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:09:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-04 15:09:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 15:09:16,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:16,381 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:16,381 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:16,381 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times [2018-02-04 15:09:16,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:16,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:16,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:16,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 15:09:16,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:16,557 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 15:09:16,557 INFO L182 omatonBuilderFactory]: Interpolants [3622#true, 3623#false, 3624#(<= main_~i~0 0), 3625#(<= main_~i~0 1), 3626#(<= main_~i~0 2), 3627#(<= main_~i~0 3), 3628#(<= main_~i~0 4), 3629#(<= main_~i~0 5), 3630#(<= main_~i~0 6), 3631#(<= main_~i~0 7), 3632#(<= main_~i~0 8), 3633#(<= main_~i~0 9), 3634#(<= main_~i~0 10), 3635#(<= main_~i~0 11), 3636#(<= main_~i~0 12), 3637#(<= main_~i~0 13), 3638#(<= main_~i~0 14), 3639#(<= main_~i~0 15), 3640#(<= main_~i~0 16), 3641#(<= main_~i~0 17), 3642#(<= main_~i~0 18), 3643#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 3644#(and (<= 1 main_~i~0) (<= main_~i~0 19))] [2018-02-04 15:09:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:16,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 15:09:16,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 15:09:16,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 15:09:16,558 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-02-04 15:09:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:16,775 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-02-04 15:09:16,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:09:16,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-04 15:09:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:16,776 INFO L225 Difference]: With dead ends: 113 [2018-02-04 15:09:16,776 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 15:09:16,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:09:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 15:09:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 15:09:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 15:09:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-04 15:09:16,778 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-02-04 15:09:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:16,779 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-04 15:09:16,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 15:09:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-04 15:09:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 15:09:16,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:16,779 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:16,780 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times [2018-02-04 15:09:16,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:16,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:17,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:17,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 15:09:17,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:17,002 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 15:09:17,002 INFO L182 omatonBuilderFactory]: Interpolants [3909#true, 3910#false, 3911#(<= main_~i~0 0), 3912#(<= main_~i~0 1), 3913#(<= main_~i~0 2), 3914#(<= main_~i~0 3), 3915#(<= main_~i~0 4), 3916#(<= main_~i~0 5), 3917#(<= main_~i~0 6), 3918#(<= main_~i~0 7), 3919#(<= main_~i~0 8), 3920#(<= main_~i~0 9), 3921#(<= main_~i~0 10), 3922#(<= main_~i~0 11), 3923#(<= main_~i~0 12), 3924#(<= main_~i~0 13), 3925#(<= main_~i~0 14), 3926#(<= main_~i~0 15), 3927#(<= main_~i~0 16), 3928#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3929#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3930#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3931#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 3932#(and (<= 4 main_~i~0) (<= main_~i~0 20))] [2018-02-04 15:09:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:17,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 15:09:17,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 15:09:17,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:09:17,004 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-02-04 15:09:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:17,471 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-02-04 15:09:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 15:09:17,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 15:09:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:17,472 INFO L225 Difference]: With dead ends: 118 [2018-02-04 15:09:17,472 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 15:09:17,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:09:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 15:09:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 15:09:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 15:09:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-02-04 15:09:17,475 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-02-04 15:09:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:17,476 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-02-04 15:09:17,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 15:09:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-02-04 15:09:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 15:09:17,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:17,476 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:17,476 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times [2018-02-04 15:09:17,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:17,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:17,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:17,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 15:09:17,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:17,692 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 15:09:17,692 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= main_~i~0 13), 4225#(<= main_~i~0 14), 4226#(<= main_~i~0 15), 4227#(<= main_~i~0 16), 4228#(<= main_~i~0 17), 4229#(<= main_~i~0 18), 4230#(<= main_~i~0 19), 4231#(<= main_~i~0 20), 4232#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4233#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4209#true, 4210#false, 4211#(<= main_~i~0 0), 4212#(<= main_~i~0 1), 4213#(<= main_~i~0 2), 4214#(<= main_~i~0 3), 4215#(<= main_~i~0 4), 4216#(<= main_~i~0 5), 4217#(<= main_~i~0 6), 4218#(<= main_~i~0 7), 4219#(<= main_~i~0 8), 4220#(<= main_~i~0 9), 4221#(<= main_~i~0 10), 4222#(<= main_~i~0 11), 4223#(<= main_~i~0 12)] [2018-02-04 15:09:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:17,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 15:09:17,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 15:09:17,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:09:17,693 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-02-04 15:09:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:17,999 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-02-04 15:09:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:09:17,999 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 15:09:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:18,000 INFO L225 Difference]: With dead ends: 123 [2018-02-04 15:09:18,000 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 15:09:18,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:09:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 15:09:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 15:09:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 15:09:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-02-04 15:09:18,002 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-02-04 15:09:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:18,002 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-02-04 15:09:18,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 15:09:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-02-04 15:09:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 15:09:18,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:18,002 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:18,002 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times [2018-02-04 15:09:18,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:18,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:18,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:18,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:09:18,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:18,220 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 15:09:18,220 INFO L182 omatonBuilderFactory]: Interpolants [4544#(<= main_~i~0 20), 4545#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4546#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4547#(and (<= 2 main_~i~0) (<= main_~i~0 22)), 4522#true, 4523#false, 4524#(<= main_~i~0 0), 4525#(<= main_~i~0 1), 4526#(<= main_~i~0 2), 4527#(<= main_~i~0 3), 4528#(<= main_~i~0 4), 4529#(<= main_~i~0 5), 4530#(<= main_~i~0 6), 4531#(<= main_~i~0 7), 4532#(<= main_~i~0 8), 4533#(<= main_~i~0 9), 4534#(<= main_~i~0 10), 4535#(<= main_~i~0 11), 4536#(<= main_~i~0 12), 4537#(<= main_~i~0 13), 4538#(<= main_~i~0 14), 4539#(<= main_~i~0 15), 4540#(<= main_~i~0 16), 4541#(<= main_~i~0 17), 4542#(<= main_~i~0 18), 4543#(<= main_~i~0 19)] [2018-02-04 15:09:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:18,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:09:18,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:09:18,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:09:18,221 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-02-04 15:09:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:18,551 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-02-04 15:09:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:09:18,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 15:09:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:18,552 INFO L225 Difference]: With dead ends: 128 [2018-02-04 15:09:18,552 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 15:09:18,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:09:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 15:09:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 15:09:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 15:09:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-02-04 15:09:18,554 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-02-04 15:09:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:18,554 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-02-04 15:09:18,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:09:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-02-04 15:09:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 15:09:18,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:18,554 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:18,554 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times [2018-02-04 15:09:18,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:18,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:18,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:18,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 15:09:18,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:18,825 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 15:09:18,825 INFO L182 omatonBuilderFactory]: Interpolants [4864#(<= main_~i~0 14), 4865#(<= main_~i~0 15), 4866#(<= main_~i~0 16), 4867#(<= main_~i~0 17), 4868#(<= main_~i~0 18), 4869#(<= main_~i~0 19), 4870#(<= main_~i~0 20), 4871#(<= main_~i~0 21), 4872#(<= main_~i~0 22), 4873#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 4874#(and (<= 1 main_~i~0) (<= main_~i~0 23)), 4848#true, 4849#false, 4850#(<= main_~i~0 0), 4851#(<= main_~i~0 1), 4852#(<= main_~i~0 2), 4853#(<= main_~i~0 3), 4854#(<= main_~i~0 4), 4855#(<= main_~i~0 5), 4856#(<= main_~i~0 6), 4857#(<= main_~i~0 7), 4858#(<= main_~i~0 8), 4859#(<= main_~i~0 9), 4860#(<= main_~i~0 10), 4861#(<= main_~i~0 11), 4862#(<= main_~i~0 12), 4863#(<= main_~i~0 13)] [2018-02-04 15:09:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:18,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 15:09:18,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 15:09:18,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:09:18,827 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 27 states. [2018-02-04 15:09:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:19,226 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-04 15:09:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 15:09:19,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-02-04 15:09:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:19,227 INFO L225 Difference]: With dead ends: 133 [2018-02-04 15:09:19,227 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 15:09:19,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:09:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 15:09:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 15:09:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 15:09:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-02-04 15:09:19,229 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-02-04 15:09:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:19,229 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-02-04 15:09:19,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 15:09:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-02-04 15:09:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 15:09:19,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:19,230 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:19,230 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times [2018-02-04 15:09:19,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:19,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:19,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:19,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 15:09:19,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:19,478 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 15:09:19,478 INFO L182 omatonBuilderFactory]: Interpolants [5187#true, 5188#false, 5189#(<= main_~i~0 0), 5190#(<= main_~i~0 1), 5191#(<= main_~i~0 2), 5192#(<= main_~i~0 3), 5193#(<= main_~i~0 4), 5194#(<= main_~i~0 5), 5195#(<= main_~i~0 6), 5196#(<= main_~i~0 7), 5197#(<= main_~i~0 8), 5198#(<= main_~i~0 9), 5199#(<= main_~i~0 10), 5200#(<= main_~i~0 11), 5201#(<= main_~i~0 12), 5202#(<= main_~i~0 13), 5203#(<= main_~i~0 14), 5204#(<= main_~i~0 15), 5205#(<= main_~i~0 16), 5206#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5207#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5208#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5209#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 5210#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 5211#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 5212#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 5213#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 5214#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-02-04 15:09:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:19,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 15:09:19,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 15:09:19,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:09:19,479 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 28 states. [2018-02-04 15:09:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:19,967 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-02-04 15:09:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 15:09:19,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-02-04 15:09:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:19,967 INFO L225 Difference]: With dead ends: 138 [2018-02-04 15:09:19,968 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 15:09:19,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:09:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 15:09:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 15:09:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 15:09:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-02-04 15:09:19,971 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-02-04 15:09:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:19,971 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-02-04 15:09:19,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 15:09:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-02-04 15:09:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 15:09:19,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:19,972 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:19,972 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times [2018-02-04 15:09:19,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:19,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:20,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:20,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 15:09:20,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:20,219 INFO L182 omatonBuilderFactory]: Interpolants [5539#true, 5540#false, 5541#(<= main_~i~0 0), 5542#(<= main_~i~0 1), 5543#(<= main_~i~0 2), 5544#(<= main_~i~0 3), 5545#(<= main_~i~0 4), 5546#(<= main_~i~0 5), 5547#(<= main_~i~0 6), 5548#(<= main_~i~0 7), 5549#(<= main_~i~0 8), 5550#(<= main_~i~0 9), 5551#(<= main_~i~0 10), 5552#(<= main_~i~0 11), 5553#(<= main_~i~0 12), 5554#(<= main_~i~0 13), 5555#(<= main_~i~0 14), 5556#(<= main_~i~0 15), 5557#(<= main_~i~0 16), 5558#(<= main_~i~0 17), 5559#(<= main_~i~0 18), 5560#(<= main_~i~0 19), 5561#(<= main_~i~0 20), 5562#(<= main_~i~0 21), 5563#(<= main_~i~0 22), 5564#(<= main_~i~0 23), 5565#(<= main_~i~0 24), 5566#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5567#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-02-04 15:09:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:20,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 15:09:20,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 15:09:20,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:09:20,220 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-02-04 15:09:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:20,549 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-02-04 15:09:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 15:09:20,549 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-04 15:09:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:20,549 INFO L225 Difference]: With dead ends: 143 [2018-02-04 15:09:20,549 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 15:09:20,550 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 15:09:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 15:09:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 15:09:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 15:09:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-02-04 15:09:20,552 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-02-04 15:09:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:20,552 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-02-04 15:09:20,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 15:09:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-02-04 15:09:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 15:09:20,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:20,553 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:20,553 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times [2018-02-04 15:09:20,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:20,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:20,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:20,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 15:09:20,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:20,805 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 15:09:20,806 INFO L182 omatonBuilderFactory]: Interpolants [5904#true, 5905#false, 5906#(<= main_~i~0 0), 5907#(<= main_~i~0 1), 5908#(<= main_~i~0 2), 5909#(<= main_~i~0 3), 5910#(<= main_~i~0 4), 5911#(<= main_~i~0 5), 5912#(<= main_~i~0 6), 5913#(<= main_~i~0 7), 5914#(<= main_~i~0 8), 5915#(<= main_~i~0 9), 5916#(<= main_~i~0 10), 5917#(<= main_~i~0 11), 5918#(<= main_~i~0 12), 5919#(<= main_~i~0 13), 5920#(<= main_~i~0 14), 5921#(<= main_~i~0 15), 5922#(<= main_~i~0 16), 5923#(<= main_~i~0 17), 5924#(<= main_~i~0 18), 5925#(<= main_~i~0 19), 5926#(<= main_~i~0 20), 5927#(<= main_~i~0 21), 5928#(<= main_~i~0 22), 5929#(<= main_~i~0 23), 5930#(<= main_~i~0 24), 5931#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5932#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5933#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-02-04 15:09:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:20,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 15:09:20,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 15:09:20,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:09:20,807 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-02-04 15:09:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:21,178 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-02-04 15:09:21,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 15:09:21,178 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-04 15:09:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:21,179 INFO L225 Difference]: With dead ends: 148 [2018-02-04 15:09:21,179 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 15:09:21,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:09:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 15:09:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-04 15:09:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 15:09:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-04 15:09:21,182 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-02-04 15:09:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:21,182 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-04 15:09:21,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 15:09:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-04 15:09:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 15:09:21,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:21,183 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:21,183 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times [2018-02-04 15:09:21,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:21,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:21,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:21,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 15:09:21,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:21,530 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 15:09:21,530 INFO L182 omatonBuilderFactory]: Interpolants [6282#true, 6283#false, 6284#(<= main_~i~0 0), 6285#(<= main_~i~0 1), 6286#(<= main_~i~0 2), 6287#(<= main_~i~0 3), 6288#(<= main_~i~0 4), 6289#(<= main_~i~0 5), 6290#(<= main_~i~0 6), 6291#(<= main_~i~0 7), 6292#(<= main_~i~0 8), 6293#(<= main_~i~0 9), 6294#(<= main_~i~0 10), 6295#(<= main_~i~0 11), 6296#(<= main_~i~0 12), 6297#(<= main_~i~0 13), 6298#(<= main_~i~0 14), 6299#(<= main_~i~0 15), 6300#(<= main_~i~0 16), 6301#(<= main_~i~0 17), 6302#(<= main_~i~0 18), 6303#(<= main_~i~0 19), 6304#(<= main_~i~0 20), 6305#(<= main_~i~0 21), 6306#(<= main_~i~0 22), 6307#(<= main_~i~0 23), 6308#(<= main_~i~0 24), 6309#(<= main_~i~0 25), 6310#(<= main_~i~0 26), 6311#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 6312#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-02-04 15:09:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:21,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 15:09:21,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 15:09:21,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:09:21,531 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-02-04 15:09:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:21,880 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-02-04 15:09:21,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 15:09:21,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-04 15:09:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:21,881 INFO L225 Difference]: With dead ends: 153 [2018-02-04 15:09:21,881 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 15:09:21,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:09:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 15:09:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-04 15:09:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 15:09:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-02-04 15:09:21,883 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-02-04 15:09:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:21,883 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-02-04 15:09:21,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 15:09:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-02-04 15:09:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 15:09:21,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:21,884 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:21,884 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times [2018-02-04 15:09:21,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:21,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:22,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:22,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 15:09:22,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:22,137 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 15:09:22,137 INFO L182 omatonBuilderFactory]: Interpolants [6673#true, 6674#false, 6675#(<= main_~i~0 0), 6676#(<= main_~i~0 1), 6677#(<= main_~i~0 2), 6678#(<= main_~i~0 3), 6679#(<= main_~i~0 4), 6680#(<= main_~i~0 5), 6681#(<= main_~i~0 6), 6682#(<= main_~i~0 7), 6683#(<= main_~i~0 8), 6684#(<= main_~i~0 9), 6685#(<= main_~i~0 10), 6686#(<= main_~i~0 11), 6687#(<= main_~i~0 12), 6688#(<= main_~i~0 13), 6689#(<= main_~i~0 14), 6690#(<= main_~i~0 15), 6691#(<= main_~i~0 16), 6692#(<= main_~i~0 17), 6693#(<= main_~i~0 18), 6694#(<= main_~i~0 19), 6695#(<= main_~i~0 20), 6696#(<= main_~i~0 21), 6697#(<= main_~i~0 22), 6698#(<= main_~i~0 23), 6699#(<= main_~i~0 24), 6700#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 6701#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 6702#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 6703#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 6704#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-02-04 15:09:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:22,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 15:09:22,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 15:09:22,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:09:22,138 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 32 states. [2018-02-04 15:09:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:22,717 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-02-04 15:09:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 15:09:22,717 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-02-04 15:09:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:22,718 INFO L225 Difference]: With dead ends: 158 [2018-02-04 15:09:22,718 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 15:09:22,719 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 15:09:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 15:09:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-04 15:09:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 15:09:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-04 15:09:22,722 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-02-04 15:09:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:22,723 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-04 15:09:22,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 15:09:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-04 15:09:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 15:09:22,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:22,724 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:22,724 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times [2018-02-04 15:09:22,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:22,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:23,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:23,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 15:09:23,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:23,119 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 15:09:23,119 INFO L182 omatonBuilderFactory]: Interpolants [7104#(<= main_~i~0 25), 7105#(<= main_~i~0 26), 7106#(<= main_~i~0 27), 7107#(<= main_~i~0 28), 7108#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7109#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7077#true, 7078#false, 7079#(<= main_~i~0 0), 7080#(<= main_~i~0 1), 7081#(<= main_~i~0 2), 7082#(<= main_~i~0 3), 7083#(<= main_~i~0 4), 7084#(<= main_~i~0 5), 7085#(<= main_~i~0 6), 7086#(<= main_~i~0 7), 7087#(<= main_~i~0 8), 7088#(<= main_~i~0 9), 7089#(<= main_~i~0 10), 7090#(<= main_~i~0 11), 7091#(<= main_~i~0 12), 7092#(<= main_~i~0 13), 7093#(<= main_~i~0 14), 7094#(<= main_~i~0 15), 7095#(<= main_~i~0 16), 7096#(<= main_~i~0 17), 7097#(<= main_~i~0 18), 7098#(<= main_~i~0 19), 7099#(<= main_~i~0 20), 7100#(<= main_~i~0 21), 7101#(<= main_~i~0 22), 7102#(<= main_~i~0 23), 7103#(<= main_~i~0 24)] [2018-02-04 15:09:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:23,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 15:09:23,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 15:09:23,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:09:23,121 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 33 states. [2018-02-04 15:09:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:23,493 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-02-04 15:09:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 15:09:23,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-02-04 15:09:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:23,493 INFO L225 Difference]: With dead ends: 163 [2018-02-04 15:09:23,494 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 15:09:23,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:09:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 15:09:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 15:09:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 15:09:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-02-04 15:09:23,496 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-02-04 15:09:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:23,496 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-02-04 15:09:23,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 15:09:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-02-04 15:09:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 15:09:23,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:23,496 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:23,497 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times [2018-02-04 15:09:23,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:23,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:23,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:23,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 15:09:23,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:23,878 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 15:09:23,878 INFO L182 omatonBuilderFactory]: Interpolants [7494#true, 7495#false, 7496#(<= main_~i~0 0), 7497#(<= main_~i~0 1), 7498#(<= main_~i~0 2), 7499#(<= main_~i~0 3), 7500#(<= main_~i~0 4), 7501#(<= main_~i~0 5), 7502#(<= main_~i~0 6), 7503#(<= main_~i~0 7), 7504#(<= main_~i~0 8), 7505#(<= main_~i~0 9), 7506#(<= main_~i~0 10), 7507#(<= main_~i~0 11), 7508#(<= main_~i~0 12), 7509#(<= main_~i~0 13), 7510#(<= main_~i~0 14), 7511#(<= main_~i~0 15), 7512#(<= main_~i~0 16), 7513#(<= main_~i~0 17), 7514#(<= main_~i~0 18), 7515#(<= main_~i~0 19), 7516#(<= main_~i~0 20), 7517#(<= main_~i~0 21), 7518#(<= main_~i~0 22), 7519#(<= main_~i~0 23), 7520#(<= main_~i~0 24), 7521#(<= main_~i~0 25), 7522#(<= main_~i~0 26), 7523#(<= main_~i~0 27), 7524#(<= main_~i~0 28), 7525#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7526#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7527#(and (<= 2 main_~i~0) (<= main_~i~0 30))] [2018-02-04 15:09:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:23,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 15:09:23,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 15:09:23,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:09:23,879 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 34 states. [2018-02-04 15:09:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:24,330 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-02-04 15:09:24,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 15:09:24,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-02-04 15:09:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:24,331 INFO L225 Difference]: With dead ends: 168 [2018-02-04 15:09:24,331 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 15:09:24,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:09:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 15:09:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-04 15:09:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 15:09:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-02-04 15:09:24,334 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-02-04 15:09:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:24,334 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-02-04 15:09:24,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 15:09:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-02-04 15:09:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 15:09:24,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:24,334 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:24,335 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times [2018-02-04 15:09:24,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:24,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:24,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:24,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 15:09:24,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:24,707 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 15:09:24,707 INFO L182 omatonBuilderFactory]: Interpolants [7936#(<= main_~i~0 10), 7937#(<= main_~i~0 11), 7938#(<= main_~i~0 12), 7939#(<= main_~i~0 13), 7940#(<= main_~i~0 14), 7941#(<= main_~i~0 15), 7942#(<= main_~i~0 16), 7943#(<= main_~i~0 17), 7944#(<= main_~i~0 18), 7945#(<= main_~i~0 19), 7946#(<= main_~i~0 20), 7947#(<= main_~i~0 21), 7948#(<= main_~i~0 22), 7949#(<= main_~i~0 23), 7950#(<= main_~i~0 24), 7951#(<= main_~i~0 25), 7952#(<= main_~i~0 26), 7953#(<= main_~i~0 27), 7954#(<= main_~i~0 28), 7955#(<= main_~i~0 29), 7956#(<= main_~i~0 30), 7957#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 7958#(and (<= 1 main_~i~0) (<= main_~i~0 31)), 7924#true, 7925#false, 7926#(<= main_~i~0 0), 7927#(<= main_~i~0 1), 7928#(<= main_~i~0 2), 7929#(<= main_~i~0 3), 7930#(<= main_~i~0 4), 7931#(<= main_~i~0 5), 7932#(<= main_~i~0 6), 7933#(<= main_~i~0 7), 7934#(<= main_~i~0 8), 7935#(<= main_~i~0 9)] [2018-02-04 15:09:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:24,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 15:09:24,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 15:09:24,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:09:24,708 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-02-04 15:09:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:25,158 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-04 15:09:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 15:09:25,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-04 15:09:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:25,159 INFO L225 Difference]: With dead ends: 173 [2018-02-04 15:09:25,159 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 15:09:25,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 15:09:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 15:09:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-02-04 15:09:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 15:09:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-02-04 15:09:25,162 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-02-04 15:09:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:25,162 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-02-04 15:09:25,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 15:09:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-02-04 15:09:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 15:09:25,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:25,162 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:25,162 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times [2018-02-04 15:09:25,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:25,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:25,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:25,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 15:09:25,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:25,732 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 15:09:25,732 INFO L182 omatonBuilderFactory]: Interpolants [8384#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 8385#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 8386#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 8387#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 8388#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 8389#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 8390#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 8391#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 8392#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 8393#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 8394#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 8395#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 8396#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 8397#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 8398#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 8399#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 8400#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 8401#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 8367#true, 8368#false, 8369#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 8370#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 8371#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 8372#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 8373#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 8374#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 8375#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 8376#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 8377#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 8378#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 8379#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 8380#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 8381#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 8382#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 8383#(and (<= main_~i~0 14) (<= 14 main_~i~0))] [2018-02-04 15:09:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:25,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 15:09:25,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 15:09:25,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:09:25,733 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-02-04 15:09:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:26,777 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-02-04 15:09:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 15:09:26,777 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 15:09:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:26,778 INFO L225 Difference]: With dead ends: 178 [2018-02-04 15:09:26,778 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 15:09:26,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:09:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 15:09:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-04 15:09:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 15:09:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-02-04 15:09:26,781 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-02-04 15:09:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:26,781 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-02-04 15:09:26,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 15:09:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-02-04 15:09:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 15:09:26,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:26,782 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:26,782 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times [2018-02-04 15:09:26,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:26,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:27,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:27,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 15:09:27,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:27,218 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 15:09:27,218 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= main_~i~0 8), 8769#(<= main_~i~0 9), 8770#(<= main_~i~0 10), 8771#(<= main_~i~0 11), 8772#(<= main_~i~0 12), 8773#(<= main_~i~0 13), 8774#(<= main_~i~0 14), 8775#(<= main_~i~0 15), 8776#(<= main_~i~0 16), 8777#(<= main_~i~0 17), 8778#(<= main_~i~0 18), 8779#(<= main_~i~0 19), 8780#(<= main_~i~0 20), 8781#(<= main_~i~0 21), 8782#(<= main_~i~0 22), 8783#(<= main_~i~0 23), 8784#(<= main_~i~0 24), 8785#(<= main_~i~0 25), 8786#(<= main_~i~0 26), 8787#(<= main_~i~0 27), 8788#(<= main_~i~0 28), 8789#(<= main_~i~0 29), 8790#(<= main_~i~0 30), 8791#(<= main_~i~0 31), 8792#(<= main_~i~0 32), 8793#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 8794#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 8758#true, 8759#false, 8760#(<= main_~i~0 0), 8761#(<= main_~i~0 1), 8762#(<= main_~i~0 2), 8763#(<= main_~i~0 3), 8764#(<= main_~i~0 4), 8765#(<= main_~i~0 5), 8766#(<= main_~i~0 6), 8767#(<= main_~i~0 7)] [2018-02-04 15:09:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:27,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 15:09:27,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 15:09:27,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:09:27,219 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-02-04 15:09:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:27,704 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-02-04 15:09:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 15:09:27,704 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-04 15:09:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:27,705 INFO L225 Difference]: With dead ends: 183 [2018-02-04 15:09:27,705 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 15:09:27,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:09:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 15:09:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-04 15:09:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 15:09:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-02-04 15:09:27,708 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-02-04 15:09:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:27,708 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-02-04 15:09:27,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 15:09:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-02-04 15:09:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 15:09:27,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:27,709 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:27,709 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times [2018-02-04 15:09:27,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:27,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:28,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:28,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 15:09:28,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:28,145 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 15:09:28,145 INFO L182 omatonBuilderFactory]: Interpolants [9227#true, 9228#false, 9229#(<= main_~i~0 0), 9230#(<= main_~i~0 1), 9231#(<= main_~i~0 2), 9232#(<= main_~i~0 3), 9233#(<= main_~i~0 4), 9234#(<= main_~i~0 5), 9235#(<= main_~i~0 6), 9236#(<= main_~i~0 7), 9237#(<= main_~i~0 8), 9238#(<= main_~i~0 9), 9239#(<= main_~i~0 10), 9240#(<= main_~i~0 11), 9241#(<= main_~i~0 12), 9242#(<= main_~i~0 13), 9243#(<= main_~i~0 14), 9244#(<= main_~i~0 15), 9245#(<= main_~i~0 16), 9246#(<= main_~i~0 17), 9247#(<= main_~i~0 18), 9248#(<= main_~i~0 19), 9249#(<= main_~i~0 20), 9250#(<= main_~i~0 21), 9251#(<= main_~i~0 22), 9252#(<= main_~i~0 23), 9253#(<= main_~i~0 24), 9254#(<= main_~i~0 25), 9255#(<= main_~i~0 26), 9256#(<= main_~i~0 27), 9257#(<= main_~i~0 28), 9258#(<= main_~i~0 29), 9259#(<= main_~i~0 30), 9260#(<= main_~i~0 31), 9261#(<= main_~i~0 32), 9262#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 9263#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 9264#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-02-04 15:09:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:28,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 15:09:28,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 15:09:28,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 15:09:28,146 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-02-04 15:09:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:28,707 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-02-04 15:09:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 15:09:28,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-04 15:09:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:28,708 INFO L225 Difference]: With dead ends: 188 [2018-02-04 15:09:28,708 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 15:09:28,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 15:09:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 15:09:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 15:09:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 15:09:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-04 15:09:28,710 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-02-04 15:09:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:28,710 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-04 15:09:28,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 15:09:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-04 15:09:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 15:09:28,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:28,711 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:28,711 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times [2018-02-04 15:09:28,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:28,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:29,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:29,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 15:09:29,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:29,142 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 15:09:29,142 INFO L182 omatonBuilderFactory]: Interpolants [9728#(<= main_~i~0 17), 9729#(<= main_~i~0 18), 9730#(<= main_~i~0 19), 9731#(<= main_~i~0 20), 9732#(<= main_~i~0 21), 9733#(<= main_~i~0 22), 9734#(<= main_~i~0 23), 9735#(<= main_~i~0 24), 9736#(<= main_~i~0 25), 9737#(<= main_~i~0 26), 9738#(<= main_~i~0 27), 9739#(<= main_~i~0 28), 9740#(<= main_~i~0 29), 9741#(<= main_~i~0 30), 9742#(<= main_~i~0 31), 9743#(<= main_~i~0 32), 9744#(<= main_~i~0 33), 9745#(<= main_~i~0 34), 9746#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 9747#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 9709#true, 9710#false, 9711#(<= main_~i~0 0), 9712#(<= main_~i~0 1), 9713#(<= main_~i~0 2), 9714#(<= main_~i~0 3), 9715#(<= main_~i~0 4), 9716#(<= main_~i~0 5), 9717#(<= main_~i~0 6), 9718#(<= main_~i~0 7), 9719#(<= main_~i~0 8), 9720#(<= main_~i~0 9), 9721#(<= main_~i~0 10), 9722#(<= main_~i~0 11), 9723#(<= main_~i~0 12), 9724#(<= main_~i~0 13), 9725#(<= main_~i~0 14), 9726#(<= main_~i~0 15), 9727#(<= main_~i~0 16)] [2018-02-04 15:09:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:29,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 15:09:29,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 15:09:29,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:09:29,143 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 39 states. [2018-02-04 15:09:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:29,668 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-02-04 15:09:29,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 15:09:29,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-02-04 15:09:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:29,669 INFO L225 Difference]: With dead ends: 193 [2018-02-04 15:09:29,669 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 15:09:29,669 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 15:09:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 15:09:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 15:09:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 15:09:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-02-04 15:09:29,671 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-02-04 15:09:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:29,671 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-02-04 15:09:29,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 15:09:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-02-04 15:09:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 15:09:29,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:29,672 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:29,672 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times [2018-02-04 15:09:29,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:29,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:30,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:30,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 15:09:30,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:30,077 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 15:09:30,078 INFO L182 omatonBuilderFactory]: Interpolants [10240#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 10241#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 10242#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 10243#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 10204#true, 10205#false, 10206#(<= main_~i~0 0), 10207#(<= main_~i~0 1), 10208#(<= main_~i~0 2), 10209#(<= main_~i~0 3), 10210#(<= main_~i~0 4), 10211#(<= main_~i~0 5), 10212#(<= main_~i~0 6), 10213#(<= main_~i~0 7), 10214#(<= main_~i~0 8), 10215#(<= main_~i~0 9), 10216#(<= main_~i~0 10), 10217#(<= main_~i~0 11), 10218#(<= main_~i~0 12), 10219#(<= main_~i~0 13), 10220#(<= main_~i~0 14), 10221#(<= main_~i~0 15), 10222#(<= main_~i~0 16), 10223#(<= main_~i~0 17), 10224#(<= main_~i~0 18), 10225#(<= main_~i~0 19), 10226#(<= main_~i~0 20), 10227#(<= main_~i~0 21), 10228#(<= main_~i~0 22), 10229#(<= main_~i~0 23), 10230#(<= main_~i~0 24), 10231#(<= main_~i~0 25), 10232#(<= main_~i~0 26), 10233#(<= main_~i~0 27), 10234#(<= main_~i~0 28), 10235#(<= main_~i~0 29), 10236#(<= main_~i~0 30), 10237#(<= main_~i~0 31), 10238#(<= main_~i~0 32), 10239#(and (<= 0 main_~i~0) (<= main_~i~0 32))] [2018-02-04 15:09:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:30,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 15:09:30,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 15:09:30,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:09:30,079 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 40 states. [2018-02-04 15:09:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:30,764 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-02-04 15:09:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 15:09:30,765 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-02-04 15:09:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:30,765 INFO L225 Difference]: With dead ends: 198 [2018-02-04 15:09:30,765 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 15:09:30,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:09:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 15:09:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-02-04 15:09:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 15:09:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-02-04 15:09:30,767 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-02-04 15:09:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:30,767 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-02-04 15:09:30,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 15:09:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-02-04 15:09:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 15:09:30,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:30,768 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:30,769 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times [2018-02-04 15:09:30,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:30,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:31,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:31,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 15:09:31,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:31,322 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 15:09:31,323 INFO L182 omatonBuilderFactory]: Interpolants [10752#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 10712#true, 10713#false, 10714#(<= main_~i~0 0), 10715#(<= main_~i~0 1), 10716#(<= main_~i~0 2), 10717#(<= main_~i~0 3), 10718#(<= main_~i~0 4), 10719#(<= main_~i~0 5), 10720#(<= main_~i~0 6), 10721#(<= main_~i~0 7), 10722#(<= main_~i~0 8), 10723#(<= main_~i~0 9), 10724#(<= main_~i~0 10), 10725#(<= main_~i~0 11), 10726#(<= main_~i~0 12), 10727#(<= main_~i~0 13), 10728#(<= main_~i~0 14), 10729#(<= main_~i~0 15), 10730#(<= main_~i~0 16), 10731#(<= main_~i~0 17), 10732#(<= main_~i~0 18), 10733#(<= main_~i~0 19), 10734#(<= main_~i~0 20), 10735#(<= main_~i~0 21), 10736#(<= main_~i~0 22), 10737#(<= main_~i~0 23), 10738#(<= main_~i~0 24), 10739#(<= main_~i~0 25), 10740#(<= main_~i~0 26), 10741#(<= main_~i~0 27), 10742#(<= main_~i~0 28), 10743#(<= main_~i~0 29), 10744#(<= main_~i~0 30), 10745#(<= main_~i~0 31), 10746#(<= main_~i~0 32), 10747#(<= main_~i~0 33), 10748#(<= main_~i~0 34), 10749#(<= main_~i~0 35), 10750#(<= main_~i~0 36), 10751#(and (<= 0 main_~i~0) (<= main_~i~0 36))] [2018-02-04 15:09:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:31,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 15:09:31,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 15:09:31,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:09:31,324 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-02-04 15:09:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:31,930 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-02-04 15:09:31,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 15:09:31,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-04 15:09:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:31,931 INFO L225 Difference]: With dead ends: 203 [2018-02-04 15:09:31,931 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 15:09:31,931 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 15:09:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 15:09:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-04 15:09:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 15:09:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-02-04 15:09:31,933 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-02-04 15:09:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:31,933 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-02-04 15:09:31,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 15:09:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-02-04 15:09:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 15:09:31,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:31,933 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:31,933 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times [2018-02-04 15:09:31,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:31,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:32,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:32,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:09:32,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:32,345 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 15:09:32,345 INFO L182 omatonBuilderFactory]: Interpolants [11264#(<= main_~i~0 29), 11265#(<= main_~i~0 30), 11266#(<= main_~i~0 31), 11267#(<= main_~i~0 32), 11268#(<= main_~i~0 33), 11269#(<= main_~i~0 34), 11270#(<= main_~i~0 35), 11271#(<= main_~i~0 36), 11272#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 11273#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 11274#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 11233#true, 11234#false, 11235#(<= main_~i~0 0), 11236#(<= main_~i~0 1), 11237#(<= main_~i~0 2), 11238#(<= main_~i~0 3), 11239#(<= main_~i~0 4), 11240#(<= main_~i~0 5), 11241#(<= main_~i~0 6), 11242#(<= main_~i~0 7), 11243#(<= main_~i~0 8), 11244#(<= main_~i~0 9), 11245#(<= main_~i~0 10), 11246#(<= main_~i~0 11), 11247#(<= main_~i~0 12), 11248#(<= main_~i~0 13), 11249#(<= main_~i~0 14), 11250#(<= main_~i~0 15), 11251#(<= main_~i~0 16), 11252#(<= main_~i~0 17), 11253#(<= main_~i~0 18), 11254#(<= main_~i~0 19), 11255#(<= main_~i~0 20), 11256#(<= main_~i~0 21), 11257#(<= main_~i~0 22), 11258#(<= main_~i~0 23), 11259#(<= main_~i~0 24), 11260#(<= main_~i~0 25), 11261#(<= main_~i~0 26), 11262#(<= main_~i~0 27), 11263#(<= main_~i~0 28)] [2018-02-04 15:09:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:32,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:09:32,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:09:32,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:09:32,347 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-02-04 15:09:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:33,012 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-02-04 15:09:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 15:09:33,012 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-04 15:09:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:33,013 INFO L225 Difference]: With dead ends: 208 [2018-02-04 15:09:33,013 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 15:09:33,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 15:09:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 15:09:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 15:09:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 15:09:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-02-04 15:09:33,015 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-02-04 15:09:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:33,015 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-02-04 15:09:33,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:09:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-02-04 15:09:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 15:09:33,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:33,016 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:33,016 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times [2018-02-04 15:09:33,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:33,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:33,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:33,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 15:09:33,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:33,462 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 15:09:33,462 INFO L182 omatonBuilderFactory]: Interpolants [11776#(<= main_~i~0 7), 11777#(<= main_~i~0 8), 11778#(<= main_~i~0 9), 11779#(<= main_~i~0 10), 11780#(<= main_~i~0 11), 11781#(<= main_~i~0 12), 11782#(<= main_~i~0 13), 11783#(<= main_~i~0 14), 11784#(<= main_~i~0 15), 11785#(<= main_~i~0 16), 11786#(<= main_~i~0 17), 11787#(<= main_~i~0 18), 11788#(<= main_~i~0 19), 11789#(<= main_~i~0 20), 11790#(<= main_~i~0 21), 11791#(<= main_~i~0 22), 11792#(<= main_~i~0 23), 11793#(<= main_~i~0 24), 11794#(<= main_~i~0 25), 11795#(<= main_~i~0 26), 11796#(<= main_~i~0 27), 11797#(<= main_~i~0 28), 11798#(<= main_~i~0 29), 11799#(<= main_~i~0 30), 11800#(<= main_~i~0 31), 11801#(<= main_~i~0 32), 11802#(<= main_~i~0 33), 11803#(<= main_~i~0 34), 11804#(<= main_~i~0 35), 11805#(<= main_~i~0 36), 11806#(<= main_~i~0 37), 11807#(<= main_~i~0 38), 11808#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 11809#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 11767#true, 11768#false, 11769#(<= main_~i~0 0), 11770#(<= main_~i~0 1), 11771#(<= main_~i~0 2), 11772#(<= main_~i~0 3), 11773#(<= main_~i~0 4), 11774#(<= main_~i~0 5), 11775#(<= main_~i~0 6)] [2018-02-04 15:09:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:33,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 15:09:33,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 15:09:33,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:09:33,462 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-02-04 15:09:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:34,091 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-04 15:09:34,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 15:09:34,091 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 15:09:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:34,092 INFO L225 Difference]: With dead ends: 213 [2018-02-04 15:09:34,092 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 15:09:34,092 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 15:09:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 15:09:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-04 15:09:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 15:09:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-02-04 15:09:34,094 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-02-04 15:09:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:34,094 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-02-04 15:09:34,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 15:09:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-02-04 15:09:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 15:09:34,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:34,095 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:34,095 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times [2018-02-04 15:09:34,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:34,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:34,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:34,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 15:09:34,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:34,559 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 15:09:34,560 INFO L182 omatonBuilderFactory]: Interpolants [12352#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 12353#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 12354#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 12355#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 12356#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 12357#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 12314#true, 12315#false, 12316#(<= main_~i~0 0), 12317#(<= main_~i~0 1), 12318#(<= main_~i~0 2), 12319#(<= main_~i~0 3), 12320#(<= main_~i~0 4), 12321#(<= main_~i~0 5), 12322#(<= main_~i~0 6), 12323#(<= main_~i~0 7), 12324#(<= main_~i~0 8), 12325#(<= main_~i~0 9), 12326#(<= main_~i~0 10), 12327#(<= main_~i~0 11), 12328#(<= main_~i~0 12), 12329#(<= main_~i~0 13), 12330#(<= main_~i~0 14), 12331#(<= main_~i~0 15), 12332#(<= main_~i~0 16), 12333#(<= main_~i~0 17), 12334#(<= main_~i~0 18), 12335#(<= main_~i~0 19), 12336#(<= main_~i~0 20), 12337#(<= main_~i~0 21), 12338#(<= main_~i~0 22), 12339#(<= main_~i~0 23), 12340#(<= main_~i~0 24), 12341#(<= main_~i~0 25), 12342#(<= main_~i~0 26), 12343#(<= main_~i~0 27), 12344#(<= main_~i~0 28), 12345#(<= main_~i~0 29), 12346#(<= main_~i~0 30), 12347#(<= main_~i~0 31), 12348#(<= main_~i~0 32), 12349#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 12350#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 12351#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-02-04 15:09:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:34,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 15:09:34,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 15:09:34,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:09:34,560 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-02-04 15:09:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:35,543 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-02-04 15:09:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 15:09:35,543 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-04 15:09:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:35,544 INFO L225 Difference]: With dead ends: 218 [2018-02-04 15:09:35,544 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 15:09:35,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 15:09:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 15:09:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 15:09:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 15:09:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-02-04 15:09:35,546 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-02-04 15:09:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:35,546 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-02-04 15:09:35,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 15:09:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-02-04 15:09:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 15:09:35,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:35,546 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:35,547 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times [2018-02-04 15:09:35,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:35,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:36,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:36,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 15:09:36,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:36,102 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 15:09:36,102 INFO L182 omatonBuilderFactory]: Interpolants [12874#true, 12875#false, 12876#(<= main_~i~0 0), 12877#(<= main_~i~0 1), 12878#(<= main_~i~0 2), 12879#(<= main_~i~0 3), 12880#(<= main_~i~0 4), 12881#(<= main_~i~0 5), 12882#(<= main_~i~0 6), 12883#(<= main_~i~0 7), 12884#(<= main_~i~0 8), 12885#(<= main_~i~0 9), 12886#(<= main_~i~0 10), 12887#(<= main_~i~0 11), 12888#(<= main_~i~0 12), 12889#(<= main_~i~0 13), 12890#(<= main_~i~0 14), 12891#(<= main_~i~0 15), 12892#(<= main_~i~0 16), 12893#(<= main_~i~0 17), 12894#(<= main_~i~0 18), 12895#(<= main_~i~0 19), 12896#(<= main_~i~0 20), 12897#(<= main_~i~0 21), 12898#(<= main_~i~0 22), 12899#(<= main_~i~0 23), 12900#(<= main_~i~0 24), 12901#(<= main_~i~0 25), 12902#(<= main_~i~0 26), 12903#(<= main_~i~0 27), 12904#(<= main_~i~0 28), 12905#(<= main_~i~0 29), 12906#(<= main_~i~0 30), 12907#(<= main_~i~0 31), 12908#(<= main_~i~0 32), 12909#(<= main_~i~0 33), 12910#(<= main_~i~0 34), 12911#(<= main_~i~0 35), 12912#(<= main_~i~0 36), 12913#(<= main_~i~0 37), 12914#(<= main_~i~0 38), 12915#(<= main_~i~0 39), 12916#(<= main_~i~0 40), 12917#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 12918#(and (<= 1 main_~i~0) (<= main_~i~0 41))] [2018-02-04 15:09:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:36,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 15:09:36,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 15:09:36,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:09:36,103 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 45 states. [2018-02-04 15:09:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:36,752 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-02-04 15:09:36,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 15:09:36,753 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-02-04 15:09:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:36,753 INFO L225 Difference]: With dead ends: 223 [2018-02-04 15:09:36,753 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 15:09:36,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 15:09:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 15:09:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-04 15:09:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 15:09:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-02-04 15:09:36,756 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-02-04 15:09:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:36,756 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-02-04 15:09:36,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 15:09:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-02-04 15:09:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 15:09:36,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:36,758 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:36,758 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times [2018-02-04 15:09:36,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:36,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:37,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:37,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 15:09:37,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:37,276 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 15:09:37,276 INFO L182 omatonBuilderFactory]: Interpolants [13447#true, 13448#false, 13449#(<= main_~i~0 0), 13450#(<= main_~i~0 1), 13451#(<= main_~i~0 2), 13452#(<= main_~i~0 3), 13453#(<= main_~i~0 4), 13454#(<= main_~i~0 5), 13455#(<= main_~i~0 6), 13456#(<= main_~i~0 7), 13457#(<= main_~i~0 8), 13458#(<= main_~i~0 9), 13459#(<= main_~i~0 10), 13460#(<= main_~i~0 11), 13461#(<= main_~i~0 12), 13462#(<= main_~i~0 13), 13463#(<= main_~i~0 14), 13464#(<= main_~i~0 15), 13465#(<= main_~i~0 16), 13466#(<= main_~i~0 17), 13467#(<= main_~i~0 18), 13468#(<= main_~i~0 19), 13469#(<= main_~i~0 20), 13470#(<= main_~i~0 21), 13471#(<= main_~i~0 22), 13472#(<= main_~i~0 23), 13473#(<= main_~i~0 24), 13474#(<= main_~i~0 25), 13475#(<= main_~i~0 26), 13476#(<= main_~i~0 27), 13477#(<= main_~i~0 28), 13478#(<= main_~i~0 29), 13479#(<= main_~i~0 30), 13480#(<= main_~i~0 31), 13481#(<= main_~i~0 32), 13482#(<= main_~i~0 33), 13483#(<= main_~i~0 34), 13484#(<= main_~i~0 35), 13485#(<= main_~i~0 36), 13486#(<= main_~i~0 37), 13487#(<= main_~i~0 38), 13488#(<= main_~i~0 39), 13489#(<= main_~i~0 40), 13490#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 13491#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 13492#(and (<= 2 main_~i~0) (<= main_~i~0 42))] [2018-02-04 15:09:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:37,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 15:09:37,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 15:09:37,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:09:37,276 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 46 states. [2018-02-04 15:09:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:38,029 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-02-04 15:09:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 15:09:38,029 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-02-04 15:09:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:38,030 INFO L225 Difference]: With dead ends: 228 [2018-02-04 15:09:38,030 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 15:09:38,030 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 15:09:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 15:09:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-04 15:09:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 15:09:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-02-04 15:09:38,033 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-02-04 15:09:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:38,034 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-02-04 15:09:38,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 15:09:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-02-04 15:09:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 15:09:38,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:38,035 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:38,035 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times [2018-02-04 15:09:38,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:38,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:38,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:38,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 15:09:38,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:38,577 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 15:09:38,577 INFO L182 omatonBuilderFactory]: Interpolants [14033#true, 14034#false, 14035#(<= main_~i~0 0), 14036#(<= main_~i~0 1), 14037#(<= main_~i~0 2), 14038#(<= main_~i~0 3), 14039#(<= main_~i~0 4), 14040#(<= main_~i~0 5), 14041#(<= main_~i~0 6), 14042#(<= main_~i~0 7), 14043#(<= main_~i~0 8), 14044#(<= main_~i~0 9), 14045#(<= main_~i~0 10), 14046#(<= main_~i~0 11), 14047#(<= main_~i~0 12), 14048#(<= main_~i~0 13), 14049#(<= main_~i~0 14), 14050#(<= main_~i~0 15), 14051#(<= main_~i~0 16), 14052#(<= main_~i~0 17), 14053#(<= main_~i~0 18), 14054#(<= main_~i~0 19), 14055#(<= main_~i~0 20), 14056#(<= main_~i~0 21), 14057#(<= main_~i~0 22), 14058#(<= main_~i~0 23), 14059#(<= main_~i~0 24), 14060#(<= main_~i~0 25), 14061#(<= main_~i~0 26), 14062#(<= main_~i~0 27), 14063#(<= main_~i~0 28), 14064#(<= main_~i~0 29), 14065#(<= main_~i~0 30), 14066#(<= main_~i~0 31), 14067#(<= main_~i~0 32), 14068#(<= main_~i~0 33), 14069#(<= main_~i~0 34), 14070#(<= main_~i~0 35), 14071#(<= main_~i~0 36), 14072#(<= main_~i~0 37), 14073#(<= main_~i~0 38), 14074#(<= main_~i~0 39), 14075#(<= main_~i~0 40), 14076#(<= main_~i~0 41), 14077#(<= main_~i~0 42), 14078#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 14079#(and (<= 1 main_~i~0) (<= main_~i~0 43))] [2018-02-04 15:09:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:38,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 15:09:38,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 15:09:38,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 15:09:38,577 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-02-04 15:09:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:39,269 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-02-04 15:09:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 15:09:39,271 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-04 15:09:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:39,272 INFO L225 Difference]: With dead ends: 233 [2018-02-04 15:09:39,272 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 15:09:39,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 15:09:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 15:09:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-02-04 15:09:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 15:09:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-02-04 15:09:39,275 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-02-04 15:09:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:39,275 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-02-04 15:09:39,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 15:09:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-02-04 15:09:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 15:09:39,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:39,277 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:39,277 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times [2018-02-04 15:09:39,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:39,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:39,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:39,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 15:09:39,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:39,819 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 15:09:39,819 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 22), 14657#(<= main_~i~0 23), 14658#(<= main_~i~0 24), 14659#(<= main_~i~0 25), 14660#(<= main_~i~0 26), 14661#(<= main_~i~0 27), 14662#(<= main_~i~0 28), 14663#(<= main_~i~0 29), 14664#(<= main_~i~0 30), 14665#(<= main_~i~0 31), 14666#(<= main_~i~0 32), 14667#(<= main_~i~0 33), 14668#(<= main_~i~0 34), 14669#(<= main_~i~0 35), 14670#(<= main_~i~0 36), 14671#(<= main_~i~0 37), 14672#(<= main_~i~0 38), 14673#(<= main_~i~0 39), 14674#(<= main_~i~0 40), 14675#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 14676#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 14677#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 14678#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 14679#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 14632#true, 14633#false, 14634#(<= main_~i~0 0), 14635#(<= main_~i~0 1), 14636#(<= main_~i~0 2), 14637#(<= main_~i~0 3), 14638#(<= main_~i~0 4), 14639#(<= main_~i~0 5), 14640#(<= main_~i~0 6), 14641#(<= main_~i~0 7), 14642#(<= main_~i~0 8), 14643#(<= main_~i~0 9), 14644#(<= main_~i~0 10), 14645#(<= main_~i~0 11), 14646#(<= main_~i~0 12), 14647#(<= main_~i~0 13), 14648#(<= main_~i~0 14), 14649#(<= main_~i~0 15), 14650#(<= main_~i~0 16), 14651#(<= main_~i~0 17), 14652#(<= main_~i~0 18), 14653#(<= main_~i~0 19), 14654#(<= main_~i~0 20), 14655#(<= main_~i~0 21)] [2018-02-04 15:09:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:39,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 15:09:39,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 15:09:39,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:09:39,820 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 48 states. [2018-02-04 15:09:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:40,713 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-02-04 15:09:40,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 15:09:40,713 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-02-04 15:09:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:40,713 INFO L225 Difference]: With dead ends: 238 [2018-02-04 15:09:40,713 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 15:09:40,714 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 15:09:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 15:09:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 15:09:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 15:09:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-02-04 15:09:40,716 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-02-04 15:09:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:40,717 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-02-04 15:09:40,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 15:09:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-02-04 15:09:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 15:09:40,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:40,718 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:40,718 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times [2018-02-04 15:09:40,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:40,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:41,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:41,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 15:09:41,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:41,359 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 15:09:41,360 INFO L182 omatonBuilderFactory]: Interpolants [15244#true, 15245#false, 15246#(<= main_~i~0 0), 15247#(<= main_~i~0 1), 15248#(<= main_~i~0 2), 15249#(<= main_~i~0 3), 15250#(<= main_~i~0 4), 15251#(<= main_~i~0 5), 15252#(<= main_~i~0 6), 15253#(<= main_~i~0 7), 15254#(<= main_~i~0 8), 15255#(<= main_~i~0 9), 15256#(<= main_~i~0 10), 15257#(<= main_~i~0 11), 15258#(<= main_~i~0 12), 15259#(<= main_~i~0 13), 15260#(<= main_~i~0 14), 15261#(<= main_~i~0 15), 15262#(<= main_~i~0 16), 15263#(<= main_~i~0 17), 15264#(<= main_~i~0 18), 15265#(<= main_~i~0 19), 15266#(<= main_~i~0 20), 15267#(<= main_~i~0 21), 15268#(<= main_~i~0 22), 15269#(<= main_~i~0 23), 15270#(<= main_~i~0 24), 15271#(<= main_~i~0 25), 15272#(<= main_~i~0 26), 15273#(<= main_~i~0 27), 15274#(<= main_~i~0 28), 15275#(<= main_~i~0 29), 15276#(<= main_~i~0 30), 15277#(<= main_~i~0 31), 15278#(<= main_~i~0 32), 15279#(<= main_~i~0 33), 15280#(<= main_~i~0 34), 15281#(<= main_~i~0 35), 15282#(<= main_~i~0 36), 15283#(<= main_~i~0 37), 15284#(<= main_~i~0 38), 15285#(<= main_~i~0 39), 15286#(<= main_~i~0 40), 15287#(<= main_~i~0 41), 15288#(<= main_~i~0 42), 15289#(<= main_~i~0 43), 15290#(<= main_~i~0 44), 15291#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15292#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-02-04 15:09:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:41,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 15:09:41,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 15:09:41,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:09:41,360 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-02-04 15:09:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:42,129 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-02-04 15:09:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 15:09:42,129 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-04 15:09:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:42,129 INFO L225 Difference]: With dead ends: 243 [2018-02-04 15:09:42,129 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 15:09:42,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 15:09:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 15:09:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-04 15:09:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 15:09:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-02-04 15:09:42,132 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-02-04 15:09:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:42,132 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-02-04 15:09:42,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 15:09:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-02-04 15:09:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 15:09:42,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:42,134 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:42,134 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times [2018-02-04 15:09:42,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:42,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:42,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:42,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 15:09:42,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:42,744 INFO L182 omatonBuilderFactory]: Interpolants [15872#(<= main_~i~0 1), 15873#(<= main_~i~0 2), 15874#(<= main_~i~0 3), 15875#(<= main_~i~0 4), 15876#(<= main_~i~0 5), 15877#(<= main_~i~0 6), 15878#(<= main_~i~0 7), 15879#(<= main_~i~0 8), 15880#(<= main_~i~0 9), 15881#(<= main_~i~0 10), 15882#(<= main_~i~0 11), 15883#(<= main_~i~0 12), 15884#(<= main_~i~0 13), 15885#(<= main_~i~0 14), 15886#(<= main_~i~0 15), 15887#(<= main_~i~0 16), 15888#(<= main_~i~0 17), 15889#(<= main_~i~0 18), 15890#(<= main_~i~0 19), 15891#(<= main_~i~0 20), 15892#(<= main_~i~0 21), 15893#(<= main_~i~0 22), 15894#(<= main_~i~0 23), 15895#(<= main_~i~0 24), 15896#(<= main_~i~0 25), 15897#(<= main_~i~0 26), 15898#(<= main_~i~0 27), 15899#(<= main_~i~0 28), 15900#(<= main_~i~0 29), 15901#(<= main_~i~0 30), 15902#(<= main_~i~0 31), 15903#(<= main_~i~0 32), 15904#(<= main_~i~0 33), 15905#(<= main_~i~0 34), 15906#(<= main_~i~0 35), 15907#(<= main_~i~0 36), 15908#(<= main_~i~0 37), 15909#(<= main_~i~0 38), 15910#(<= main_~i~0 39), 15911#(<= main_~i~0 40), 15912#(<= main_~i~0 41), 15913#(<= main_~i~0 42), 15914#(<= main_~i~0 43), 15915#(<= main_~i~0 44), 15916#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15917#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 15918#(and (<= 2 main_~i~0) (<= main_~i~0 46)), 15869#true, 15870#false, 15871#(<= main_~i~0 0)] [2018-02-04 15:09:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:42,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 15:09:42,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 15:09:42,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:09:42,745 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-02-04 15:09:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:43,613 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-02-04 15:09:43,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 15:09:43,614 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-04 15:09:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:43,615 INFO L225 Difference]: With dead ends: 248 [2018-02-04 15:09:43,615 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 15:09:43,615 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 15:09:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 15:09:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-02-04 15:09:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 15:09:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-02-04 15:09:43,617 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-02-04 15:09:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:43,617 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-02-04 15:09:43,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 15:09:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-02-04 15:09:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 15:09:43,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:43,618 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:43,619 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times [2018-02-04 15:09:43,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:43,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:44,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:44,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 15:09:44,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:44,236 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 15:09:44,236 INFO L182 omatonBuilderFactory]: Interpolants [16512#(<= main_~i~0 3), 16513#(<= main_~i~0 4), 16514#(<= main_~i~0 5), 16515#(<= main_~i~0 6), 16516#(<= main_~i~0 7), 16517#(<= main_~i~0 8), 16518#(<= main_~i~0 9), 16519#(<= main_~i~0 10), 16520#(<= main_~i~0 11), 16521#(<= main_~i~0 12), 16522#(<= main_~i~0 13), 16523#(<= main_~i~0 14), 16524#(<= main_~i~0 15), 16525#(<= main_~i~0 16), 16526#(<= main_~i~0 17), 16527#(<= main_~i~0 18), 16528#(<= main_~i~0 19), 16529#(<= main_~i~0 20), 16530#(<= main_~i~0 21), 16531#(<= main_~i~0 22), 16532#(<= main_~i~0 23), 16533#(<= main_~i~0 24), 16534#(<= main_~i~0 25), 16535#(<= main_~i~0 26), 16536#(<= main_~i~0 27), 16537#(<= main_~i~0 28), 16538#(<= main_~i~0 29), 16539#(<= main_~i~0 30), 16540#(<= main_~i~0 31), 16541#(<= main_~i~0 32), 16542#(<= main_~i~0 33), 16543#(<= main_~i~0 34), 16544#(<= main_~i~0 35), 16545#(<= main_~i~0 36), 16546#(<= main_~i~0 37), 16547#(<= main_~i~0 38), 16548#(<= main_~i~0 39), 16549#(<= main_~i~0 40), 16550#(<= main_~i~0 41), 16551#(<= main_~i~0 42), 16552#(<= main_~i~0 43), 16553#(<= main_~i~0 44), 16554#(<= main_~i~0 45), 16555#(<= main_~i~0 46), 16556#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 16557#(and (<= 1 main_~i~0) (<= main_~i~0 47)), 16507#true, 16508#false, 16509#(<= main_~i~0 0), 16510#(<= main_~i~0 1), 16511#(<= main_~i~0 2)] [2018-02-04 15:09:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:44,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 15:09:44,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 15:09:44,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:09:44,237 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 51 states. [2018-02-04 15:09:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:45,056 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-02-04 15:09:45,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 15:09:45,057 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-02-04 15:09:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:45,057 INFO L225 Difference]: With dead ends: 253 [2018-02-04 15:09:45,057 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 15:09:45,058 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 15:09:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 15:09:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-02-04 15:09:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 15:09:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-02-04 15:09:45,061 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-02-04 15:09:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:45,061 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-02-04 15:09:45,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 15:09:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-02-04 15:09:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 15:09:45,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:45,062 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:45,062 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times [2018-02-04 15:09:45,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:45,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:45,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:45,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 15:09:45,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:45,727 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 15:09:45,727 INFO L182 omatonBuilderFactory]: Interpolants [17158#true, 17159#false, 17160#(<= main_~i~0 0), 17161#(<= main_~i~0 1), 17162#(<= main_~i~0 2), 17163#(<= main_~i~0 3), 17164#(<= main_~i~0 4), 17165#(<= main_~i~0 5), 17166#(<= main_~i~0 6), 17167#(<= main_~i~0 7), 17168#(<= main_~i~0 8), 17169#(<= main_~i~0 9), 17170#(<= main_~i~0 10), 17171#(<= main_~i~0 11), 17172#(<= main_~i~0 12), 17173#(<= main_~i~0 13), 17174#(<= main_~i~0 14), 17175#(<= main_~i~0 15), 17176#(<= main_~i~0 16), 17177#(<= main_~i~0 17), 17178#(<= main_~i~0 18), 17179#(<= main_~i~0 19), 17180#(<= main_~i~0 20), 17181#(<= main_~i~0 21), 17182#(<= main_~i~0 22), 17183#(<= main_~i~0 23), 17184#(<= main_~i~0 24), 17185#(<= main_~i~0 25), 17186#(<= main_~i~0 26), 17187#(<= main_~i~0 27), 17188#(<= main_~i~0 28), 17189#(<= main_~i~0 29), 17190#(<= main_~i~0 30), 17191#(<= main_~i~0 31), 17192#(<= main_~i~0 32), 17193#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 17194#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17195#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 17196#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 17197#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 17198#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 17199#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 17200#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 17201#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 17202#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 17203#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 17204#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 17205#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 17206#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 17207#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 17208#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 17209#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-02-04 15:09:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:45,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 15:09:45,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 15:09:45,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:09:45,728 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 52 states. [2018-02-04 15:09:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:47,550 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-02-04 15:09:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 15:09:47,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-02-04 15:09:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:47,551 INFO L225 Difference]: With dead ends: 258 [2018-02-04 15:09:47,551 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 15:09:47,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 15:09:47,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 15:09:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-02-04 15:09:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 15:09:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-02-04 15:09:47,553 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-02-04 15:09:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:47,554 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-02-04 15:09:47,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 15:09:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-02-04 15:09:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 15:09:47,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:47,554 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:47,554 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times [2018-02-04 15:09:47,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:47,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:48,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:48,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 15:09:48,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:48,350 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 15:09:48,350 INFO L182 omatonBuilderFactory]: Interpolants [17822#true, 17823#false, 17824#(<= main_~i~0 0), 17825#(<= main_~i~0 1), 17826#(<= main_~i~0 2), 17827#(<= main_~i~0 3), 17828#(<= main_~i~0 4), 17829#(<= main_~i~0 5), 17830#(<= main_~i~0 6), 17831#(<= main_~i~0 7), 17832#(<= main_~i~0 8), 17833#(<= main_~i~0 9), 17834#(<= main_~i~0 10), 17835#(<= main_~i~0 11), 17836#(<= main_~i~0 12), 17837#(<= main_~i~0 13), 17838#(<= main_~i~0 14), 17839#(<= main_~i~0 15), 17840#(<= main_~i~0 16), 17841#(<= main_~i~0 17), 17842#(<= main_~i~0 18), 17843#(<= main_~i~0 19), 17844#(<= main_~i~0 20), 17845#(<= main_~i~0 21), 17846#(<= main_~i~0 22), 17847#(<= main_~i~0 23), 17848#(<= main_~i~0 24), 17849#(<= main_~i~0 25), 17850#(<= main_~i~0 26), 17851#(<= main_~i~0 27), 17852#(<= main_~i~0 28), 17853#(<= main_~i~0 29), 17854#(<= main_~i~0 30), 17855#(<= main_~i~0 31), 17856#(<= main_~i~0 32), 17857#(<= main_~i~0 33), 17858#(<= main_~i~0 34), 17859#(<= main_~i~0 35), 17860#(<= main_~i~0 36), 17861#(<= main_~i~0 37), 17862#(<= main_~i~0 38), 17863#(<= main_~i~0 39), 17864#(<= main_~i~0 40), 17865#(<= main_~i~0 41), 17866#(<= main_~i~0 42), 17867#(<= main_~i~0 43), 17868#(<= main_~i~0 44), 17869#(<= main_~i~0 45), 17870#(<= main_~i~0 46), 17871#(<= main_~i~0 47), 17872#(<= main_~i~0 48), 17873#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 17874#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-02-04 15:09:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:48,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 15:09:48,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 15:09:48,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 15:09:48,351 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-02-04 15:09:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:49,281 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-02-04 15:09:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 15:09:49,281 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-04 15:09:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:49,282 INFO L225 Difference]: With dead ends: 263 [2018-02-04 15:09:49,282 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 15:09:49,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 15:09:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 15:09:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-04 15:09:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 15:09:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-02-04 15:09:49,284 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-02-04 15:09:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:49,284 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-02-04 15:09:49,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 15:09:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-02-04 15:09:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 15:09:49,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:49,285 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:49,285 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times [2018-02-04 15:09:49,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:49,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:50,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:50,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 15:09:50,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:50,012 INFO L182 omatonBuilderFactory]: Interpolants [18499#true, 18500#false, 18501#(<= main_~i~0 0), 18502#(<= main_~i~0 1), 18503#(<= main_~i~0 2), 18504#(<= main_~i~0 3), 18505#(<= main_~i~0 4), 18506#(<= main_~i~0 5), 18507#(<= main_~i~0 6), 18508#(<= main_~i~0 7), 18509#(<= main_~i~0 8), 18510#(<= main_~i~0 9), 18511#(<= main_~i~0 10), 18512#(<= main_~i~0 11), 18513#(<= main_~i~0 12), 18514#(<= main_~i~0 13), 18515#(<= main_~i~0 14), 18516#(<= main_~i~0 15), 18517#(<= main_~i~0 16), 18518#(<= main_~i~0 17), 18519#(<= main_~i~0 18), 18520#(<= main_~i~0 19), 18521#(<= main_~i~0 20), 18522#(<= main_~i~0 21), 18523#(<= main_~i~0 22), 18524#(<= main_~i~0 23), 18525#(<= main_~i~0 24), 18526#(<= main_~i~0 25), 18527#(<= main_~i~0 26), 18528#(<= main_~i~0 27), 18529#(<= main_~i~0 28), 18530#(<= main_~i~0 29), 18531#(<= main_~i~0 30), 18532#(<= main_~i~0 31), 18533#(<= main_~i~0 32), 18534#(<= main_~i~0 33), 18535#(<= main_~i~0 34), 18536#(<= main_~i~0 35), 18537#(<= main_~i~0 36), 18538#(<= main_~i~0 37), 18539#(<= main_~i~0 38), 18540#(<= main_~i~0 39), 18541#(<= main_~i~0 40), 18542#(<= main_~i~0 41), 18543#(<= main_~i~0 42), 18544#(<= main_~i~0 43), 18545#(<= main_~i~0 44), 18546#(<= main_~i~0 45), 18547#(<= main_~i~0 46), 18548#(<= main_~i~0 47), 18549#(<= main_~i~0 48), 18550#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 18551#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 18552#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-02-04 15:09:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:50,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 15:09:50,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 15:09:50,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:09:50,012 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 54 states. [2018-02-04 15:09:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:51,004 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-02-04 15:09:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 15:09:51,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-02-04 15:09:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:51,005 INFO L225 Difference]: With dead ends: 268 [2018-02-04 15:09:51,005 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 15:09:51,006 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 15:09:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 15:09:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-02-04 15:09:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 15:09:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-02-04 15:09:51,007 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-02-04 15:09:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:51,007 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-02-04 15:09:51,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 15:09:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-02-04 15:09:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 15:09:51,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:51,008 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:51,008 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times [2018-02-04 15:09:51,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:51,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:51,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:51,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 15:09:51,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:51,758 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 15:09:51,758 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 9), 19201#(<= main_~i~0 10), 19202#(<= main_~i~0 11), 19203#(<= main_~i~0 12), 19204#(<= main_~i~0 13), 19205#(<= main_~i~0 14), 19206#(<= main_~i~0 15), 19207#(<= main_~i~0 16), 19208#(<= main_~i~0 17), 19209#(<= main_~i~0 18), 19210#(<= main_~i~0 19), 19211#(<= main_~i~0 20), 19212#(<= main_~i~0 21), 19213#(<= main_~i~0 22), 19214#(<= main_~i~0 23), 19215#(<= main_~i~0 24), 19216#(<= main_~i~0 25), 19217#(<= main_~i~0 26), 19218#(<= main_~i~0 27), 19219#(<= main_~i~0 28), 19220#(<= main_~i~0 29), 19221#(<= main_~i~0 30), 19222#(<= main_~i~0 31), 19223#(<= main_~i~0 32), 19224#(<= main_~i~0 33), 19225#(<= main_~i~0 34), 19226#(<= main_~i~0 35), 19227#(<= main_~i~0 36), 19228#(<= main_~i~0 37), 19229#(<= main_~i~0 38), 19230#(<= main_~i~0 39), 19231#(<= main_~i~0 40), 19232#(<= main_~i~0 41), 19233#(<= main_~i~0 42), 19234#(<= main_~i~0 43), 19235#(<= main_~i~0 44), 19236#(<= main_~i~0 45), 19237#(<= main_~i~0 46), 19238#(<= main_~i~0 47), 19239#(<= main_~i~0 48), 19240#(<= main_~i~0 49), 19241#(<= main_~i~0 50), 19242#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 19243#(and (<= 1 main_~i~0) (<= main_~i~0 51)), 19189#true, 19190#false, 19191#(<= main_~i~0 0), 19192#(<= main_~i~0 1), 19193#(<= main_~i~0 2), 19194#(<= main_~i~0 3), 19195#(<= main_~i~0 4), 19196#(<= main_~i~0 5), 19197#(<= main_~i~0 6), 19198#(<= main_~i~0 7), 19199#(<= main_~i~0 8)] [2018-02-04 15:09:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:51,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 15:09:51,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 15:09:51,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:09:51,759 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-02-04 15:09:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:52,674 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-02-04 15:09:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 15:09:52,674 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-04 15:09:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:52,675 INFO L225 Difference]: With dead ends: 273 [2018-02-04 15:09:52,675 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 15:09:52,675 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 15:09:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 15:09:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-02-04 15:09:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 15:09:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-02-04 15:09:52,677 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-02-04 15:09:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:52,677 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-02-04 15:09:52,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 15:09:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-02-04 15:09:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 15:09:52,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:52,678 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:52,678 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times [2018-02-04 15:09:52,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:52,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:53,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:53,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 15:09:53,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:53,464 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 15:09:53,464 INFO L182 omatonBuilderFactory]: Interpolants [19892#true, 19893#false, 19894#(<= main_~i~0 0), 19895#(<= main_~i~0 1), 19896#(<= main_~i~0 2), 19897#(<= main_~i~0 3), 19898#(<= main_~i~0 4), 19899#(<= main_~i~0 5), 19900#(<= main_~i~0 6), 19901#(<= main_~i~0 7), 19902#(<= main_~i~0 8), 19903#(<= main_~i~0 9), 19904#(<= main_~i~0 10), 19905#(<= main_~i~0 11), 19906#(<= main_~i~0 12), 19907#(<= main_~i~0 13), 19908#(<= main_~i~0 14), 19909#(<= main_~i~0 15), 19910#(<= main_~i~0 16), 19911#(<= main_~i~0 17), 19912#(<= main_~i~0 18), 19913#(<= main_~i~0 19), 19914#(<= main_~i~0 20), 19915#(<= main_~i~0 21), 19916#(<= main_~i~0 22), 19917#(<= main_~i~0 23), 19918#(<= main_~i~0 24), 19919#(<= main_~i~0 25), 19920#(<= main_~i~0 26), 19921#(<= main_~i~0 27), 19922#(<= main_~i~0 28), 19923#(<= main_~i~0 29), 19924#(<= main_~i~0 30), 19925#(<= main_~i~0 31), 19926#(<= main_~i~0 32), 19927#(<= main_~i~0 33), 19928#(<= main_~i~0 34), 19929#(<= main_~i~0 35), 19930#(<= main_~i~0 36), 19931#(<= main_~i~0 37), 19932#(<= main_~i~0 38), 19933#(<= main_~i~0 39), 19934#(<= main_~i~0 40), 19935#(<= main_~i~0 41), 19936#(<= main_~i~0 42), 19937#(<= main_~i~0 43), 19938#(<= main_~i~0 44), 19939#(<= main_~i~0 45), 19940#(<= main_~i~0 46), 19941#(<= main_~i~0 47), 19942#(<= main_~i~0 48), 19943#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 19944#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 19945#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 19946#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 19947#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-02-04 15:09:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:53,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 15:09:53,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 15:09:53,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:09:53,464 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 56 states. [2018-02-04 15:09:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:54,611 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-02-04 15:09:54,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 15:09:54,611 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-02-04 15:09:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:54,612 INFO L225 Difference]: With dead ends: 278 [2018-02-04 15:09:54,612 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 15:09:54,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 15:09:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 15:09:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-02-04 15:09:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 15:09:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-02-04 15:09:54,615 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-02-04 15:09:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:54,615 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-02-04 15:09:54,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 15:09:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-02-04 15:09:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 15:09:54,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:54,616 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:54,616 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times [2018-02-04 15:09:54,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:54,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:55,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:55,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 15:09:55,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:55,478 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 15:09:55,478 INFO L182 omatonBuilderFactory]: Interpolants [20608#true, 20609#false, 20610#(<= main_~i~0 0), 20611#(<= main_~i~0 1), 20612#(<= main_~i~0 2), 20613#(<= main_~i~0 3), 20614#(<= main_~i~0 4), 20615#(<= main_~i~0 5), 20616#(<= main_~i~0 6), 20617#(<= main_~i~0 7), 20618#(<= main_~i~0 8), 20619#(<= main_~i~0 9), 20620#(<= main_~i~0 10), 20621#(<= main_~i~0 11), 20622#(<= main_~i~0 12), 20623#(<= main_~i~0 13), 20624#(<= main_~i~0 14), 20625#(<= main_~i~0 15), 20626#(<= main_~i~0 16), 20627#(<= main_~i~0 17), 20628#(<= main_~i~0 18), 20629#(<= main_~i~0 19), 20630#(<= main_~i~0 20), 20631#(<= main_~i~0 21), 20632#(<= main_~i~0 22), 20633#(<= main_~i~0 23), 20634#(<= main_~i~0 24), 20635#(<= main_~i~0 25), 20636#(<= main_~i~0 26), 20637#(<= main_~i~0 27), 20638#(<= main_~i~0 28), 20639#(<= main_~i~0 29), 20640#(<= main_~i~0 30), 20641#(<= main_~i~0 31), 20642#(<= main_~i~0 32), 20643#(<= main_~i~0 33), 20644#(<= main_~i~0 34), 20645#(<= main_~i~0 35), 20646#(<= main_~i~0 36), 20647#(<= main_~i~0 37), 20648#(<= main_~i~0 38), 20649#(<= main_~i~0 39), 20650#(<= main_~i~0 40), 20651#(<= main_~i~0 41), 20652#(<= main_~i~0 42), 20653#(<= main_~i~0 43), 20654#(<= main_~i~0 44), 20655#(<= main_~i~0 45), 20656#(<= main_~i~0 46), 20657#(<= main_~i~0 47), 20658#(<= main_~i~0 48), 20659#(<= main_~i~0 49), 20660#(<= main_~i~0 50), 20661#(<= main_~i~0 51), 20662#(<= main_~i~0 52), 20663#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 20664#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-02-04 15:09:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:55,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 15:09:55,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 15:09:55,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:09:55,478 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 57 states. [2018-02-04 15:09:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:56,456 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-02-04 15:09:56,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 15:09:56,457 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-02-04 15:09:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:56,457 INFO L225 Difference]: With dead ends: 283 [2018-02-04 15:09:56,457 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 15:09:56,458 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 15:09:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 15:09:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-04 15:09:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 15:09:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-02-04 15:09:56,460 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-02-04 15:09:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:56,460 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-02-04 15:09:56,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 15:09:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-02-04 15:09:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 15:09:56,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:56,461 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:56,461 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times [2018-02-04 15:09:56,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:56,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:57,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:57,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 15:09:57,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:57,285 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 15:09:57,285 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= main_~i~0 37), 21377#(<= main_~i~0 38), 21378#(<= main_~i~0 39), 21379#(<= main_~i~0 40), 21380#(<= main_~i~0 41), 21381#(<= main_~i~0 42), 21382#(<= main_~i~0 43), 21383#(<= main_~i~0 44), 21384#(<= main_~i~0 45), 21385#(<= main_~i~0 46), 21386#(<= main_~i~0 47), 21387#(<= main_~i~0 48), 21388#(<= main_~i~0 49), 21389#(<= main_~i~0 50), 21390#(<= main_~i~0 51), 21391#(<= main_~i~0 52), 21392#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 21393#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 21394#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 21337#true, 21338#false, 21339#(<= main_~i~0 0), 21340#(<= main_~i~0 1), 21341#(<= main_~i~0 2), 21342#(<= main_~i~0 3), 21343#(<= main_~i~0 4), 21344#(<= main_~i~0 5), 21345#(<= main_~i~0 6), 21346#(<= main_~i~0 7), 21347#(<= main_~i~0 8), 21348#(<= main_~i~0 9), 21349#(<= main_~i~0 10), 21350#(<= main_~i~0 11), 21351#(<= main_~i~0 12), 21352#(<= main_~i~0 13), 21353#(<= main_~i~0 14), 21354#(<= main_~i~0 15), 21355#(<= main_~i~0 16), 21356#(<= main_~i~0 17), 21357#(<= main_~i~0 18), 21358#(<= main_~i~0 19), 21359#(<= main_~i~0 20), 21360#(<= main_~i~0 21), 21361#(<= main_~i~0 22), 21362#(<= main_~i~0 23), 21363#(<= main_~i~0 24), 21364#(<= main_~i~0 25), 21365#(<= main_~i~0 26), 21366#(<= main_~i~0 27), 21367#(<= main_~i~0 28), 21368#(<= main_~i~0 29), 21369#(<= main_~i~0 30), 21370#(<= main_~i~0 31), 21371#(<= main_~i~0 32), 21372#(<= main_~i~0 33), 21373#(<= main_~i~0 34), 21374#(<= main_~i~0 35), 21375#(<= main_~i~0 36)] [2018-02-04 15:09:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:57,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 15:09:57,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 15:09:57,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:09:57,286 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 58 states. [2018-02-04 15:09:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:58,384 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-02-04 15:09:58,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 15:09:58,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-02-04 15:09:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:58,385 INFO L225 Difference]: With dead ends: 288 [2018-02-04 15:09:58,385 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 15:09:58,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 15:09:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 15:09:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-02-04 15:09:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 15:09:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-02-04 15:09:58,387 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-02-04 15:09:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:58,387 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-02-04 15:09:58,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 15:09:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-02-04 15:09:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 15:09:58,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:58,389 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:58,389 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:09:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times [2018-02-04 15:09:58,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:58,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:59,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:59,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 15:09:59,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:59,277 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 15:09:59,278 INFO L182 omatonBuilderFactory]: Interpolants [22079#true, 22080#false, 22081#(<= main_~i~0 0), 22082#(<= main_~i~0 1), 22083#(<= main_~i~0 2), 22084#(<= main_~i~0 3), 22085#(<= main_~i~0 4), 22086#(<= main_~i~0 5), 22087#(<= main_~i~0 6), 22088#(<= main_~i~0 7), 22089#(<= main_~i~0 8), 22090#(<= main_~i~0 9), 22091#(<= main_~i~0 10), 22092#(<= main_~i~0 11), 22093#(<= main_~i~0 12), 22094#(<= main_~i~0 13), 22095#(<= main_~i~0 14), 22096#(<= main_~i~0 15), 22097#(<= main_~i~0 16), 22098#(<= main_~i~0 17), 22099#(<= main_~i~0 18), 22100#(<= main_~i~0 19), 22101#(<= main_~i~0 20), 22102#(<= main_~i~0 21), 22103#(<= main_~i~0 22), 22104#(<= main_~i~0 23), 22105#(<= main_~i~0 24), 22106#(<= main_~i~0 25), 22107#(<= main_~i~0 26), 22108#(<= main_~i~0 27), 22109#(<= main_~i~0 28), 22110#(<= main_~i~0 29), 22111#(<= main_~i~0 30), 22112#(<= main_~i~0 31), 22113#(<= main_~i~0 32), 22114#(<= main_~i~0 33), 22115#(<= main_~i~0 34), 22116#(<= main_~i~0 35), 22117#(<= main_~i~0 36), 22118#(<= main_~i~0 37), 22119#(<= main_~i~0 38), 22120#(<= main_~i~0 39), 22121#(<= main_~i~0 40), 22122#(<= main_~i~0 41), 22123#(<= main_~i~0 42), 22124#(<= main_~i~0 43), 22125#(<= main_~i~0 44), 22126#(<= main_~i~0 45), 22127#(<= main_~i~0 46), 22128#(<= main_~i~0 47), 22129#(<= main_~i~0 48), 22130#(<= main_~i~0 49), 22131#(<= main_~i~0 50), 22132#(<= main_~i~0 51), 22133#(<= main_~i~0 52), 22134#(<= main_~i~0 53), 22135#(<= main_~i~0 54), 22136#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 22137#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-02-04 15:09:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:59,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 15:09:59,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 15:09:59,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 15:09:59,278 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-02-04 15:10:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:00,331 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-02-04 15:10:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 15:10:00,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-04 15:10:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:00,332 INFO L225 Difference]: With dead ends: 293 [2018-02-04 15:10:00,332 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 15:10:00,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 15:10:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 15:10:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-02-04 15:10:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 15:10:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-02-04 15:10:00,334 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-02-04 15:10:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:00,334 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-02-04 15:10:00,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 15:10:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-02-04 15:10:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 15:10:00,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:00,335 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:00,335 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times [2018-02-04 15:10:00,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:00,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:01,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:01,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 15:10:01,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:01,194 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 15:10:01,194 INFO L182 omatonBuilderFactory]: Interpolants [22834#true, 22835#false, 22836#(<= main_~i~0 0), 22837#(<= main_~i~0 1), 22838#(<= main_~i~0 2), 22839#(<= main_~i~0 3), 22840#(<= main_~i~0 4), 22841#(<= main_~i~0 5), 22842#(<= main_~i~0 6), 22843#(<= main_~i~0 7), 22844#(<= main_~i~0 8), 22845#(<= main_~i~0 9), 22846#(<= main_~i~0 10), 22847#(<= main_~i~0 11), 22848#(<= main_~i~0 12), 22849#(<= main_~i~0 13), 22850#(<= main_~i~0 14), 22851#(<= main_~i~0 15), 22852#(<= main_~i~0 16), 22853#(<= main_~i~0 17), 22854#(<= main_~i~0 18), 22855#(<= main_~i~0 19), 22856#(<= main_~i~0 20), 22857#(<= main_~i~0 21), 22858#(<= main_~i~0 22), 22859#(<= main_~i~0 23), 22860#(<= main_~i~0 24), 22861#(<= main_~i~0 25), 22862#(<= main_~i~0 26), 22863#(<= main_~i~0 27), 22864#(<= main_~i~0 28), 22865#(<= main_~i~0 29), 22866#(<= main_~i~0 30), 22867#(<= main_~i~0 31), 22868#(<= main_~i~0 32), 22869#(<= main_~i~0 33), 22870#(<= main_~i~0 34), 22871#(<= main_~i~0 35), 22872#(<= main_~i~0 36), 22873#(<= main_~i~0 37), 22874#(<= main_~i~0 38), 22875#(<= main_~i~0 39), 22876#(<= main_~i~0 40), 22877#(<= main_~i~0 41), 22878#(<= main_~i~0 42), 22879#(<= main_~i~0 43), 22880#(<= main_~i~0 44), 22881#(<= main_~i~0 45), 22882#(<= main_~i~0 46), 22883#(<= main_~i~0 47), 22884#(<= main_~i~0 48), 22885#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 22886#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 22887#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 22888#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 22889#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 22890#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 22891#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 22892#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 22893#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-02-04 15:10:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:01,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 15:10:01,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 15:10:01,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:10:01,195 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-02-04 15:10:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:03,124 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-02-04 15:10:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 15:10:03,124 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-04 15:10:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:03,125 INFO L225 Difference]: With dead ends: 298 [2018-02-04 15:10:03,125 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 15:10:03,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 15:10:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 15:10:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-02-04 15:10:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 15:10:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-02-04 15:10:03,127 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-02-04 15:10:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:03,127 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-02-04 15:10:03,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 15:10:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-02-04 15:10:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 15:10:03,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:03,128 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:03,128 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times [2018-02-04 15:10:03,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:03,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:04,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:04,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 15:10:04,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:04,052 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 15:10:04,052 INFO L182 omatonBuilderFactory]: Interpolants [23602#true, 23603#false, 23604#(<= main_~i~0 0), 23605#(<= main_~i~0 1), 23606#(<= main_~i~0 2), 23607#(<= main_~i~0 3), 23608#(<= main_~i~0 4), 23609#(<= main_~i~0 5), 23610#(<= main_~i~0 6), 23611#(<= main_~i~0 7), 23612#(<= main_~i~0 8), 23613#(<= main_~i~0 9), 23614#(<= main_~i~0 10), 23615#(<= main_~i~0 11), 23616#(<= main_~i~0 12), 23617#(<= main_~i~0 13), 23618#(<= main_~i~0 14), 23619#(<= main_~i~0 15), 23620#(<= main_~i~0 16), 23621#(<= main_~i~0 17), 23622#(<= main_~i~0 18), 23623#(<= main_~i~0 19), 23624#(<= main_~i~0 20), 23625#(<= main_~i~0 21), 23626#(<= main_~i~0 22), 23627#(<= main_~i~0 23), 23628#(<= main_~i~0 24), 23629#(<= main_~i~0 25), 23630#(<= main_~i~0 26), 23631#(<= main_~i~0 27), 23632#(<= main_~i~0 28), 23633#(<= main_~i~0 29), 23634#(<= main_~i~0 30), 23635#(<= main_~i~0 31), 23636#(<= main_~i~0 32), 23637#(<= main_~i~0 33), 23638#(<= main_~i~0 34), 23639#(<= main_~i~0 35), 23640#(<= main_~i~0 36), 23641#(<= main_~i~0 37), 23642#(<= main_~i~0 38), 23643#(<= main_~i~0 39), 23644#(<= main_~i~0 40), 23645#(<= main_~i~0 41), 23646#(<= main_~i~0 42), 23647#(<= main_~i~0 43), 23648#(<= main_~i~0 44), 23649#(<= main_~i~0 45), 23650#(<= main_~i~0 46), 23651#(<= main_~i~0 47), 23652#(<= main_~i~0 48), 23653#(<= main_~i~0 49), 23654#(<= main_~i~0 50), 23655#(<= main_~i~0 51), 23656#(<= main_~i~0 52), 23657#(<= main_~i~0 53), 23658#(<= main_~i~0 54), 23659#(<= main_~i~0 55), 23660#(<= main_~i~0 56), 23661#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 23662#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-02-04 15:10:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:04,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 15:10:04,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 15:10:04,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:10:04,054 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 61 states. [2018-02-04 15:10:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:05,211 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-02-04 15:10:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 15:10:05,212 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-02-04 15:10:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:05,212 INFO L225 Difference]: With dead ends: 303 [2018-02-04 15:10:05,212 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 15:10:05,213 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 15:10:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 15:10:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-02-04 15:10:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 15:10:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-02-04 15:10:05,215 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-02-04 15:10:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:05,215 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-02-04 15:10:05,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 15:10:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-02-04 15:10:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 15:10:05,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:05,216 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:05,216 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1266675268, now seen corresponding path program 58 times [2018-02-04 15:10:05,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:05,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:06,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:06,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 15:10:06,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:06,168 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 15:10:06,168 INFO L182 omatonBuilderFactory]: Interpolants [24383#true, 24384#false, 24385#(<= main_~i~0 0), 24386#(<= main_~i~0 1), 24387#(<= main_~i~0 2), 24388#(<= main_~i~0 3), 24389#(<= main_~i~0 4), 24390#(<= main_~i~0 5), 24391#(<= main_~i~0 6), 24392#(<= main_~i~0 7), 24393#(<= main_~i~0 8), 24394#(<= main_~i~0 9), 24395#(<= main_~i~0 10), 24396#(<= main_~i~0 11), 24397#(<= main_~i~0 12), 24398#(<= main_~i~0 13), 24399#(<= main_~i~0 14), 24400#(<= main_~i~0 15), 24401#(<= main_~i~0 16), 24402#(<= main_~i~0 17), 24403#(<= main_~i~0 18), 24404#(<= main_~i~0 19), 24405#(<= main_~i~0 20), 24406#(<= main_~i~0 21), 24407#(<= main_~i~0 22), 24408#(<= main_~i~0 23), 24409#(<= main_~i~0 24), 24410#(<= main_~i~0 25), 24411#(<= main_~i~0 26), 24412#(<= main_~i~0 27), 24413#(<= main_~i~0 28), 24414#(<= main_~i~0 29), 24415#(<= main_~i~0 30), 24416#(<= main_~i~0 31), 24417#(<= main_~i~0 32), 24418#(<= main_~i~0 33), 24419#(<= main_~i~0 34), 24420#(<= main_~i~0 35), 24421#(<= main_~i~0 36), 24422#(<= main_~i~0 37), 24423#(<= main_~i~0 38), 24424#(<= main_~i~0 39), 24425#(<= main_~i~0 40), 24426#(<= main_~i~0 41), 24427#(<= main_~i~0 42), 24428#(<= main_~i~0 43), 24429#(<= main_~i~0 44), 24430#(<= main_~i~0 45), 24431#(<= main_~i~0 46), 24432#(<= main_~i~0 47), 24433#(<= main_~i~0 48), 24434#(<= main_~i~0 49), 24435#(<= main_~i~0 50), 24436#(<= main_~i~0 51), 24437#(<= main_~i~0 52), 24438#(<= main_~i~0 53), 24439#(<= main_~i~0 54), 24440#(<= main_~i~0 55), 24441#(<= main_~i~0 56), 24442#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 24443#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 24444#(and (<= 2 main_~i~0) (<= main_~i~0 58))] [2018-02-04 15:10:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:06,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 15:10:06,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 15:10:06,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:10:06,169 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 62 states. [2018-02-04 15:10:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:07,440 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-02-04 15:10:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 15:10:07,440 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-02-04 15:10:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:07,441 INFO L225 Difference]: With dead ends: 308 [2018-02-04 15:10:07,441 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 15:10:07,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 15:10:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 15:10:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-02-04 15:10:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 15:10:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-02-04 15:10:07,443 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-02-04 15:10:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:07,444 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-02-04 15:10:07,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 15:10:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-02-04 15:10:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 15:10:07,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:07,444 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:07,444 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1632661303, now seen corresponding path program 59 times [2018-02-04 15:10:07,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:07,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:08,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:08,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 15:10:08,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:08,452 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 15:10:08,452 INFO L182 omatonBuilderFactory]: Interpolants [25216#(<= main_~i~0 37), 25217#(<= main_~i~0 38), 25218#(<= main_~i~0 39), 25219#(<= main_~i~0 40), 25220#(<= main_~i~0 41), 25221#(<= main_~i~0 42), 25222#(<= main_~i~0 43), 25223#(<= main_~i~0 44), 25224#(<= main_~i~0 45), 25225#(<= main_~i~0 46), 25226#(<= main_~i~0 47), 25227#(<= main_~i~0 48), 25228#(<= main_~i~0 49), 25229#(<= main_~i~0 50), 25230#(<= main_~i~0 51), 25231#(<= main_~i~0 52), 25232#(<= main_~i~0 53), 25233#(<= main_~i~0 54), 25234#(<= main_~i~0 55), 25235#(<= main_~i~0 56), 25236#(<= main_~i~0 57), 25237#(<= main_~i~0 58), 25238#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 25239#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 25177#true, 25178#false, 25179#(<= main_~i~0 0), 25180#(<= main_~i~0 1), 25181#(<= main_~i~0 2), 25182#(<= main_~i~0 3), 25183#(<= main_~i~0 4), 25184#(<= main_~i~0 5), 25185#(<= main_~i~0 6), 25186#(<= main_~i~0 7), 25187#(<= main_~i~0 8), 25188#(<= main_~i~0 9), 25189#(<= main_~i~0 10), 25190#(<= main_~i~0 11), 25191#(<= main_~i~0 12), 25192#(<= main_~i~0 13), 25193#(<= main_~i~0 14), 25194#(<= main_~i~0 15), 25195#(<= main_~i~0 16), 25196#(<= main_~i~0 17), 25197#(<= main_~i~0 18), 25198#(<= main_~i~0 19), 25199#(<= main_~i~0 20), 25200#(<= main_~i~0 21), 25201#(<= main_~i~0 22), 25202#(<= main_~i~0 23), 25203#(<= main_~i~0 24), 25204#(<= main_~i~0 25), 25205#(<= main_~i~0 26), 25206#(<= main_~i~0 27), 25207#(<= main_~i~0 28), 25208#(<= main_~i~0 29), 25209#(<= main_~i~0 30), 25210#(<= main_~i~0 31), 25211#(<= main_~i~0 32), 25212#(<= main_~i~0 33), 25213#(<= main_~i~0 34), 25214#(<= main_~i~0 35), 25215#(<= main_~i~0 36)] [2018-02-04 15:10:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:08,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 15:10:08,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 15:10:08,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:10:08,453 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 63 states. [2018-02-04 15:10:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:09,621 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-02-04 15:10:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 15:10:09,622 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-02-04 15:10:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:09,622 INFO L225 Difference]: With dead ends: 313 [2018-02-04 15:10:09,622 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 15:10:09,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 15:10:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 15:10:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-02-04 15:10:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-04 15:10:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-02-04 15:10:09,625 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-02-04 15:10:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:09,626 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-02-04 15:10:09,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 15:10:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-02-04 15:10:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 15:10:09,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:09,627 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:09,627 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1156168036, now seen corresponding path program 60 times [2018-02-04 15:10:09,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:09,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:10,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:10,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 15:10:10,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:10,618 INFO L182 omatonBuilderFactory]: Interpolants [25984#true, 25985#false, 25986#(<= main_~i~0 0), 25987#(<= main_~i~0 1), 25988#(<= main_~i~0 2), 25989#(<= main_~i~0 3), 25990#(<= main_~i~0 4), 25991#(<= main_~i~0 5), 25992#(<= main_~i~0 6), 25993#(<= main_~i~0 7), 25994#(<= main_~i~0 8), 25995#(<= main_~i~0 9), 25996#(<= main_~i~0 10), 25997#(<= main_~i~0 11), 25998#(<= main_~i~0 12), 25999#(<= main_~i~0 13), 26000#(<= main_~i~0 14), 26001#(<= main_~i~0 15), 26002#(<= main_~i~0 16), 26003#(<= main_~i~0 17), 26004#(<= main_~i~0 18), 26005#(<= main_~i~0 19), 26006#(<= main_~i~0 20), 26007#(<= main_~i~0 21), 26008#(<= main_~i~0 22), 26009#(<= main_~i~0 23), 26010#(<= main_~i~0 24), 26011#(<= main_~i~0 25), 26012#(<= main_~i~0 26), 26013#(<= main_~i~0 27), 26014#(<= main_~i~0 28), 26015#(<= main_~i~0 29), 26016#(<= main_~i~0 30), 26017#(<= main_~i~0 31), 26018#(<= main_~i~0 32), 26019#(<= main_~i~0 33), 26020#(<= main_~i~0 34), 26021#(<= main_~i~0 35), 26022#(<= main_~i~0 36), 26023#(<= main_~i~0 37), 26024#(<= main_~i~0 38), 26025#(<= main_~i~0 39), 26026#(<= main_~i~0 40), 26027#(<= main_~i~0 41), 26028#(<= main_~i~0 42), 26029#(<= main_~i~0 43), 26030#(<= main_~i~0 44), 26031#(<= main_~i~0 45), 26032#(<= main_~i~0 46), 26033#(<= main_~i~0 47), 26034#(<= main_~i~0 48), 26035#(<= main_~i~0 49), 26036#(<= main_~i~0 50), 26037#(<= main_~i~0 51), 26038#(<= main_~i~0 52), 26039#(<= main_~i~0 53), 26040#(<= main_~i~0 54), 26041#(<= main_~i~0 55), 26042#(<= main_~i~0 56), 26043#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 26044#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 26045#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 26046#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 26047#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-02-04 15:10:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:10,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 15:10:10,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 15:10:10,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:10:10,619 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 64 states. [2018-02-04 15:10:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:12,144 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-02-04 15:10:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 15:10:12,144 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 307 [2018-02-04 15:10:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:12,144 INFO L225 Difference]: With dead ends: 318 [2018-02-04 15:10:12,145 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 15:10:12,145 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 15:10:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 15:10:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-02-04 15:10:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 15:10:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-02-04 15:10:12,147 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-02-04 15:10:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:12,147 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-02-04 15:10:12,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 15:10:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-02-04 15:10:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 15:10:12,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:12,148 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:12,148 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1119372887, now seen corresponding path program 61 times [2018-02-04 15:10:12,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:12,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:13,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:13,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 15:10:13,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:13,229 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 15:10:13,229 INFO L182 omatonBuilderFactory]: Interpolants [26804#true, 26805#false, 26806#(<= main_~i~0 0), 26807#(<= main_~i~0 1), 26808#(<= main_~i~0 2), 26809#(<= main_~i~0 3), 26810#(<= main_~i~0 4), 26811#(<= main_~i~0 5), 26812#(<= main_~i~0 6), 26813#(<= main_~i~0 7), 26814#(<= main_~i~0 8), 26815#(<= main_~i~0 9), 26816#(<= main_~i~0 10), 26817#(<= main_~i~0 11), 26818#(<= main_~i~0 12), 26819#(<= main_~i~0 13), 26820#(<= main_~i~0 14), 26821#(<= main_~i~0 15), 26822#(<= main_~i~0 16), 26823#(<= main_~i~0 17), 26824#(<= main_~i~0 18), 26825#(<= main_~i~0 19), 26826#(<= main_~i~0 20), 26827#(<= main_~i~0 21), 26828#(<= main_~i~0 22), 26829#(<= main_~i~0 23), 26830#(<= main_~i~0 24), 26831#(<= main_~i~0 25), 26832#(<= main_~i~0 26), 26833#(<= main_~i~0 27), 26834#(<= main_~i~0 28), 26835#(<= main_~i~0 29), 26836#(<= main_~i~0 30), 26837#(<= main_~i~0 31), 26838#(<= main_~i~0 32), 26839#(<= main_~i~0 33), 26840#(<= main_~i~0 34), 26841#(<= main_~i~0 35), 26842#(<= main_~i~0 36), 26843#(<= main_~i~0 37), 26844#(<= main_~i~0 38), 26845#(<= main_~i~0 39), 26846#(<= main_~i~0 40), 26847#(<= main_~i~0 41), 26848#(<= main_~i~0 42), 26849#(<= main_~i~0 43), 26850#(<= main_~i~0 44), 26851#(<= main_~i~0 45), 26852#(<= main_~i~0 46), 26853#(<= main_~i~0 47), 26854#(<= main_~i~0 48), 26855#(<= main_~i~0 49), 26856#(<= main_~i~0 50), 26857#(<= main_~i~0 51), 26858#(<= main_~i~0 52), 26859#(<= main_~i~0 53), 26860#(<= main_~i~0 54), 26861#(<= main_~i~0 55), 26862#(<= main_~i~0 56), 26863#(<= main_~i~0 57), 26864#(<= main_~i~0 58), 26865#(<= main_~i~0 59), 26866#(<= main_~i~0 60), 26867#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 26868#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-02-04 15:10:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:13,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 15:10:13,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 15:10:13,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 15:10:13,230 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-02-04 15:10:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:14,512 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-02-04 15:10:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 15:10:14,512 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-02-04 15:10:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:14,513 INFO L225 Difference]: With dead ends: 323 [2018-02-04 15:10:14,513 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 15:10:14,514 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 15:10:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 15:10:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-02-04 15:10:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-04 15:10:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-02-04 15:10:14,516 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-02-04 15:10:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:14,516 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-02-04 15:10:14,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 15:10:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-02-04 15:10:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 15:10:14,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:14,517 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:14,517 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:14,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1164450948, now seen corresponding path program 62 times [2018-02-04 15:10:14,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:14,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:15,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:15,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 15:10:15,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:15,587 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 15:10:15,587 INFO L182 omatonBuilderFactory]: Interpolants [27648#(<= main_~i~0 9), 27649#(<= main_~i~0 10), 27650#(<= main_~i~0 11), 27651#(<= main_~i~0 12), 27652#(<= main_~i~0 13), 27653#(<= main_~i~0 14), 27654#(<= main_~i~0 15), 27655#(<= main_~i~0 16), 27656#(<= main_~i~0 17), 27657#(<= main_~i~0 18), 27658#(<= main_~i~0 19), 27659#(<= main_~i~0 20), 27660#(<= main_~i~0 21), 27661#(<= main_~i~0 22), 27662#(<= main_~i~0 23), 27663#(<= main_~i~0 24), 27664#(<= main_~i~0 25), 27665#(<= main_~i~0 26), 27666#(<= main_~i~0 27), 27667#(<= main_~i~0 28), 27668#(<= main_~i~0 29), 27669#(<= main_~i~0 30), 27670#(<= main_~i~0 31), 27671#(<= main_~i~0 32), 27672#(<= main_~i~0 33), 27673#(<= main_~i~0 34), 27674#(<= main_~i~0 35), 27675#(<= main_~i~0 36), 27676#(<= main_~i~0 37), 27677#(<= main_~i~0 38), 27678#(<= main_~i~0 39), 27679#(<= main_~i~0 40), 27680#(<= main_~i~0 41), 27681#(<= main_~i~0 42), 27682#(<= main_~i~0 43), 27683#(<= main_~i~0 44), 27684#(<= main_~i~0 45), 27685#(<= main_~i~0 46), 27686#(<= main_~i~0 47), 27687#(<= main_~i~0 48), 27688#(<= main_~i~0 49), 27689#(<= main_~i~0 50), 27690#(<= main_~i~0 51), 27691#(<= main_~i~0 52), 27692#(<= main_~i~0 53), 27693#(<= main_~i~0 54), 27694#(<= main_~i~0 55), 27695#(<= main_~i~0 56), 27696#(<= main_~i~0 57), 27697#(<= main_~i~0 58), 27698#(<= main_~i~0 59), 27699#(<= main_~i~0 60), 27700#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 27701#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 27702#(and (<= 2 main_~i~0) (<= main_~i~0 62)), 27637#true, 27638#false, 27639#(<= main_~i~0 0), 27640#(<= main_~i~0 1), 27641#(<= main_~i~0 2), 27642#(<= main_~i~0 3), 27643#(<= main_~i~0 4), 27644#(<= main_~i~0 5), 27645#(<= main_~i~0 6), 27646#(<= main_~i~0 7), 27647#(<= main_~i~0 8)] [2018-02-04 15:10:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:15,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 15:10:15,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 15:10:15,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 15:10:15,588 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-02-04 15:10:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:16,963 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-02-04 15:10:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 15:10:16,963 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-02-04 15:10:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:16,964 INFO L225 Difference]: With dead ends: 328 [2018-02-04 15:10:16,964 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 15:10:16,964 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 15:10:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 15:10:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 15:10:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 15:10:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-02-04 15:10:16,966 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-02-04 15:10:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:16,966 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-02-04 15:10:16,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 15:10:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-02-04 15:10:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 15:10:16,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:16,967 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:16,967 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2115351927, now seen corresponding path program 63 times [2018-02-04 15:10:16,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:16,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:18,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:18,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 15:10:18,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:18,061 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 15:10:18,061 INFO L182 omatonBuilderFactory]: Interpolants [28544#(<= main_~i~0 59), 28545#(<= main_~i~0 60), 28546#(<= main_~i~0 61), 28547#(<= main_~i~0 62), 28548#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 28549#(and (<= 1 main_~i~0) (<= main_~i~0 63)), 28483#true, 28484#false, 28485#(<= main_~i~0 0), 28486#(<= main_~i~0 1), 28487#(<= main_~i~0 2), 28488#(<= main_~i~0 3), 28489#(<= main_~i~0 4), 28490#(<= main_~i~0 5), 28491#(<= main_~i~0 6), 28492#(<= main_~i~0 7), 28493#(<= main_~i~0 8), 28494#(<= main_~i~0 9), 28495#(<= main_~i~0 10), 28496#(<= main_~i~0 11), 28497#(<= main_~i~0 12), 28498#(<= main_~i~0 13), 28499#(<= main_~i~0 14), 28500#(<= main_~i~0 15), 28501#(<= main_~i~0 16), 28502#(<= main_~i~0 17), 28503#(<= main_~i~0 18), 28504#(<= main_~i~0 19), 28505#(<= main_~i~0 20), 28506#(<= main_~i~0 21), 28507#(<= main_~i~0 22), 28508#(<= main_~i~0 23), 28509#(<= main_~i~0 24), 28510#(<= main_~i~0 25), 28511#(<= main_~i~0 26), 28512#(<= main_~i~0 27), 28513#(<= main_~i~0 28), 28514#(<= main_~i~0 29), 28515#(<= main_~i~0 30), 28516#(<= main_~i~0 31), 28517#(<= main_~i~0 32), 28518#(<= main_~i~0 33), 28519#(<= main_~i~0 34), 28520#(<= main_~i~0 35), 28521#(<= main_~i~0 36), 28522#(<= main_~i~0 37), 28523#(<= main_~i~0 38), 28524#(<= main_~i~0 39), 28525#(<= main_~i~0 40), 28526#(<= main_~i~0 41), 28527#(<= main_~i~0 42), 28528#(<= main_~i~0 43), 28529#(<= main_~i~0 44), 28530#(<= main_~i~0 45), 28531#(<= main_~i~0 46), 28532#(<= main_~i~0 47), 28533#(<= main_~i~0 48), 28534#(<= main_~i~0 49), 28535#(<= main_~i~0 50), 28536#(<= main_~i~0 51), 28537#(<= main_~i~0 52), 28538#(<= main_~i~0 53), 28539#(<= main_~i~0 54), 28540#(<= main_~i~0 55), 28541#(<= main_~i~0 56), 28542#(<= main_~i~0 57), 28543#(<= main_~i~0 58)] [2018-02-04 15:10:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:18,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 15:10:18,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 15:10:18,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:10:18,062 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 67 states. [2018-02-04 15:10:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:19,340 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-02-04 15:10:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 15:10:19,340 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-02-04 15:10:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:19,341 INFO L225 Difference]: With dead ends: 333 [2018-02-04 15:10:19,341 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 15:10:19,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 15:10:19,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 15:10:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-02-04 15:10:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 15:10:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-02-04 15:10:19,343 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-02-04 15:10:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:19,343 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-02-04 15:10:19,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 15:10:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-02-04 15:10:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 15:10:19,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:19,345 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:19,345 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1310529444, now seen corresponding path program 64 times [2018-02-04 15:10:19,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:19,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:20,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:20,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 15:10:20,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:20,869 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 15:10:20,869 INFO L182 omatonBuilderFactory]: Interpolants [29342#true, 29343#false, 29344#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 29345#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 29346#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 29347#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 29348#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 29349#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 29350#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 29351#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 29352#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 29353#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 29354#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 29355#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 29356#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 29357#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 29358#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 29359#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 29360#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 29361#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 29362#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 29363#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 29364#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 29365#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 29366#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 29367#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 29368#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 29369#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 29370#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 29371#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 29372#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 29373#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 29374#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 29375#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 29376#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 29377#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 29378#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 29379#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 29380#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 29381#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 29382#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 29383#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 29384#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 29385#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 29386#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 29387#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 29388#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 29389#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 29390#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 29391#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 29392#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 29393#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 29394#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 29395#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 29396#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 29397#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 29398#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 29399#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 29400#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 29401#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 29402#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 29403#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 29404#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 29405#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 29406#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 29407#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 29408#(and (<= main_~i~0 64) (<= 64 main_~i~0))] [2018-02-04 15:10:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:20,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 15:10:20,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 15:10:20,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:10:20,870 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-02-04 15:10:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:24,849 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-02-04 15:10:24,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 15:10:24,850 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 15:10:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:24,850 INFO L225 Difference]: With dead ends: 338 [2018-02-04 15:10:24,850 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 15:10:24,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:10:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 15:10:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-04 15:10:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 15:10:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-02-04 15:10:24,852 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-02-04 15:10:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:24,852 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-02-04 15:10:24,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 15:10:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-02-04 15:10:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 15:10:24,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:24,853 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:24,853 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1354056553, now seen corresponding path program 65 times [2018-02-04 15:10:24,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:24,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:26,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:26,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 15:10:26,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:26,057 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 15:10:26,057 INFO L182 omatonBuilderFactory]: Interpolants [30085#true, 30086#false, 30087#(<= main_~i~0 0), 30088#(<= main_~i~0 1), 30089#(<= main_~i~0 2), 30090#(<= main_~i~0 3), 30091#(<= main_~i~0 4), 30092#(<= main_~i~0 5), 30093#(<= main_~i~0 6), 30094#(<= main_~i~0 7), 30095#(<= main_~i~0 8), 30096#(<= main_~i~0 9), 30097#(<= main_~i~0 10), 30098#(<= main_~i~0 11), 30099#(<= main_~i~0 12), 30100#(<= main_~i~0 13), 30101#(<= main_~i~0 14), 30102#(<= main_~i~0 15), 30103#(<= main_~i~0 16), 30104#(<= main_~i~0 17), 30105#(<= main_~i~0 18), 30106#(<= main_~i~0 19), 30107#(<= main_~i~0 20), 30108#(<= main_~i~0 21), 30109#(<= main_~i~0 22), 30110#(<= main_~i~0 23), 30111#(<= main_~i~0 24), 30112#(<= main_~i~0 25), 30113#(<= main_~i~0 26), 30114#(<= main_~i~0 27), 30115#(<= main_~i~0 28), 30116#(<= main_~i~0 29), 30117#(<= main_~i~0 30), 30118#(<= main_~i~0 31), 30119#(<= main_~i~0 32), 30120#(<= main_~i~0 33), 30121#(<= main_~i~0 34), 30122#(<= main_~i~0 35), 30123#(<= main_~i~0 36), 30124#(<= main_~i~0 37), 30125#(<= main_~i~0 38), 30126#(<= main_~i~0 39), 30127#(<= main_~i~0 40), 30128#(<= main_~i~0 41), 30129#(<= main_~i~0 42), 30130#(<= main_~i~0 43), 30131#(<= main_~i~0 44), 30132#(<= main_~i~0 45), 30133#(<= main_~i~0 46), 30134#(<= main_~i~0 47), 30135#(<= main_~i~0 48), 30136#(<= main_~i~0 49), 30137#(<= main_~i~0 50), 30138#(<= main_~i~0 51), 30139#(<= main_~i~0 52), 30140#(<= main_~i~0 53), 30141#(<= main_~i~0 54), 30142#(<= main_~i~0 55), 30143#(<= main_~i~0 56), 30144#(<= main_~i~0 57), 30145#(<= main_~i~0 58), 30146#(<= main_~i~0 59), 30147#(<= main_~i~0 60), 30148#(<= main_~i~0 61), 30149#(<= main_~i~0 62), 30150#(<= main_~i~0 63), 30151#(<= main_~i~0 64), 30152#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 30153#(and (<= 1 main_~i~0) (<= main_~i~0 65))] [2018-02-04 15:10:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:26,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 15:10:26,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 15:10:26,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 15:10:26,058 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 69 states. [2018-02-04 15:10:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:27,474 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-02-04 15:10:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 15:10:27,475 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-02-04 15:10:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:27,475 INFO L225 Difference]: With dead ends: 343 [2018-02-04 15:10:27,476 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 15:10:27,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 15:10:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 15:10:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-04 15:10:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 15:10:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-02-04 15:10:27,478 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-02-04 15:10:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:27,478 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-02-04 15:10:27,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 15:10:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-02-04 15:10:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 15:10:27,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:27,479 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:27,479 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash 576017724, now seen corresponding path program 66 times [2018-02-04 15:10:27,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:27,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:28,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:28,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 15:10:28,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:28,696 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 15:10:28,696 INFO L182 omatonBuilderFactory]: Interpolants [30976#(<= main_~i~0 4), 30977#(<= main_~i~0 5), 30978#(<= main_~i~0 6), 30979#(<= main_~i~0 7), 30980#(<= main_~i~0 8), 30981#(<= main_~i~0 9), 30982#(<= main_~i~0 10), 30983#(<= main_~i~0 11), 30984#(<= main_~i~0 12), 30985#(<= main_~i~0 13), 30986#(<= main_~i~0 14), 30987#(<= main_~i~0 15), 30988#(<= main_~i~0 16), 30989#(<= main_~i~0 17), 30990#(<= main_~i~0 18), 30991#(<= main_~i~0 19), 30992#(<= main_~i~0 20), 30993#(<= main_~i~0 21), 30994#(<= main_~i~0 22), 30995#(<= main_~i~0 23), 30996#(<= main_~i~0 24), 30997#(<= main_~i~0 25), 30998#(<= main_~i~0 26), 30999#(<= main_~i~0 27), 31000#(<= main_~i~0 28), 31001#(<= main_~i~0 29), 31002#(<= main_~i~0 30), 31003#(<= main_~i~0 31), 31004#(<= main_~i~0 32), 31005#(<= main_~i~0 33), 31006#(<= main_~i~0 34), 31007#(<= main_~i~0 35), 31008#(<= main_~i~0 36), 31009#(<= main_~i~0 37), 31010#(<= main_~i~0 38), 31011#(<= main_~i~0 39), 31012#(<= main_~i~0 40), 31013#(<= main_~i~0 41), 31014#(<= main_~i~0 42), 31015#(<= main_~i~0 43), 31016#(<= main_~i~0 44), 31017#(<= main_~i~0 45), 31018#(<= main_~i~0 46), 31019#(<= main_~i~0 47), 31020#(<= main_~i~0 48), 31021#(<= main_~i~0 49), 31022#(<= main_~i~0 50), 31023#(<= main_~i~0 51), 31024#(<= main_~i~0 52), 31025#(<= main_~i~0 53), 31026#(<= main_~i~0 54), 31027#(<= main_~i~0 55), 31028#(<= main_~i~0 56), 31029#(<= main_~i~0 57), 31030#(<= main_~i~0 58), 31031#(<= main_~i~0 59), 31032#(<= main_~i~0 60), 31033#(<= main_~i~0 61), 31034#(<= main_~i~0 62), 31035#(<= main_~i~0 63), 31036#(<= main_~i~0 64), 31037#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 31038#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 31039#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 30970#true, 30971#false, 30972#(<= main_~i~0 0), 30973#(<= main_~i~0 1), 30974#(<= main_~i~0 2), 30975#(<= main_~i~0 3)] [2018-02-04 15:10:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:28,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 15:10:28,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 15:10:28,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:10:28,697 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 70 states. [2018-02-04 15:10:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:30,254 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-02-04 15:10:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 15:10:30,255 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-02-04 15:10:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:30,255 INFO L225 Difference]: With dead ends: 348 [2018-02-04 15:10:30,255 INFO L226 Difference]: Without dead ends: 348 [2018-02-04 15:10:30,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-02-04 15:10:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-04 15:10:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-02-04 15:10:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 15:10:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-02-04 15:10:30,258 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-02-04 15:10:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:30,258 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-02-04 15:10:30,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 15:10:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-02-04 15:10:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-04 15:10:30,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:30,259 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:30,259 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2142854071, now seen corresponding path program 67 times [2018-02-04 15:10:30,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:30,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:31,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:31,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 15:10:31,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:31,557 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 15:10:31,557 INFO L182 omatonBuilderFactory]: Interpolants [31872#(<= main_~i~0 2), 31873#(<= main_~i~0 3), 31874#(<= main_~i~0 4), 31875#(<= main_~i~0 5), 31876#(<= main_~i~0 6), 31877#(<= main_~i~0 7), 31878#(<= main_~i~0 8), 31879#(<= main_~i~0 9), 31880#(<= main_~i~0 10), 31881#(<= main_~i~0 11), 31882#(<= main_~i~0 12), 31883#(<= main_~i~0 13), 31884#(<= main_~i~0 14), 31885#(<= main_~i~0 15), 31886#(<= main_~i~0 16), 31887#(<= main_~i~0 17), 31888#(<= main_~i~0 18), 31889#(<= main_~i~0 19), 31890#(<= main_~i~0 20), 31891#(<= main_~i~0 21), 31892#(<= main_~i~0 22), 31893#(<= main_~i~0 23), 31894#(<= main_~i~0 24), 31895#(<= main_~i~0 25), 31896#(<= main_~i~0 26), 31897#(<= main_~i~0 27), 31898#(<= main_~i~0 28), 31899#(<= main_~i~0 29), 31900#(<= main_~i~0 30), 31901#(<= main_~i~0 31), 31902#(<= main_~i~0 32), 31903#(<= main_~i~0 33), 31904#(<= main_~i~0 34), 31905#(<= main_~i~0 35), 31906#(<= main_~i~0 36), 31907#(<= main_~i~0 37), 31908#(<= main_~i~0 38), 31909#(<= main_~i~0 39), 31910#(<= main_~i~0 40), 31911#(<= main_~i~0 41), 31912#(<= main_~i~0 42), 31913#(<= main_~i~0 43), 31914#(<= main_~i~0 44), 31915#(<= main_~i~0 45), 31916#(<= main_~i~0 46), 31917#(<= main_~i~0 47), 31918#(<= main_~i~0 48), 31919#(<= main_~i~0 49), 31920#(<= main_~i~0 50), 31921#(<= main_~i~0 51), 31922#(<= main_~i~0 52), 31923#(<= main_~i~0 53), 31924#(<= main_~i~0 54), 31925#(<= main_~i~0 55), 31926#(<= main_~i~0 56), 31927#(<= main_~i~0 57), 31928#(<= main_~i~0 58), 31929#(<= main_~i~0 59), 31930#(<= main_~i~0 60), 31931#(<= main_~i~0 61), 31932#(<= main_~i~0 62), 31933#(<= main_~i~0 63), 31934#(<= main_~i~0 64), 31935#(<= main_~i~0 65), 31936#(<= main_~i~0 66), 31937#(and (<= main_~i~0 66) (<= 0 main_~i~0)), 31938#(and (<= main_~i~0 67) (<= 1 main_~i~0)), 31868#true, 31869#false, 31870#(<= main_~i~0 0), 31871#(<= main_~i~0 1)] [2018-02-04 15:10:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:31,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 15:10:31,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 15:10:31,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 15:10:31,558 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-02-04 15:10:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:33,062 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-02-04 15:10:33,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 15:10:33,062 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-02-04 15:10:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:33,063 INFO L225 Difference]: With dead ends: 353 [2018-02-04 15:10:33,063 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 15:10:33,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 15:10:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 15:10:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-02-04 15:10:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 15:10:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-02-04 15:10:33,066 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-02-04 15:10:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:33,066 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-02-04 15:10:33,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 15:10:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-02-04 15:10:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-02-04 15:10:33,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:33,067 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:33,067 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:33,067 INFO L82 PathProgramCache]: Analyzing trace with hash -271767012, now seen corresponding path program 68 times [2018-02-04 15:10:33,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:33,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:34,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:34,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 15:10:34,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:34,381 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 15:10:34,381 INFO L182 omatonBuilderFactory]: Interpolants [32779#true, 32780#false, 32781#(<= main_~i~0 0), 32782#(<= main_~i~0 1), 32783#(<= main_~i~0 2), 32784#(<= main_~i~0 3), 32785#(<= main_~i~0 4), 32786#(<= main_~i~0 5), 32787#(<= main_~i~0 6), 32788#(<= main_~i~0 7), 32789#(<= main_~i~0 8), 32790#(<= main_~i~0 9), 32791#(<= main_~i~0 10), 32792#(<= main_~i~0 11), 32793#(<= main_~i~0 12), 32794#(<= main_~i~0 13), 32795#(<= main_~i~0 14), 32796#(<= main_~i~0 15), 32797#(<= main_~i~0 16), 32798#(<= main_~i~0 17), 32799#(<= main_~i~0 18), 32800#(<= main_~i~0 19), 32801#(<= main_~i~0 20), 32802#(<= main_~i~0 21), 32803#(<= main_~i~0 22), 32804#(<= main_~i~0 23), 32805#(<= main_~i~0 24), 32806#(<= main_~i~0 25), 32807#(<= main_~i~0 26), 32808#(<= main_~i~0 27), 32809#(<= main_~i~0 28), 32810#(<= main_~i~0 29), 32811#(<= main_~i~0 30), 32812#(<= main_~i~0 31), 32813#(<= main_~i~0 32), 32814#(<= main_~i~0 33), 32815#(<= main_~i~0 34), 32816#(<= main_~i~0 35), 32817#(<= main_~i~0 36), 32818#(<= main_~i~0 37), 32819#(<= main_~i~0 38), 32820#(<= main_~i~0 39), 32821#(<= main_~i~0 40), 32822#(<= main_~i~0 41), 32823#(<= main_~i~0 42), 32824#(<= main_~i~0 43), 32825#(<= main_~i~0 44), 32826#(<= main_~i~0 45), 32827#(<= main_~i~0 46), 32828#(<= main_~i~0 47), 32829#(<= main_~i~0 48), 32830#(<= main_~i~0 49), 32831#(<= main_~i~0 50), 32832#(<= main_~i~0 51), 32833#(<= main_~i~0 52), 32834#(<= main_~i~0 53), 32835#(<= main_~i~0 54), 32836#(<= main_~i~0 55), 32837#(<= main_~i~0 56), 32838#(<= main_~i~0 57), 32839#(<= main_~i~0 58), 32840#(<= main_~i~0 59), 32841#(<= main_~i~0 60), 32842#(<= main_~i~0 61), 32843#(<= main_~i~0 62), 32844#(<= main_~i~0 63), 32845#(<= main_~i~0 64), 32846#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 32847#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 32848#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 32849#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 32850#(and (<= 4 main_~i~0) (<= main_~i~0 68))] [2018-02-04 15:10:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:34,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 15:10:34,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 15:10:34,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 15:10:34,383 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-02-04 15:10:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:36,243 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-02-04 15:10:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 15:10:36,244 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-02-04 15:10:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:36,244 INFO L225 Difference]: With dead ends: 358 [2018-02-04 15:10:36,245 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 15:10:36,245 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 15:10:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 15:10:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-02-04 15:10:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 15:10:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-02-04 15:10:36,247 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-02-04 15:10:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:36,247 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-02-04 15:10:36,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 15:10:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-02-04 15:10:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 15:10:36,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:36,249 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:36,249 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -968650025, now seen corresponding path program 69 times [2018-02-04 15:10:36,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:36,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:37,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:37,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 15:10:37,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:37,598 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 15:10:37,599 INFO L182 omatonBuilderFactory]: Interpolants [33703#true, 33704#false, 33705#(<= main_~i~0 0), 33706#(<= main_~i~0 1), 33707#(<= main_~i~0 2), 33708#(<= main_~i~0 3), 33709#(<= main_~i~0 4), 33710#(<= main_~i~0 5), 33711#(<= main_~i~0 6), 33712#(<= main_~i~0 7), 33713#(<= main_~i~0 8), 33714#(<= main_~i~0 9), 33715#(<= main_~i~0 10), 33716#(<= main_~i~0 11), 33717#(<= main_~i~0 12), 33718#(<= main_~i~0 13), 33719#(<= main_~i~0 14), 33720#(<= main_~i~0 15), 33721#(<= main_~i~0 16), 33722#(<= main_~i~0 17), 33723#(<= main_~i~0 18), 33724#(<= main_~i~0 19), 33725#(<= main_~i~0 20), 33726#(<= main_~i~0 21), 33727#(<= main_~i~0 22), 33728#(<= main_~i~0 23), 33729#(<= main_~i~0 24), 33730#(<= main_~i~0 25), 33731#(<= main_~i~0 26), 33732#(<= main_~i~0 27), 33733#(<= main_~i~0 28), 33734#(<= main_~i~0 29), 33735#(<= main_~i~0 30), 33736#(<= main_~i~0 31), 33737#(<= main_~i~0 32), 33738#(<= main_~i~0 33), 33739#(<= main_~i~0 34), 33740#(<= main_~i~0 35), 33741#(<= main_~i~0 36), 33742#(<= main_~i~0 37), 33743#(<= main_~i~0 38), 33744#(<= main_~i~0 39), 33745#(<= main_~i~0 40), 33746#(<= main_~i~0 41), 33747#(<= main_~i~0 42), 33748#(<= main_~i~0 43), 33749#(<= main_~i~0 44), 33750#(<= main_~i~0 45), 33751#(<= main_~i~0 46), 33752#(<= main_~i~0 47), 33753#(<= main_~i~0 48), 33754#(<= main_~i~0 49), 33755#(<= main_~i~0 50), 33756#(<= main_~i~0 51), 33757#(<= main_~i~0 52), 33758#(<= main_~i~0 53), 33759#(<= main_~i~0 54), 33760#(<= main_~i~0 55), 33761#(<= main_~i~0 56), 33762#(<= main_~i~0 57), 33763#(<= main_~i~0 58), 33764#(<= main_~i~0 59), 33765#(<= main_~i~0 60), 33766#(<= main_~i~0 61), 33767#(<= main_~i~0 62), 33768#(<= main_~i~0 63), 33769#(<= main_~i~0 64), 33770#(<= main_~i~0 65), 33771#(<= main_~i~0 66), 33772#(<= main_~i~0 67), 33773#(<= main_~i~0 68), 33774#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 33775#(and (<= main_~i~0 69) (<= 1 main_~i~0))] [2018-02-04 15:10:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:37,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 15:10:37,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 15:10:37,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:10:37,600 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-02-04 15:10:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:39,148 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-02-04 15:10:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 15:10:39,149 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-02-04 15:10:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:39,149 INFO L225 Difference]: With dead ends: 363 [2018-02-04 15:10:39,149 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 15:10:39,150 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 15:10:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 15:10:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-02-04 15:10:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 15:10:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-02-04 15:10:39,152 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-02-04 15:10:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:39,152 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-02-04 15:10:39,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 15:10:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-02-04 15:10:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 15:10:39,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:39,153 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:39,153 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1084778236, now seen corresponding path program 70 times [2018-02-04 15:10:39,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:39,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:40,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:40,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 15:10:40,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:40,501 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 15:10:40,501 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 46), 34689#(<= main_~i~0 47), 34690#(<= main_~i~0 48), 34691#(<= main_~i~0 49), 34692#(<= main_~i~0 50), 34693#(<= main_~i~0 51), 34694#(<= main_~i~0 52), 34695#(<= main_~i~0 53), 34696#(<= main_~i~0 54), 34697#(<= main_~i~0 55), 34698#(<= main_~i~0 56), 34699#(<= main_~i~0 57), 34700#(<= main_~i~0 58), 34701#(<= main_~i~0 59), 34702#(<= main_~i~0 60), 34703#(<= main_~i~0 61), 34704#(<= main_~i~0 62), 34705#(<= main_~i~0 63), 34706#(<= main_~i~0 64), 34707#(<= main_~i~0 65), 34708#(<= main_~i~0 66), 34709#(<= main_~i~0 67), 34710#(<= main_~i~0 68), 34711#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 34712#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 34713#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 34640#true, 34641#false, 34642#(<= main_~i~0 0), 34643#(<= main_~i~0 1), 34644#(<= main_~i~0 2), 34645#(<= main_~i~0 3), 34646#(<= main_~i~0 4), 34647#(<= main_~i~0 5), 34648#(<= main_~i~0 6), 34649#(<= main_~i~0 7), 34650#(<= main_~i~0 8), 34651#(<= main_~i~0 9), 34652#(<= main_~i~0 10), 34653#(<= main_~i~0 11), 34654#(<= main_~i~0 12), 34655#(<= main_~i~0 13), 34656#(<= main_~i~0 14), 34657#(<= main_~i~0 15), 34658#(<= main_~i~0 16), 34659#(<= main_~i~0 17), 34660#(<= main_~i~0 18), 34661#(<= main_~i~0 19), 34662#(<= main_~i~0 20), 34663#(<= main_~i~0 21), 34664#(<= main_~i~0 22), 34665#(<= main_~i~0 23), 34666#(<= main_~i~0 24), 34667#(<= main_~i~0 25), 34668#(<= main_~i~0 26), 34669#(<= main_~i~0 27), 34670#(<= main_~i~0 28), 34671#(<= main_~i~0 29), 34672#(<= main_~i~0 30), 34673#(<= main_~i~0 31), 34674#(<= main_~i~0 32), 34675#(<= main_~i~0 33), 34676#(<= main_~i~0 34), 34677#(<= main_~i~0 35), 34678#(<= main_~i~0 36), 34679#(<= main_~i~0 37), 34680#(<= main_~i~0 38), 34681#(<= main_~i~0 39), 34682#(<= main_~i~0 40), 34683#(<= main_~i~0 41), 34684#(<= main_~i~0 42), 34685#(<= main_~i~0 43), 34686#(<= main_~i~0 44), 34687#(<= main_~i~0 45)] [2018-02-04 15:10:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:40,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 15:10:40,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 15:10:40,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 15:10:40,502 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-02-04 15:10:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:42,198 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-02-04 15:10:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 15:10:42,198 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-02-04 15:10:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:42,199 INFO L225 Difference]: With dead ends: 368 [2018-02-04 15:10:42,199 INFO L226 Difference]: Without dead ends: 368 [2018-02-04 15:10:42,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 15:10:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-04 15:10:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-02-04 15:10:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 15:10:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-02-04 15:10:42,202 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-02-04 15:10:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:42,202 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-02-04 15:10:42,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 15:10:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-02-04 15:10:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-02-04 15:10:42,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:42,203 INFO L351 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:42,203 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1488231945, now seen corresponding path program 71 times [2018-02-04 15:10:42,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:42,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:43,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:43,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 15:10:43,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:43,642 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 15:10:43,642 INFO L182 omatonBuilderFactory]: Interpolants [35590#true, 35591#false, 35592#(<= main_~i~0 0), 35593#(<= main_~i~0 1), 35594#(<= main_~i~0 2), 35595#(<= main_~i~0 3), 35596#(<= main_~i~0 4), 35597#(<= main_~i~0 5), 35598#(<= main_~i~0 6), 35599#(<= main_~i~0 7), 35600#(<= main_~i~0 8), 35601#(<= main_~i~0 9), 35602#(<= main_~i~0 10), 35603#(<= main_~i~0 11), 35604#(<= main_~i~0 12), 35605#(<= main_~i~0 13), 35606#(<= main_~i~0 14), 35607#(<= main_~i~0 15), 35608#(<= main_~i~0 16), 35609#(<= main_~i~0 17), 35610#(<= main_~i~0 18), 35611#(<= main_~i~0 19), 35612#(<= main_~i~0 20), 35613#(<= main_~i~0 21), 35614#(<= main_~i~0 22), 35615#(<= main_~i~0 23), 35616#(<= main_~i~0 24), 35617#(<= main_~i~0 25), 35618#(<= main_~i~0 26), 35619#(<= main_~i~0 27), 35620#(<= main_~i~0 28), 35621#(<= main_~i~0 29), 35622#(<= main_~i~0 30), 35623#(<= main_~i~0 31), 35624#(<= main_~i~0 32), 35625#(<= main_~i~0 33), 35626#(<= main_~i~0 34), 35627#(<= main_~i~0 35), 35628#(<= main_~i~0 36), 35629#(<= main_~i~0 37), 35630#(<= main_~i~0 38), 35631#(<= main_~i~0 39), 35632#(<= main_~i~0 40), 35633#(<= main_~i~0 41), 35634#(<= main_~i~0 42), 35635#(<= main_~i~0 43), 35636#(<= main_~i~0 44), 35637#(<= main_~i~0 45), 35638#(<= main_~i~0 46), 35639#(<= main_~i~0 47), 35640#(<= main_~i~0 48), 35641#(<= main_~i~0 49), 35642#(<= main_~i~0 50), 35643#(<= main_~i~0 51), 35644#(<= main_~i~0 52), 35645#(<= main_~i~0 53), 35646#(<= main_~i~0 54), 35647#(<= main_~i~0 55), 35648#(<= main_~i~0 56), 35649#(<= main_~i~0 57), 35650#(<= main_~i~0 58), 35651#(<= main_~i~0 59), 35652#(<= main_~i~0 60), 35653#(<= main_~i~0 61), 35654#(<= main_~i~0 62), 35655#(<= main_~i~0 63), 35656#(<= main_~i~0 64), 35657#(<= main_~i~0 65), 35658#(<= main_~i~0 66), 35659#(<= main_~i~0 67), 35660#(<= main_~i~0 68), 35661#(<= main_~i~0 69), 35662#(<= main_~i~0 70), 35663#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 35664#(and (<= 1 main_~i~0) (<= main_~i~0 71))] [2018-02-04 15:10:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:43,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 15:10:43,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 15:10:43,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 15:10:43,644 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 75 states. [2018-02-04 15:10:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:45,261 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-02-04 15:10:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 15:10:45,261 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-02-04 15:10:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:45,262 INFO L225 Difference]: With dead ends: 373 [2018-02-04 15:10:45,262 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 15:10:45,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-02-04 15:10:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 15:10:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-04 15:10:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 15:10:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-02-04 15:10:45,265 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-02-04 15:10:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:45,265 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-02-04 15:10:45,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 15:10:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-02-04 15:10:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-02-04 15:10:45,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:45,266 INFO L351 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:45,266 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1573194716, now seen corresponding path program 72 times [2018-02-04 15:10:45,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:45,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:46,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:46,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 15:10:46,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:46,670 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 15:10:46,670 INFO L182 omatonBuilderFactory]: Interpolants [36608#(<= main_~i~0 53), 36609#(<= main_~i~0 54), 36610#(<= main_~i~0 55), 36611#(<= main_~i~0 56), 36612#(<= main_~i~0 57), 36613#(<= main_~i~0 58), 36614#(<= main_~i~0 59), 36615#(<= main_~i~0 60), 36616#(<= main_~i~0 61), 36617#(<= main_~i~0 62), 36618#(<= main_~i~0 63), 36619#(<= main_~i~0 64), 36620#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 36621#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 36622#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 36623#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 36624#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 36625#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 36626#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 36627#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 36628#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 36553#true, 36554#false, 36555#(<= main_~i~0 0), 36556#(<= main_~i~0 1), 36557#(<= main_~i~0 2), 36558#(<= main_~i~0 3), 36559#(<= main_~i~0 4), 36560#(<= main_~i~0 5), 36561#(<= main_~i~0 6), 36562#(<= main_~i~0 7), 36563#(<= main_~i~0 8), 36564#(<= main_~i~0 9), 36565#(<= main_~i~0 10), 36566#(<= main_~i~0 11), 36567#(<= main_~i~0 12), 36568#(<= main_~i~0 13), 36569#(<= main_~i~0 14), 36570#(<= main_~i~0 15), 36571#(<= main_~i~0 16), 36572#(<= main_~i~0 17), 36573#(<= main_~i~0 18), 36574#(<= main_~i~0 19), 36575#(<= main_~i~0 20), 36576#(<= main_~i~0 21), 36577#(<= main_~i~0 22), 36578#(<= main_~i~0 23), 36579#(<= main_~i~0 24), 36580#(<= main_~i~0 25), 36581#(<= main_~i~0 26), 36582#(<= main_~i~0 27), 36583#(<= main_~i~0 28), 36584#(<= main_~i~0 29), 36585#(<= main_~i~0 30), 36586#(<= main_~i~0 31), 36587#(<= main_~i~0 32), 36588#(<= main_~i~0 33), 36589#(<= main_~i~0 34), 36590#(<= main_~i~0 35), 36591#(<= main_~i~0 36), 36592#(<= main_~i~0 37), 36593#(<= main_~i~0 38), 36594#(<= main_~i~0 39), 36595#(<= main_~i~0 40), 36596#(<= main_~i~0 41), 36597#(<= main_~i~0 42), 36598#(<= main_~i~0 43), 36599#(<= main_~i~0 44), 36600#(<= main_~i~0 45), 36601#(<= main_~i~0 46), 36602#(<= main_~i~0 47), 36603#(<= main_~i~0 48), 36604#(<= main_~i~0 49), 36605#(<= main_~i~0 50), 36606#(<= main_~i~0 51), 36607#(<= main_~i~0 52)] [2018-02-04 15:10:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:46,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 15:10:46,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 15:10:46,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:10:46,671 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 76 states. [2018-02-04 15:10:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:49,251 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-02-04 15:10:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 15:10:49,252 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 367 [2018-02-04 15:10:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:49,252 INFO L225 Difference]: With dead ends: 378 [2018-02-04 15:10:49,252 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 15:10:49,253 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 15:10:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 15:10:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-02-04 15:10:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 15:10:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-02-04 15:10:49,255 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-02-04 15:10:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:49,255 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-02-04 15:10:49,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 15:10:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-02-04 15:10:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-02-04 15:10:49,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:49,256 INFO L351 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:49,256 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1263351529, now seen corresponding path program 73 times [2018-02-04 15:10:49,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:49,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:50,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:50,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-02-04 15:10:50,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:50,785 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 15:10:50,785 INFO L182 omatonBuilderFactory]: Interpolants [37529#true, 37530#false, 37531#(<= main_~i~0 0), 37532#(<= main_~i~0 1), 37533#(<= main_~i~0 2), 37534#(<= main_~i~0 3), 37535#(<= main_~i~0 4), 37536#(<= main_~i~0 5), 37537#(<= main_~i~0 6), 37538#(<= main_~i~0 7), 37539#(<= main_~i~0 8), 37540#(<= main_~i~0 9), 37541#(<= main_~i~0 10), 37542#(<= main_~i~0 11), 37543#(<= main_~i~0 12), 37544#(<= main_~i~0 13), 37545#(<= main_~i~0 14), 37546#(<= main_~i~0 15), 37547#(<= main_~i~0 16), 37548#(<= main_~i~0 17), 37549#(<= main_~i~0 18), 37550#(<= main_~i~0 19), 37551#(<= main_~i~0 20), 37552#(<= main_~i~0 21), 37553#(<= main_~i~0 22), 37554#(<= main_~i~0 23), 37555#(<= main_~i~0 24), 37556#(<= main_~i~0 25), 37557#(<= main_~i~0 26), 37558#(<= main_~i~0 27), 37559#(<= main_~i~0 28), 37560#(<= main_~i~0 29), 37561#(<= main_~i~0 30), 37562#(<= main_~i~0 31), 37563#(<= main_~i~0 32), 37564#(<= main_~i~0 33), 37565#(<= main_~i~0 34), 37566#(<= main_~i~0 35), 37567#(<= main_~i~0 36), 37568#(<= main_~i~0 37), 37569#(<= main_~i~0 38), 37570#(<= main_~i~0 39), 37571#(<= main_~i~0 40), 37572#(<= main_~i~0 41), 37573#(<= main_~i~0 42), 37574#(<= main_~i~0 43), 37575#(<= main_~i~0 44), 37576#(<= main_~i~0 45), 37577#(<= main_~i~0 46), 37578#(<= main_~i~0 47), 37579#(<= main_~i~0 48), 37580#(<= main_~i~0 49), 37581#(<= main_~i~0 50), 37582#(<= main_~i~0 51), 37583#(<= main_~i~0 52), 37584#(<= main_~i~0 53), 37585#(<= main_~i~0 54), 37586#(<= main_~i~0 55), 37587#(<= main_~i~0 56), 37588#(<= main_~i~0 57), 37589#(<= main_~i~0 58), 37590#(<= main_~i~0 59), 37591#(<= main_~i~0 60), 37592#(<= main_~i~0 61), 37593#(<= main_~i~0 62), 37594#(<= main_~i~0 63), 37595#(<= main_~i~0 64), 37596#(<= main_~i~0 65), 37597#(<= main_~i~0 66), 37598#(<= main_~i~0 67), 37599#(<= main_~i~0 68), 37600#(<= main_~i~0 69), 37601#(<= main_~i~0 70), 37602#(<= main_~i~0 71), 37603#(<= main_~i~0 72), 37604#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 37605#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-02-04 15:10:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:50,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 15:10:50,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 15:10:50,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 15:10:50,786 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-02-04 15:10:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:52,538 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-02-04 15:10:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 15:10:52,539 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-02-04 15:10:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:52,539 INFO L225 Difference]: With dead ends: 383 [2018-02-04 15:10:52,539 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 15:10:52,540 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 15:10:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 15:10:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-02-04 15:10:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 15:10:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-02-04 15:10:52,542 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-02-04 15:10:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:52,542 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-02-04 15:10:52,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 15:10:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-02-04 15:10:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 15:10:52,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:52,544 INFO L351 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:52,544 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1837033284, now seen corresponding path program 74 times [2018-02-04 15:10:52,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:52,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:54,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:54,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 15:10:54,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:54,094 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 15:10:54,094 INFO L182 omatonBuilderFactory]: Interpolants [38528#(<= main_~i~0 8), 38529#(<= main_~i~0 9), 38530#(<= main_~i~0 10), 38531#(<= main_~i~0 11), 38532#(<= main_~i~0 12), 38533#(<= main_~i~0 13), 38534#(<= main_~i~0 14), 38535#(<= main_~i~0 15), 38536#(<= main_~i~0 16), 38537#(<= main_~i~0 17), 38538#(<= main_~i~0 18), 38539#(<= main_~i~0 19), 38540#(<= main_~i~0 20), 38541#(<= main_~i~0 21), 38542#(<= main_~i~0 22), 38543#(<= main_~i~0 23), 38544#(<= main_~i~0 24), 38545#(<= main_~i~0 25), 38546#(<= main_~i~0 26), 38547#(<= main_~i~0 27), 38548#(<= main_~i~0 28), 38549#(<= main_~i~0 29), 38550#(<= main_~i~0 30), 38551#(<= main_~i~0 31), 38552#(<= main_~i~0 32), 38553#(<= main_~i~0 33), 38554#(<= main_~i~0 34), 38555#(<= main_~i~0 35), 38556#(<= main_~i~0 36), 38557#(<= main_~i~0 37), 38558#(<= main_~i~0 38), 38559#(<= main_~i~0 39), 38560#(<= main_~i~0 40), 38561#(<= main_~i~0 41), 38562#(<= main_~i~0 42), 38563#(<= main_~i~0 43), 38564#(<= main_~i~0 44), 38565#(<= main_~i~0 45), 38566#(<= main_~i~0 46), 38567#(<= main_~i~0 47), 38568#(<= main_~i~0 48), 38569#(<= main_~i~0 49), 38570#(<= main_~i~0 50), 38571#(<= main_~i~0 51), 38572#(<= main_~i~0 52), 38573#(<= main_~i~0 53), 38574#(<= main_~i~0 54), 38575#(<= main_~i~0 55), 38576#(<= main_~i~0 56), 38577#(<= main_~i~0 57), 38578#(<= main_~i~0 58), 38579#(<= main_~i~0 59), 38580#(<= main_~i~0 60), 38581#(<= main_~i~0 61), 38582#(<= main_~i~0 62), 38583#(<= main_~i~0 63), 38584#(<= main_~i~0 64), 38585#(<= main_~i~0 65), 38586#(<= main_~i~0 66), 38587#(<= main_~i~0 67), 38588#(<= main_~i~0 68), 38589#(<= main_~i~0 69), 38590#(<= main_~i~0 70), 38591#(<= main_~i~0 71), 38592#(<= main_~i~0 72), 38593#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 38594#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 38595#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 38518#true, 38519#false, 38520#(<= main_~i~0 0), 38521#(<= main_~i~0 1), 38522#(<= main_~i~0 2), 38523#(<= main_~i~0 3), 38524#(<= main_~i~0 4), 38525#(<= main_~i~0 5), 38526#(<= main_~i~0 6), 38527#(<= main_~i~0 7)] [2018-02-04 15:10:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:54,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 15:10:54,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 15:10:54,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 15:10:54,095 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-02-04 15:10:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:56,052 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-02-04 15:10:56,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 15:10:56,052 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-02-04 15:10:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:56,053 INFO L225 Difference]: With dead ends: 388 [2018-02-04 15:10:56,053 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 15:10:56,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 15:10:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 15:10:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-02-04 15:10:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 15:10:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-02-04 15:10:56,056 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-02-04 15:10:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:56,057 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-02-04 15:10:56,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 15:10:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-02-04 15:10:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-02-04 15:10:56,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:56,058 INFO L351 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:56,058 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 232507447, now seen corresponding path program 75 times [2018-02-04 15:10:56,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:56,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:10:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:57,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:10:57,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-02-04 15:10:57,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:10:57,762 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 15:10:57,762 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= main_~i~0 30), 39553#(<= main_~i~0 31), 39554#(<= main_~i~0 32), 39555#(<= main_~i~0 33), 39556#(<= main_~i~0 34), 39557#(<= main_~i~0 35), 39558#(<= main_~i~0 36), 39559#(<= main_~i~0 37), 39560#(<= main_~i~0 38), 39561#(<= main_~i~0 39), 39562#(<= main_~i~0 40), 39563#(<= main_~i~0 41), 39564#(<= main_~i~0 42), 39565#(<= main_~i~0 43), 39566#(<= main_~i~0 44), 39567#(<= main_~i~0 45), 39568#(<= main_~i~0 46), 39569#(<= main_~i~0 47), 39570#(<= main_~i~0 48), 39571#(<= main_~i~0 49), 39572#(<= main_~i~0 50), 39573#(<= main_~i~0 51), 39574#(<= main_~i~0 52), 39575#(<= main_~i~0 53), 39576#(<= main_~i~0 54), 39577#(<= main_~i~0 55), 39578#(<= main_~i~0 56), 39579#(<= main_~i~0 57), 39580#(<= main_~i~0 58), 39581#(<= main_~i~0 59), 39582#(<= main_~i~0 60), 39583#(<= main_~i~0 61), 39584#(<= main_~i~0 62), 39585#(<= main_~i~0 63), 39586#(<= main_~i~0 64), 39587#(<= main_~i~0 65), 39588#(<= main_~i~0 66), 39589#(<= main_~i~0 67), 39590#(<= main_~i~0 68), 39591#(<= main_~i~0 69), 39592#(<= main_~i~0 70), 39593#(<= main_~i~0 71), 39594#(<= main_~i~0 72), 39595#(<= main_~i~0 73), 39596#(<= main_~i~0 74), 39597#(and (<= 0 main_~i~0) (<= main_~i~0 74)), 39598#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 39520#true, 39521#false, 39522#(<= main_~i~0 0), 39523#(<= main_~i~0 1), 39524#(<= main_~i~0 2), 39525#(<= main_~i~0 3), 39526#(<= main_~i~0 4), 39527#(<= main_~i~0 5), 39528#(<= main_~i~0 6), 39529#(<= main_~i~0 7), 39530#(<= main_~i~0 8), 39531#(<= main_~i~0 9), 39532#(<= main_~i~0 10), 39533#(<= main_~i~0 11), 39534#(<= main_~i~0 12), 39535#(<= main_~i~0 13), 39536#(<= main_~i~0 14), 39537#(<= main_~i~0 15), 39538#(<= main_~i~0 16), 39539#(<= main_~i~0 17), 39540#(<= main_~i~0 18), 39541#(<= main_~i~0 19), 39542#(<= main_~i~0 20), 39543#(<= main_~i~0 21), 39544#(<= main_~i~0 22), 39545#(<= main_~i~0 23), 39546#(<= main_~i~0 24), 39547#(<= main_~i~0 25), 39548#(<= main_~i~0 26), 39549#(<= main_~i~0 27), 39550#(<= main_~i~0 28), 39551#(<= main_~i~0 29)] [2018-02-04 15:10:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:10:57,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 15:10:57,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 15:10:57,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 15:10:57,764 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-02-04 15:10:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:10:59,664 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-02-04 15:10:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 15:10:59,664 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-02-04 15:10:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:10:59,665 INFO L225 Difference]: With dead ends: 393 [2018-02-04 15:10:59,665 INFO L226 Difference]: Without dead ends: 393 [2018-02-04 15:10:59,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-02-04 15:10:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-04 15:10:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-02-04 15:10:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 15:10:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-02-04 15:10:59,667 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-02-04 15:10:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:10:59,667 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-02-04 15:10:59,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 15:10:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-02-04 15:10:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-02-04 15:10:59,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:10:59,668 INFO L351 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-02-04 15:10:59,668 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:10:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 213552540, now seen corresponding path program 76 times [2018-02-04 15:10:59,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:10:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:10:59,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:01,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:01,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-02-04 15:11:01,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:01,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 15:11:01,357 INFO L182 omatonBuilderFactory]: Interpolants [40576#(<= main_~i~0 39), 40577#(<= main_~i~0 40), 40578#(<= main_~i~0 41), 40579#(<= main_~i~0 42), 40580#(<= main_~i~0 43), 40581#(<= main_~i~0 44), 40582#(<= main_~i~0 45), 40583#(<= main_~i~0 46), 40584#(<= main_~i~0 47), 40585#(<= main_~i~0 48), 40586#(<= main_~i~0 49), 40587#(<= main_~i~0 50), 40588#(<= main_~i~0 51), 40589#(<= main_~i~0 52), 40590#(<= main_~i~0 53), 40591#(<= main_~i~0 54), 40592#(<= main_~i~0 55), 40593#(<= main_~i~0 56), 40594#(<= main_~i~0 57), 40595#(<= main_~i~0 58), 40596#(<= main_~i~0 59), 40597#(<= main_~i~0 60), 40598#(<= main_~i~0 61), 40599#(<= main_~i~0 62), 40600#(<= main_~i~0 63), 40601#(<= main_~i~0 64), 40602#(<= main_~i~0 65), 40603#(<= main_~i~0 66), 40604#(<= main_~i~0 67), 40605#(<= main_~i~0 68), 40606#(<= main_~i~0 69), 40607#(<= main_~i~0 70), 40608#(<= main_~i~0 71), 40609#(<= main_~i~0 72), 40610#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 40611#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 40612#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 40613#(and (<= main_~i~0 75) (<= 3 main_~i~0)), 40614#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 40535#true, 40536#false, 40537#(<= main_~i~0 0), 40538#(<= main_~i~0 1), 40539#(<= main_~i~0 2), 40540#(<= main_~i~0 3), 40541#(<= main_~i~0 4), 40542#(<= main_~i~0 5), 40543#(<= main_~i~0 6), 40544#(<= main_~i~0 7), 40545#(<= main_~i~0 8), 40546#(<= main_~i~0 9), 40547#(<= main_~i~0 10), 40548#(<= main_~i~0 11), 40549#(<= main_~i~0 12), 40550#(<= main_~i~0 13), 40551#(<= main_~i~0 14), 40552#(<= main_~i~0 15), 40553#(<= main_~i~0 16), 40554#(<= main_~i~0 17), 40555#(<= main_~i~0 18), 40556#(<= main_~i~0 19), 40557#(<= main_~i~0 20), 40558#(<= main_~i~0 21), 40559#(<= main_~i~0 22), 40560#(<= main_~i~0 23), 40561#(<= main_~i~0 24), 40562#(<= main_~i~0 25), 40563#(<= main_~i~0 26), 40564#(<= main_~i~0 27), 40565#(<= main_~i~0 28), 40566#(<= main_~i~0 29), 40567#(<= main_~i~0 30), 40568#(<= main_~i~0 31), 40569#(<= main_~i~0 32), 40570#(<= main_~i~0 33), 40571#(<= main_~i~0 34), 40572#(<= main_~i~0 35), 40573#(<= main_~i~0 36), 40574#(<= main_~i~0 37), 40575#(<= main_~i~0 38)] [2018-02-04 15:11:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:01,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 15:11:01,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 15:11:01,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 15:11:01,358 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-02-04 15:11:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:04,076 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-02-04 15:11:04,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 15:11:04,076 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-02-04 15:11:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:04,077 INFO L225 Difference]: With dead ends: 398 [2018-02-04 15:11:04,077 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 15:11:04,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 15:11:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 15:11:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-02-04 15:11:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 15:11:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-02-04 15:11:04,079 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-02-04 15:11:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:04,080 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-02-04 15:11:04,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 15:11:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-02-04 15:11:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-02-04 15:11:04,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:04,081 INFO L351 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:04,081 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2141740887, now seen corresponding path program 77 times [2018-02-04 15:11:04,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:04,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:05,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:05,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-02-04 15:11:05,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:05,889 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 15:11:05,889 INFO L182 omatonBuilderFactory]: Interpolants [41600#(<= main_~i~0 35), 41601#(<= main_~i~0 36), 41602#(<= main_~i~0 37), 41603#(<= main_~i~0 38), 41604#(<= main_~i~0 39), 41605#(<= main_~i~0 40), 41606#(<= main_~i~0 41), 41607#(<= main_~i~0 42), 41608#(<= main_~i~0 43), 41609#(<= main_~i~0 44), 41610#(<= main_~i~0 45), 41611#(<= main_~i~0 46), 41612#(<= main_~i~0 47), 41613#(<= main_~i~0 48), 41614#(<= main_~i~0 49), 41615#(<= main_~i~0 50), 41616#(<= main_~i~0 51), 41617#(<= main_~i~0 52), 41618#(<= main_~i~0 53), 41619#(<= main_~i~0 54), 41620#(<= main_~i~0 55), 41621#(<= main_~i~0 56), 41622#(<= main_~i~0 57), 41623#(<= main_~i~0 58), 41624#(<= main_~i~0 59), 41625#(<= main_~i~0 60), 41626#(<= main_~i~0 61), 41627#(<= main_~i~0 62), 41628#(<= main_~i~0 63), 41629#(<= main_~i~0 64), 41630#(<= main_~i~0 65), 41631#(<= main_~i~0 66), 41632#(<= main_~i~0 67), 41633#(<= main_~i~0 68), 41634#(<= main_~i~0 69), 41635#(<= main_~i~0 70), 41636#(<= main_~i~0 71), 41637#(<= main_~i~0 72), 41638#(<= main_~i~0 73), 41639#(<= main_~i~0 74), 41640#(<= main_~i~0 75), 41641#(<= main_~i~0 76), 41642#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 41643#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 41563#true, 41564#false, 41565#(<= main_~i~0 0), 41566#(<= main_~i~0 1), 41567#(<= main_~i~0 2), 41568#(<= main_~i~0 3), 41569#(<= main_~i~0 4), 41570#(<= main_~i~0 5), 41571#(<= main_~i~0 6), 41572#(<= main_~i~0 7), 41573#(<= main_~i~0 8), 41574#(<= main_~i~0 9), 41575#(<= main_~i~0 10), 41576#(<= main_~i~0 11), 41577#(<= main_~i~0 12), 41578#(<= main_~i~0 13), 41579#(<= main_~i~0 14), 41580#(<= main_~i~0 15), 41581#(<= main_~i~0 16), 41582#(<= main_~i~0 17), 41583#(<= main_~i~0 18), 41584#(<= main_~i~0 19), 41585#(<= main_~i~0 20), 41586#(<= main_~i~0 21), 41587#(<= main_~i~0 22), 41588#(<= main_~i~0 23), 41589#(<= main_~i~0 24), 41590#(<= main_~i~0 25), 41591#(<= main_~i~0 26), 41592#(<= main_~i~0 27), 41593#(<= main_~i~0 28), 41594#(<= main_~i~0 29), 41595#(<= main_~i~0 30), 41596#(<= main_~i~0 31), 41597#(<= main_~i~0 32), 41598#(<= main_~i~0 33), 41599#(<= main_~i~0 34)] [2018-02-04 15:11:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:05,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 15:11:05,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 15:11:05,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 15:11:05,890 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 81 states. [2018-02-04 15:11:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:07,804 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-02-04 15:11:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 15:11:07,804 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-02-04 15:11:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:07,805 INFO L225 Difference]: With dead ends: 403 [2018-02-04 15:11:07,805 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 15:11:07,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9246, Invalid=15560, Unknown=0, NotChecked=0, Total=24806 [2018-02-04 15:11:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 15:11:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-04 15:11:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 15:11:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-02-04 15:11:07,808 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-02-04 15:11:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:07,808 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-02-04 15:11:07,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 15:11:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-02-04 15:11:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 15:11:07,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:07,809 INFO L351 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:07,809 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1127257476, now seen corresponding path program 78 times [2018-02-04 15:11:07,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:07,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:09,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:09,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 15:11:09,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:09,540 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 15:11:09,540 INFO L182 omatonBuilderFactory]: Interpolants [42624#(<= main_~i~0 18), 42625#(<= main_~i~0 19), 42626#(<= main_~i~0 20), 42627#(<= main_~i~0 21), 42628#(<= main_~i~0 22), 42629#(<= main_~i~0 23), 42630#(<= main_~i~0 24), 42631#(<= main_~i~0 25), 42632#(<= main_~i~0 26), 42633#(<= main_~i~0 27), 42634#(<= main_~i~0 28), 42635#(<= main_~i~0 29), 42636#(<= main_~i~0 30), 42637#(<= main_~i~0 31), 42638#(<= main_~i~0 32), 42639#(<= main_~i~0 33), 42640#(<= main_~i~0 34), 42641#(<= main_~i~0 35), 42642#(<= main_~i~0 36), 42643#(<= main_~i~0 37), 42644#(<= main_~i~0 38), 42645#(<= main_~i~0 39), 42646#(<= main_~i~0 40), 42647#(<= main_~i~0 41), 42648#(<= main_~i~0 42), 42649#(<= main_~i~0 43), 42650#(<= main_~i~0 44), 42651#(<= main_~i~0 45), 42652#(<= main_~i~0 46), 42653#(<= main_~i~0 47), 42654#(<= main_~i~0 48), 42655#(<= main_~i~0 49), 42656#(<= main_~i~0 50), 42657#(<= main_~i~0 51), 42658#(<= main_~i~0 52), 42659#(<= main_~i~0 53), 42660#(<= main_~i~0 54), 42661#(<= main_~i~0 55), 42662#(<= main_~i~0 56), 42663#(<= main_~i~0 57), 42664#(<= main_~i~0 58), 42665#(<= main_~i~0 59), 42666#(<= main_~i~0 60), 42667#(<= main_~i~0 61), 42668#(<= main_~i~0 62), 42669#(<= main_~i~0 63), 42670#(<= main_~i~0 64), 42671#(<= main_~i~0 65), 42672#(<= main_~i~0 66), 42673#(<= main_~i~0 67), 42674#(<= main_~i~0 68), 42675#(<= main_~i~0 69), 42676#(<= main_~i~0 70), 42677#(<= main_~i~0 71), 42678#(<= main_~i~0 72), 42679#(<= main_~i~0 73), 42680#(<= main_~i~0 74), 42681#(<= main_~i~0 75), 42682#(<= main_~i~0 76), 42683#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 42684#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 42685#(and (<= 2 main_~i~0) (<= main_~i~0 78)), 42604#true, 42605#false, 42606#(<= main_~i~0 0), 42607#(<= main_~i~0 1), 42608#(<= main_~i~0 2), 42609#(<= main_~i~0 3), 42610#(<= main_~i~0 4), 42611#(<= main_~i~0 5), 42612#(<= main_~i~0 6), 42613#(<= main_~i~0 7), 42614#(<= main_~i~0 8), 42615#(<= main_~i~0 9), 42616#(<= main_~i~0 10), 42617#(<= main_~i~0 11), 42618#(<= main_~i~0 12), 42619#(<= main_~i~0 13), 42620#(<= main_~i~0 14), 42621#(<= main_~i~0 15), 42622#(<= main_~i~0 16), 42623#(<= main_~i~0 17)] [2018-02-04 15:11:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:09,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 15:11:09,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 15:11:09,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 15:11:09,541 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 82 states. [2018-02-04 15:11:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:11,685 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-02-04 15:11:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 15:11:11,685 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 397 [2018-02-04 15:11:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:11,686 INFO L225 Difference]: With dead ends: 408 [2018-02-04 15:11:11,686 INFO L226 Difference]: Without dead ends: 408 [2018-02-04 15:11:11,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9327, Invalid=16113, Unknown=0, NotChecked=0, Total=25440 [2018-02-04 15:11:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-04 15:11:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-02-04 15:11:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 15:11:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-02-04 15:11:11,689 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 397 [2018-02-04 15:11:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:11,689 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-02-04 15:11:11,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 15:11:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-02-04 15:11:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-02-04 15:11:11,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:11,690 INFO L351 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:11,691 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1535472009, now seen corresponding path program 79 times [2018-02-04 15:11:11,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:11,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:13,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:13,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-02-04 15:11:13,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:13,512 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 15:11:13,512 INFO L182 omatonBuilderFactory]: Interpolants [43658#true, 43659#false, 43660#(<= main_~i~0 0), 43661#(<= main_~i~0 1), 43662#(<= main_~i~0 2), 43663#(<= main_~i~0 3), 43664#(<= main_~i~0 4), 43665#(<= main_~i~0 5), 43666#(<= main_~i~0 6), 43667#(<= main_~i~0 7), 43668#(<= main_~i~0 8), 43669#(<= main_~i~0 9), 43670#(<= main_~i~0 10), 43671#(<= main_~i~0 11), 43672#(<= main_~i~0 12), 43673#(<= main_~i~0 13), 43674#(<= main_~i~0 14), 43675#(<= main_~i~0 15), 43676#(<= main_~i~0 16), 43677#(<= main_~i~0 17), 43678#(<= main_~i~0 18), 43679#(<= main_~i~0 19), 43680#(<= main_~i~0 20), 43681#(<= main_~i~0 21), 43682#(<= main_~i~0 22), 43683#(<= main_~i~0 23), 43684#(<= main_~i~0 24), 43685#(<= main_~i~0 25), 43686#(<= main_~i~0 26), 43687#(<= main_~i~0 27), 43688#(<= main_~i~0 28), 43689#(<= main_~i~0 29), 43690#(<= main_~i~0 30), 43691#(<= main_~i~0 31), 43692#(<= main_~i~0 32), 43693#(<= main_~i~0 33), 43694#(<= main_~i~0 34), 43695#(<= main_~i~0 35), 43696#(<= main_~i~0 36), 43697#(<= main_~i~0 37), 43698#(<= main_~i~0 38), 43699#(<= main_~i~0 39), 43700#(<= main_~i~0 40), 43701#(<= main_~i~0 41), 43702#(<= main_~i~0 42), 43703#(<= main_~i~0 43), 43704#(<= main_~i~0 44), 43705#(<= main_~i~0 45), 43706#(<= main_~i~0 46), 43707#(<= main_~i~0 47), 43708#(<= main_~i~0 48), 43709#(<= main_~i~0 49), 43710#(<= main_~i~0 50), 43711#(<= main_~i~0 51), 43712#(<= main_~i~0 52), 43713#(<= main_~i~0 53), 43714#(<= main_~i~0 54), 43715#(<= main_~i~0 55), 43716#(<= main_~i~0 56), 43717#(<= main_~i~0 57), 43718#(<= main_~i~0 58), 43719#(<= main_~i~0 59), 43720#(<= main_~i~0 60), 43721#(<= main_~i~0 61), 43722#(<= main_~i~0 62), 43723#(<= main_~i~0 63), 43724#(<= main_~i~0 64), 43725#(<= main_~i~0 65), 43726#(<= main_~i~0 66), 43727#(<= main_~i~0 67), 43728#(<= main_~i~0 68), 43729#(<= main_~i~0 69), 43730#(<= main_~i~0 70), 43731#(<= main_~i~0 71), 43732#(<= main_~i~0 72), 43733#(<= main_~i~0 73), 43734#(<= main_~i~0 74), 43735#(<= main_~i~0 75), 43736#(<= main_~i~0 76), 43737#(<= main_~i~0 77), 43738#(<= main_~i~0 78), 43739#(and (<= 0 main_~i~0) (<= main_~i~0 78)), 43740#(and (<= 1 main_~i~0) (<= main_~i~0 79))] [2018-02-04 15:11:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:13,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 15:11:13,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 15:11:13,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 15:11:13,513 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 83 states. [2018-02-04 15:11:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:15,573 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-02-04 15:11:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-02-04 15:11:15,574 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-02-04 15:11:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:15,575 INFO L225 Difference]: With dead ends: 413 [2018-02-04 15:11:15,575 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 15:11:15,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9723, Invalid=16359, Unknown=0, NotChecked=0, Total=26082 [2018-02-04 15:11:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 15:11:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-02-04 15:11:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 15:11:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-02-04 15:11:15,578 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 402 [2018-02-04 15:11:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:15,578 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-02-04 15:11:15,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 15:11:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-02-04 15:11:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-02-04 15:11:15,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:15,579 INFO L351 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:15,579 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 899526492, now seen corresponding path program 80 times [2018-02-04 15:11:15,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:15,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:17,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:17,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-02-04 15:11:17,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:17,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 15:11:17,358 INFO L182 omatonBuilderFactory]: Interpolants [44800#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 44801#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 44802#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 44803#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 44804#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 44805#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 44806#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 44807#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 44808#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 44725#true, 44726#false, 44727#(<= main_~i~0 0), 44728#(<= main_~i~0 1), 44729#(<= main_~i~0 2), 44730#(<= main_~i~0 3), 44731#(<= main_~i~0 4), 44732#(<= main_~i~0 5), 44733#(<= main_~i~0 6), 44734#(<= main_~i~0 7), 44735#(<= main_~i~0 8), 44736#(<= main_~i~0 9), 44737#(<= main_~i~0 10), 44738#(<= main_~i~0 11), 44739#(<= main_~i~0 12), 44740#(<= main_~i~0 13), 44741#(<= main_~i~0 14), 44742#(<= main_~i~0 15), 44743#(<= main_~i~0 16), 44744#(<= main_~i~0 17), 44745#(<= main_~i~0 18), 44746#(<= main_~i~0 19), 44747#(<= main_~i~0 20), 44748#(<= main_~i~0 21), 44749#(<= main_~i~0 22), 44750#(<= main_~i~0 23), 44751#(<= main_~i~0 24), 44752#(<= main_~i~0 25), 44753#(<= main_~i~0 26), 44754#(<= main_~i~0 27), 44755#(<= main_~i~0 28), 44756#(<= main_~i~0 29), 44757#(<= main_~i~0 30), 44758#(<= main_~i~0 31), 44759#(<= main_~i~0 32), 44760#(<= main_~i~0 33), 44761#(<= main_~i~0 34), 44762#(<= main_~i~0 35), 44763#(<= main_~i~0 36), 44764#(<= main_~i~0 37), 44765#(<= main_~i~0 38), 44766#(<= main_~i~0 39), 44767#(<= main_~i~0 40), 44768#(<= main_~i~0 41), 44769#(<= main_~i~0 42), 44770#(<= main_~i~0 43), 44771#(<= main_~i~0 44), 44772#(<= main_~i~0 45), 44773#(<= main_~i~0 46), 44774#(<= main_~i~0 47), 44775#(<= main_~i~0 48), 44776#(<= main_~i~0 49), 44777#(<= main_~i~0 50), 44778#(<= main_~i~0 51), 44779#(<= main_~i~0 52), 44780#(<= main_~i~0 53), 44781#(<= main_~i~0 54), 44782#(<= main_~i~0 55), 44783#(<= main_~i~0 56), 44784#(<= main_~i~0 57), 44785#(<= main_~i~0 58), 44786#(<= main_~i~0 59), 44787#(<= main_~i~0 60), 44788#(<= main_~i~0 61), 44789#(<= main_~i~0 62), 44790#(<= main_~i~0 63), 44791#(<= main_~i~0 64), 44792#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 44793#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 44794#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 44795#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 44796#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 44797#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 44798#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 44799#(and (<= 7 main_~i~0) (<= main_~i~0 71))] [2018-02-04 15:11:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:17,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 15:11:17,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 15:11:17,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 15:11:17,359 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 84 states. [2018-02-04 15:11:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:21,757 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-02-04 15:11:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 15:11:21,757 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 407 [2018-02-04 15:11:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:21,758 INFO L225 Difference]: With dead ends: 418 [2018-02-04 15:11:21,758 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 15:11:21,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4279 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7671, Invalid=19061, Unknown=0, NotChecked=0, Total=26732 [2018-02-04 15:11:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 15:11:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-02-04 15:11:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-04 15:11:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-02-04 15:11:21,760 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 407 [2018-02-04 15:11:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:21,761 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-02-04 15:11:21,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 15:11:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-02-04 15:11:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-02-04 15:11:21,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:21,762 INFO L351 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:21,762 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 70538647, now seen corresponding path program 81 times [2018-02-04 15:11:21,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:21,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:23,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:23,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-02-04 15:11:23,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:23,645 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 15:11:23,645 INFO L182 omatonBuilderFactory]: Interpolants [45824#(<= main_~i~0 17), 45825#(<= main_~i~0 18), 45826#(<= main_~i~0 19), 45827#(<= main_~i~0 20), 45828#(<= main_~i~0 21), 45829#(<= main_~i~0 22), 45830#(<= main_~i~0 23), 45831#(<= main_~i~0 24), 45832#(<= main_~i~0 25), 45833#(<= main_~i~0 26), 45834#(<= main_~i~0 27), 45835#(<= main_~i~0 28), 45836#(<= main_~i~0 29), 45837#(<= main_~i~0 30), 45838#(<= main_~i~0 31), 45839#(<= main_~i~0 32), 45840#(<= main_~i~0 33), 45841#(<= main_~i~0 34), 45842#(<= main_~i~0 35), 45843#(<= main_~i~0 36), 45844#(<= main_~i~0 37), 45845#(<= main_~i~0 38), 45846#(<= main_~i~0 39), 45847#(<= main_~i~0 40), 45848#(<= main_~i~0 41), 45849#(<= main_~i~0 42), 45850#(<= main_~i~0 43), 45851#(<= main_~i~0 44), 45852#(<= main_~i~0 45), 45853#(<= main_~i~0 46), 45854#(<= main_~i~0 47), 45855#(<= main_~i~0 48), 45856#(<= main_~i~0 49), 45857#(<= main_~i~0 50), 45858#(<= main_~i~0 51), 45859#(<= main_~i~0 52), 45860#(<= main_~i~0 53), 45861#(<= main_~i~0 54), 45862#(<= main_~i~0 55), 45863#(<= main_~i~0 56), 45864#(<= main_~i~0 57), 45865#(<= main_~i~0 58), 45866#(<= main_~i~0 59), 45867#(<= main_~i~0 60), 45868#(<= main_~i~0 61), 45869#(<= main_~i~0 62), 45870#(<= main_~i~0 63), 45871#(<= main_~i~0 64), 45872#(<= main_~i~0 65), 45873#(<= main_~i~0 66), 45874#(<= main_~i~0 67), 45875#(<= main_~i~0 68), 45876#(<= main_~i~0 69), 45877#(<= main_~i~0 70), 45878#(<= main_~i~0 71), 45879#(<= main_~i~0 72), 45880#(<= main_~i~0 73), 45881#(<= main_~i~0 74), 45882#(<= main_~i~0 75), 45883#(<= main_~i~0 76), 45884#(<= main_~i~0 77), 45885#(<= main_~i~0 78), 45886#(<= main_~i~0 79), 45887#(<= main_~i~0 80), 45888#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 45889#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 45805#true, 45806#false, 45807#(<= main_~i~0 0), 45808#(<= main_~i~0 1), 45809#(<= main_~i~0 2), 45810#(<= main_~i~0 3), 45811#(<= main_~i~0 4), 45812#(<= main_~i~0 5), 45813#(<= main_~i~0 6), 45814#(<= main_~i~0 7), 45815#(<= main_~i~0 8), 45816#(<= main_~i~0 9), 45817#(<= main_~i~0 10), 45818#(<= main_~i~0 11), 45819#(<= main_~i~0 12), 45820#(<= main_~i~0 13), 45821#(<= main_~i~0 14), 45822#(<= main_~i~0 15), 45823#(<= main_~i~0 16)] [2018-02-04 15:11:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:23,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 15:11:23,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 15:11:23,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:11:23,647 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 85 states. [2018-02-04 15:11:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:25,695 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-02-04 15:11:25,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-02-04 15:11:25,695 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-02-04 15:11:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:25,696 INFO L225 Difference]: With dead ends: 423 [2018-02-04 15:11:25,696 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 15:11:25,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=10212, Invalid=17178, Unknown=0, NotChecked=0, Total=27390 [2018-02-04 15:11:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 15:11:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-02-04 15:11:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 15:11:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-02-04 15:11:25,699 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 412 [2018-02-04 15:11:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:25,699 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-02-04 15:11:25,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 15:11:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-02-04 15:11:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 15:11:25,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:25,701 INFO L351 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:25,701 INFO L371 AbstractCegarLoop]: === Iteration 87 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1937548228, now seen corresponding path program 82 times [2018-02-04 15:11:25,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:25,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:27,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:27,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-02-04 15:11:27,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:27,642 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 15:11:27,643 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= main_~i~0 76), 46977#(<= main_~i~0 77), 46978#(<= main_~i~0 78), 46979#(<= main_~i~0 79), 46980#(<= main_~i~0 80), 46981#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 46982#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 46983#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 46898#true, 46899#false, 46900#(<= main_~i~0 0), 46901#(<= main_~i~0 1), 46902#(<= main_~i~0 2), 46903#(<= main_~i~0 3), 46904#(<= main_~i~0 4), 46905#(<= main_~i~0 5), 46906#(<= main_~i~0 6), 46907#(<= main_~i~0 7), 46908#(<= main_~i~0 8), 46909#(<= main_~i~0 9), 46910#(<= main_~i~0 10), 46911#(<= main_~i~0 11), 46912#(<= main_~i~0 12), 46913#(<= main_~i~0 13), 46914#(<= main_~i~0 14), 46915#(<= main_~i~0 15), 46916#(<= main_~i~0 16), 46917#(<= main_~i~0 17), 46918#(<= main_~i~0 18), 46919#(<= main_~i~0 19), 46920#(<= main_~i~0 20), 46921#(<= main_~i~0 21), 46922#(<= main_~i~0 22), 46923#(<= main_~i~0 23), 46924#(<= main_~i~0 24), 46925#(<= main_~i~0 25), 46926#(<= main_~i~0 26), 46927#(<= main_~i~0 27), 46928#(<= main_~i~0 28), 46929#(<= main_~i~0 29), 46930#(<= main_~i~0 30), 46931#(<= main_~i~0 31), 46932#(<= main_~i~0 32), 46933#(<= main_~i~0 33), 46934#(<= main_~i~0 34), 46935#(<= main_~i~0 35), 46936#(<= main_~i~0 36), 46937#(<= main_~i~0 37), 46938#(<= main_~i~0 38), 46939#(<= main_~i~0 39), 46940#(<= main_~i~0 40), 46941#(<= main_~i~0 41), 46942#(<= main_~i~0 42), 46943#(<= main_~i~0 43), 46944#(<= main_~i~0 44), 46945#(<= main_~i~0 45), 46946#(<= main_~i~0 46), 46947#(<= main_~i~0 47), 46948#(<= main_~i~0 48), 46949#(<= main_~i~0 49), 46950#(<= main_~i~0 50), 46951#(<= main_~i~0 51), 46952#(<= main_~i~0 52), 46953#(<= main_~i~0 53), 46954#(<= main_~i~0 54), 46955#(<= main_~i~0 55), 46956#(<= main_~i~0 56), 46957#(<= main_~i~0 57), 46958#(<= main_~i~0 58), 46959#(<= main_~i~0 59), 46960#(<= main_~i~0 60), 46961#(<= main_~i~0 61), 46962#(<= main_~i~0 62), 46963#(<= main_~i~0 63), 46964#(<= main_~i~0 64), 46965#(<= main_~i~0 65), 46966#(<= main_~i~0 66), 46967#(<= main_~i~0 67), 46968#(<= main_~i~0 68), 46969#(<= main_~i~0 69), 46970#(<= main_~i~0 70), 46971#(<= main_~i~0 71), 46972#(<= main_~i~0 72), 46973#(<= main_~i~0 73), 46974#(<= main_~i~0 74), 46975#(<= main_~i~0 75)] [2018-02-04 15:11:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:27,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 15:11:27,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 15:11:27,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 15:11:27,644 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 86 states. [2018-02-04 15:11:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:29,887 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-02-04 15:11:29,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 15:11:29,887 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 417 [2018-02-04 15:11:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:29,888 INFO L225 Difference]: With dead ends: 428 [2018-02-04 15:11:29,888 INFO L226 Difference]: Without dead ends: 428 [2018-02-04 15:11:29,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-02-04 15:11:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-04 15:11:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-02-04 15:11:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 15:11:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-02-04 15:11:29,892 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 417 [2018-02-04 15:11:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:29,892 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-02-04 15:11:29,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 15:11:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-02-04 15:11:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-02-04 15:11:29,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:29,893 INFO L351 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:29,893 INFO L371 AbstractCegarLoop]: === Iteration 88 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 876065975, now seen corresponding path program 83 times [2018-02-04 15:11:29,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:29,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:31,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:31,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-02-04 15:11:31,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:31,885 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 15:11:31,886 INFO L182 omatonBuilderFactory]: Interpolants [48004#true, 48005#false, 48006#(<= main_~i~0 0), 48007#(<= main_~i~0 1), 48008#(<= main_~i~0 2), 48009#(<= main_~i~0 3), 48010#(<= main_~i~0 4), 48011#(<= main_~i~0 5), 48012#(<= main_~i~0 6), 48013#(<= main_~i~0 7), 48014#(<= main_~i~0 8), 48015#(<= main_~i~0 9), 48016#(<= main_~i~0 10), 48017#(<= main_~i~0 11), 48018#(<= main_~i~0 12), 48019#(<= main_~i~0 13), 48020#(<= main_~i~0 14), 48021#(<= main_~i~0 15), 48022#(<= main_~i~0 16), 48023#(<= main_~i~0 17), 48024#(<= main_~i~0 18), 48025#(<= main_~i~0 19), 48026#(<= main_~i~0 20), 48027#(<= main_~i~0 21), 48028#(<= main_~i~0 22), 48029#(<= main_~i~0 23), 48030#(<= main_~i~0 24), 48031#(<= main_~i~0 25), 48032#(<= main_~i~0 26), 48033#(<= main_~i~0 27), 48034#(<= main_~i~0 28), 48035#(<= main_~i~0 29), 48036#(<= main_~i~0 30), 48037#(<= main_~i~0 31), 48038#(<= main_~i~0 32), 48039#(<= main_~i~0 33), 48040#(<= main_~i~0 34), 48041#(<= main_~i~0 35), 48042#(<= main_~i~0 36), 48043#(<= main_~i~0 37), 48044#(<= main_~i~0 38), 48045#(<= main_~i~0 39), 48046#(<= main_~i~0 40), 48047#(<= main_~i~0 41), 48048#(<= main_~i~0 42), 48049#(<= main_~i~0 43), 48050#(<= main_~i~0 44), 48051#(<= main_~i~0 45), 48052#(<= main_~i~0 46), 48053#(<= main_~i~0 47), 48054#(<= main_~i~0 48), 48055#(<= main_~i~0 49), 48056#(<= main_~i~0 50), 48057#(<= main_~i~0 51), 48058#(<= main_~i~0 52), 48059#(<= main_~i~0 53), 48060#(<= main_~i~0 54), 48061#(<= main_~i~0 55), 48062#(<= main_~i~0 56), 48063#(<= main_~i~0 57), 48064#(<= main_~i~0 58), 48065#(<= main_~i~0 59), 48066#(<= main_~i~0 60), 48067#(<= main_~i~0 61), 48068#(<= main_~i~0 62), 48069#(<= main_~i~0 63), 48070#(<= main_~i~0 64), 48071#(<= main_~i~0 65), 48072#(<= main_~i~0 66), 48073#(<= main_~i~0 67), 48074#(<= main_~i~0 68), 48075#(<= main_~i~0 69), 48076#(<= main_~i~0 70), 48077#(<= main_~i~0 71), 48078#(<= main_~i~0 72), 48079#(<= main_~i~0 73), 48080#(<= main_~i~0 74), 48081#(<= main_~i~0 75), 48082#(<= main_~i~0 76), 48083#(<= main_~i~0 77), 48084#(<= main_~i~0 78), 48085#(<= main_~i~0 79), 48086#(<= main_~i~0 80), 48087#(<= main_~i~0 81), 48088#(<= main_~i~0 82), 48089#(and (<= 0 main_~i~0) (<= main_~i~0 82)), 48090#(and (<= 1 main_~i~0) (<= main_~i~0 83))] [2018-02-04 15:11:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:31,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 15:11:31,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 15:11:31,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3575, Invalid=3907, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 15:11:31,887 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 87 states. [2018-02-04 15:11:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:34,027 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-02-04 15:11:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 15:11:34,027 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-02-04 15:11:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:34,028 INFO L225 Difference]: With dead ends: 433 [2018-02-04 15:11:34,028 INFO L226 Difference]: Without dead ends: 433 [2018-02-04 15:11:34,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=10713, Invalid=18017, Unknown=0, NotChecked=0, Total=28730 [2018-02-04 15:11:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-04 15:11:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-02-04 15:11:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-04 15:11:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-02-04 15:11:34,031 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 422 [2018-02-04 15:11:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:34,031 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-02-04 15:11:34,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 15:11:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-02-04 15:11:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-02-04 15:11:34,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:34,033 INFO L351 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:34,033 INFO L371 AbstractCegarLoop]: === Iteration 89 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash 962490652, now seen corresponding path program 84 times [2018-02-04 15:11:34,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:34,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:36,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:36,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-02-04 15:11:36,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:36,047 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 15:11:36,047 INFO L182 omatonBuilderFactory]: Interpolants [49152#(<= main_~i~0 27), 49153#(<= main_~i~0 28), 49154#(<= main_~i~0 29), 49155#(<= main_~i~0 30), 49156#(<= main_~i~0 31), 49157#(<= main_~i~0 32), 49158#(<= main_~i~0 33), 49159#(<= main_~i~0 34), 49160#(<= main_~i~0 35), 49161#(<= main_~i~0 36), 49162#(<= main_~i~0 37), 49163#(<= main_~i~0 38), 49164#(<= main_~i~0 39), 49165#(<= main_~i~0 40), 49166#(<= main_~i~0 41), 49167#(<= main_~i~0 42), 49168#(<= main_~i~0 43), 49169#(<= main_~i~0 44), 49170#(<= main_~i~0 45), 49171#(<= main_~i~0 46), 49172#(<= main_~i~0 47), 49173#(<= main_~i~0 48), 49174#(<= main_~i~0 49), 49175#(<= main_~i~0 50), 49176#(<= main_~i~0 51), 49177#(<= main_~i~0 52), 49178#(<= main_~i~0 53), 49179#(<= main_~i~0 54), 49180#(<= main_~i~0 55), 49181#(<= main_~i~0 56), 49182#(<= main_~i~0 57), 49183#(<= main_~i~0 58), 49184#(<= main_~i~0 59), 49185#(<= main_~i~0 60), 49186#(<= main_~i~0 61), 49187#(<= main_~i~0 62), 49188#(<= main_~i~0 63), 49189#(<= main_~i~0 64), 49190#(<= main_~i~0 65), 49191#(<= main_~i~0 66), 49192#(<= main_~i~0 67), 49193#(<= main_~i~0 68), 49194#(<= main_~i~0 69), 49195#(<= main_~i~0 70), 49196#(<= main_~i~0 71), 49197#(<= main_~i~0 72), 49198#(<= main_~i~0 73), 49199#(<= main_~i~0 74), 49200#(<= main_~i~0 75), 49201#(<= main_~i~0 76), 49202#(<= main_~i~0 77), 49203#(<= main_~i~0 78), 49204#(<= main_~i~0 79), 49205#(<= main_~i~0 80), 49206#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 49207#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 49208#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 49209#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 49210#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 49123#true, 49124#false, 49125#(<= main_~i~0 0), 49126#(<= main_~i~0 1), 49127#(<= main_~i~0 2), 49128#(<= main_~i~0 3), 49129#(<= main_~i~0 4), 49130#(<= main_~i~0 5), 49131#(<= main_~i~0 6), 49132#(<= main_~i~0 7), 49133#(<= main_~i~0 8), 49134#(<= main_~i~0 9), 49135#(<= main_~i~0 10), 49136#(<= main_~i~0 11), 49137#(<= main_~i~0 12), 49138#(<= main_~i~0 13), 49139#(<= main_~i~0 14), 49140#(<= main_~i~0 15), 49141#(<= main_~i~0 16), 49142#(<= main_~i~0 17), 49143#(<= main_~i~0 18), 49144#(<= main_~i~0 19), 49145#(<= main_~i~0 20), 49146#(<= main_~i~0 21), 49147#(<= main_~i~0 22), 49148#(<= main_~i~0 23), 49149#(<= main_~i~0 24), 49150#(<= main_~i~0 25), 49151#(<= main_~i~0 26)] [2018-02-04 15:11:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:36,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-02-04 15:11:36,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-02-04 15:11:36,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3414, Invalid=4242, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 15:11:36,049 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 88 states. [2018-02-04 15:11:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:38,702 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-02-04 15:11:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 15:11:38,702 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 427 [2018-02-04 15:11:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:38,703 INFO L225 Difference]: With dead ends: 438 [2018-02-04 15:11:38,703 INFO L226 Difference]: Without dead ends: 438 [2018-02-04 15:11:38,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10467, Invalid=18945, Unknown=0, NotChecked=0, Total=29412 [2018-02-04 15:11:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-04 15:11:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-02-04 15:11:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 15:11:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-02-04 15:11:38,706 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 427 [2018-02-04 15:11:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:38,707 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-02-04 15:11:38,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-02-04 15:11:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-02-04 15:11:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-02-04 15:11:38,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:38,708 INFO L351 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:38,708 INFO L371 AbstractCegarLoop]: === Iteration 90 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash -144266281, now seen corresponding path program 85 times [2018-02-04 15:11:38,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:38,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:40,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:40,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-02-04 15:11:40,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:40,805 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 15:11:40,805 INFO L182 omatonBuilderFactory]: Interpolants [50304#(<= main_~i~0 47), 50305#(<= main_~i~0 48), 50306#(<= main_~i~0 49), 50307#(<= main_~i~0 50), 50308#(<= main_~i~0 51), 50309#(<= main_~i~0 52), 50310#(<= main_~i~0 53), 50311#(<= main_~i~0 54), 50312#(<= main_~i~0 55), 50313#(<= main_~i~0 56), 50314#(<= main_~i~0 57), 50315#(<= main_~i~0 58), 50316#(<= main_~i~0 59), 50317#(<= main_~i~0 60), 50318#(<= main_~i~0 61), 50319#(<= main_~i~0 62), 50320#(<= main_~i~0 63), 50321#(<= main_~i~0 64), 50322#(<= main_~i~0 65), 50323#(<= main_~i~0 66), 50324#(<= main_~i~0 67), 50325#(<= main_~i~0 68), 50326#(<= main_~i~0 69), 50327#(<= main_~i~0 70), 50328#(<= main_~i~0 71), 50329#(<= main_~i~0 72), 50330#(<= main_~i~0 73), 50331#(<= main_~i~0 74), 50332#(<= main_~i~0 75), 50333#(<= main_~i~0 76), 50334#(<= main_~i~0 77), 50335#(<= main_~i~0 78), 50336#(<= main_~i~0 79), 50337#(<= main_~i~0 80), 50338#(<= main_~i~0 81), 50339#(<= main_~i~0 82), 50340#(<= main_~i~0 83), 50341#(<= main_~i~0 84), 50342#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 50343#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 50255#true, 50256#false, 50257#(<= main_~i~0 0), 50258#(<= main_~i~0 1), 50259#(<= main_~i~0 2), 50260#(<= main_~i~0 3), 50261#(<= main_~i~0 4), 50262#(<= main_~i~0 5), 50263#(<= main_~i~0 6), 50264#(<= main_~i~0 7), 50265#(<= main_~i~0 8), 50266#(<= main_~i~0 9), 50267#(<= main_~i~0 10), 50268#(<= main_~i~0 11), 50269#(<= main_~i~0 12), 50270#(<= main_~i~0 13), 50271#(<= main_~i~0 14), 50272#(<= main_~i~0 15), 50273#(<= main_~i~0 16), 50274#(<= main_~i~0 17), 50275#(<= main_~i~0 18), 50276#(<= main_~i~0 19), 50277#(<= main_~i~0 20), 50278#(<= main_~i~0 21), 50279#(<= main_~i~0 22), 50280#(<= main_~i~0 23), 50281#(<= main_~i~0 24), 50282#(<= main_~i~0 25), 50283#(<= main_~i~0 26), 50284#(<= main_~i~0 27), 50285#(<= main_~i~0 28), 50286#(<= main_~i~0 29), 50287#(<= main_~i~0 30), 50288#(<= main_~i~0 31), 50289#(<= main_~i~0 32), 50290#(<= main_~i~0 33), 50291#(<= main_~i~0 34), 50292#(<= main_~i~0 35), 50293#(<= main_~i~0 36), 50294#(<= main_~i~0 37), 50295#(<= main_~i~0 38), 50296#(<= main_~i~0 39), 50297#(<= main_~i~0 40), 50298#(<= main_~i~0 41), 50299#(<= main_~i~0 42), 50300#(<= main_~i~0 43), 50301#(<= main_~i~0 44), 50302#(<= main_~i~0 45), 50303#(<= main_~i~0 46)] [2018-02-04 15:11:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:40,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-02-04 15:11:40,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-02-04 15:11:40,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 15:11:40,807 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 89 states. [2018-02-04 15:11:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:43,047 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-02-04 15:11:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-04 15:11:43,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-02-04 15:11:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:43,049 INFO L225 Difference]: With dead ends: 443 [2018-02-04 15:11:43,049 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 15:11:43,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11226, Invalid=18876, Unknown=0, NotChecked=0, Total=30102 [2018-02-04 15:11:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 15:11:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-02-04 15:11:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 15:11:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-02-04 15:11:43,052 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 432 [2018-02-04 15:11:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:43,053 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-02-04 15:11:43,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-02-04 15:11:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-02-04 15:11:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-02-04 15:11:43,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:43,054 INFO L351 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:43,054 INFO L371 AbstractCegarLoop]: === Iteration 91 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash -158536196, now seen corresponding path program 86 times [2018-02-04 15:11:43,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:43,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:45,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:45,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-02-04 15:11:45,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:45,151 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 15:11:45,151 INFO L182 omatonBuilderFactory]: Interpolants [51456#(<= main_~i~0 54), 51457#(<= main_~i~0 55), 51458#(<= main_~i~0 56), 51459#(<= main_~i~0 57), 51460#(<= main_~i~0 58), 51461#(<= main_~i~0 59), 51462#(<= main_~i~0 60), 51463#(<= main_~i~0 61), 51464#(<= main_~i~0 62), 51465#(<= main_~i~0 63), 51466#(<= main_~i~0 64), 51467#(<= main_~i~0 65), 51468#(<= main_~i~0 66), 51469#(<= main_~i~0 67), 51470#(<= main_~i~0 68), 51471#(<= main_~i~0 69), 51472#(<= main_~i~0 70), 51473#(<= main_~i~0 71), 51474#(<= main_~i~0 72), 51475#(<= main_~i~0 73), 51476#(<= main_~i~0 74), 51477#(<= main_~i~0 75), 51478#(<= main_~i~0 76), 51479#(<= main_~i~0 77), 51480#(<= main_~i~0 78), 51481#(<= main_~i~0 79), 51482#(<= main_~i~0 80), 51483#(<= main_~i~0 81), 51484#(<= main_~i~0 82), 51485#(<= main_~i~0 83), 51486#(<= main_~i~0 84), 51487#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 51488#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 51489#(and (<= main_~i~0 86) (<= 2 main_~i~0)), 51400#true, 51401#false, 51402#(<= main_~i~0 0), 51403#(<= main_~i~0 1), 51404#(<= main_~i~0 2), 51405#(<= main_~i~0 3), 51406#(<= main_~i~0 4), 51407#(<= main_~i~0 5), 51408#(<= main_~i~0 6), 51409#(<= main_~i~0 7), 51410#(<= main_~i~0 8), 51411#(<= main_~i~0 9), 51412#(<= main_~i~0 10), 51413#(<= main_~i~0 11), 51414#(<= main_~i~0 12), 51415#(<= main_~i~0 13), 51416#(<= main_~i~0 14), 51417#(<= main_~i~0 15), 51418#(<= main_~i~0 16), 51419#(<= main_~i~0 17), 51420#(<= main_~i~0 18), 51421#(<= main_~i~0 19), 51422#(<= main_~i~0 20), 51423#(<= main_~i~0 21), 51424#(<= main_~i~0 22), 51425#(<= main_~i~0 23), 51426#(<= main_~i~0 24), 51427#(<= main_~i~0 25), 51428#(<= main_~i~0 26), 51429#(<= main_~i~0 27), 51430#(<= main_~i~0 28), 51431#(<= main_~i~0 29), 51432#(<= main_~i~0 30), 51433#(<= main_~i~0 31), 51434#(<= main_~i~0 32), 51435#(<= main_~i~0 33), 51436#(<= main_~i~0 34), 51437#(<= main_~i~0 35), 51438#(<= main_~i~0 36), 51439#(<= main_~i~0 37), 51440#(<= main_~i~0 38), 51441#(<= main_~i~0 39), 51442#(<= main_~i~0 40), 51443#(<= main_~i~0 41), 51444#(<= main_~i~0 42), 51445#(<= main_~i~0 43), 51446#(<= main_~i~0 44), 51447#(<= main_~i~0 45), 51448#(<= main_~i~0 46), 51449#(<= main_~i~0 47), 51450#(<= main_~i~0 48), 51451#(<= main_~i~0 49), 51452#(<= main_~i~0 50), 51453#(<= main_~i~0 51), 51454#(<= main_~i~0 52), 51455#(<= main_~i~0 53)] [2018-02-04 15:11:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:45,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-02-04 15:11:45,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-02-04 15:11:45,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 15:11:45,152 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 90 states. [2018-02-04 15:11:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:47,597 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-02-04 15:11:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 15:11:47,597 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 437 [2018-02-04 15:11:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:47,598 INFO L225 Difference]: With dead ends: 448 [2018-02-04 15:11:47,598 INFO L226 Difference]: Without dead ends: 448 [2018-02-04 15:11:47,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11315, Invalid=19485, Unknown=0, NotChecked=0, Total=30800 [2018-02-04 15:11:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-02-04 15:11:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2018-02-04 15:11:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 15:11:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 448 transitions. [2018-02-04 15:11:47,601 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 448 transitions. Word has length 437 [2018-02-04 15:11:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:47,601 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 448 transitions. [2018-02-04 15:11:47,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-02-04 15:11:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 448 transitions. [2018-02-04 15:11:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-02-04 15:11:47,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:47,603 INFO L351 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:47,603 INFO L371 AbstractCegarLoop]: === Iteration 92 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1579367159, now seen corresponding path program 87 times [2018-02-04 15:11:47,603 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:47,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:49,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:49,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-02-04 15:11:49,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:49,794 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 15:11:49,794 INFO L182 omatonBuilderFactory]: Interpolants [52608#(<= main_~i~0 48), 52609#(<= main_~i~0 49), 52610#(<= main_~i~0 50), 52611#(<= main_~i~0 51), 52612#(<= main_~i~0 52), 52613#(<= main_~i~0 53), 52614#(<= main_~i~0 54), 52615#(<= main_~i~0 55), 52616#(<= main_~i~0 56), 52617#(<= main_~i~0 57), 52618#(<= main_~i~0 58), 52619#(<= main_~i~0 59), 52620#(<= main_~i~0 60), 52621#(<= main_~i~0 61), 52622#(<= main_~i~0 62), 52623#(<= main_~i~0 63), 52624#(<= main_~i~0 64), 52625#(<= main_~i~0 65), 52626#(<= main_~i~0 66), 52627#(<= main_~i~0 67), 52628#(<= main_~i~0 68), 52629#(<= main_~i~0 69), 52630#(<= main_~i~0 70), 52631#(<= main_~i~0 71), 52632#(<= main_~i~0 72), 52633#(<= main_~i~0 73), 52634#(<= main_~i~0 74), 52635#(<= main_~i~0 75), 52636#(<= main_~i~0 76), 52637#(<= main_~i~0 77), 52638#(<= main_~i~0 78), 52639#(<= main_~i~0 79), 52640#(<= main_~i~0 80), 52641#(<= main_~i~0 81), 52642#(<= main_~i~0 82), 52643#(<= main_~i~0 83), 52644#(<= main_~i~0 84), 52645#(<= main_~i~0 85), 52646#(<= main_~i~0 86), 52647#(and (<= main_~i~0 86) (<= 0 main_~i~0)), 52648#(and (<= 1 main_~i~0) (<= main_~i~0 87)), 52558#true, 52559#false, 52560#(<= main_~i~0 0), 52561#(<= main_~i~0 1), 52562#(<= main_~i~0 2), 52563#(<= main_~i~0 3), 52564#(<= main_~i~0 4), 52565#(<= main_~i~0 5), 52566#(<= main_~i~0 6), 52567#(<= main_~i~0 7), 52568#(<= main_~i~0 8), 52569#(<= main_~i~0 9), 52570#(<= main_~i~0 10), 52571#(<= main_~i~0 11), 52572#(<= main_~i~0 12), 52573#(<= main_~i~0 13), 52574#(<= main_~i~0 14), 52575#(<= main_~i~0 15), 52576#(<= main_~i~0 16), 52577#(<= main_~i~0 17), 52578#(<= main_~i~0 18), 52579#(<= main_~i~0 19), 52580#(<= main_~i~0 20), 52581#(<= main_~i~0 21), 52582#(<= main_~i~0 22), 52583#(<= main_~i~0 23), 52584#(<= main_~i~0 24), 52585#(<= main_~i~0 25), 52586#(<= main_~i~0 26), 52587#(<= main_~i~0 27), 52588#(<= main_~i~0 28), 52589#(<= main_~i~0 29), 52590#(<= main_~i~0 30), 52591#(<= main_~i~0 31), 52592#(<= main_~i~0 32), 52593#(<= main_~i~0 33), 52594#(<= main_~i~0 34), 52595#(<= main_~i~0 35), 52596#(<= main_~i~0 36), 52597#(<= main_~i~0 37), 52598#(<= main_~i~0 38), 52599#(<= main_~i~0 39), 52600#(<= main_~i~0 40), 52601#(<= main_~i~0 41), 52602#(<= main_~i~0 42), 52603#(<= main_~i~0 43), 52604#(<= main_~i~0 44), 52605#(<= main_~i~0 45), 52606#(<= main_~i~0 46), 52607#(<= main_~i~0 47)] [2018-02-04 15:11:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:49,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-02-04 15:11:49,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-02-04 15:11:49,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 15:11:49,796 INFO L87 Difference]: Start difference. First operand 448 states and 448 transitions. Second operand 91 states. [2018-02-04 15:11:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:52,108 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-02-04 15:11:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-02-04 15:11:52,108 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-02-04 15:11:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:52,109 INFO L225 Difference]: With dead ends: 453 [2018-02-04 15:11:52,109 INFO L226 Difference]: Without dead ends: 453 [2018-02-04 15:11:52,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=11751, Invalid=19755, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 15:11:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-04 15:11:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-02-04 15:11:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-02-04 15:11:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2018-02-04 15:11:52,113 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 442 [2018-02-04 15:11:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:52,113 INFO L432 AbstractCegarLoop]: Abstraction has 453 states and 453 transitions. [2018-02-04 15:11:52,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-02-04 15:11:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 453 transitions. [2018-02-04 15:11:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-02-04 15:11:52,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:52,114 INFO L351 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:52,114 INFO L371 AbstractCegarLoop]: === Iteration 93 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1595092260, now seen corresponding path program 88 times [2018-02-04 15:11:52,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:52,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:11:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:54,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:11:54,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-02-04 15:11:54,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:11:54,276 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 15:11:54,276 INFO L182 omatonBuilderFactory]: Interpolants [53760#(<= main_~i~0 29), 53761#(<= main_~i~0 30), 53762#(<= main_~i~0 31), 53763#(<= main_~i~0 32), 53764#(<= main_~i~0 33), 53765#(<= main_~i~0 34), 53766#(<= main_~i~0 35), 53767#(<= main_~i~0 36), 53768#(<= main_~i~0 37), 53769#(<= main_~i~0 38), 53770#(<= main_~i~0 39), 53771#(<= main_~i~0 40), 53772#(<= main_~i~0 41), 53773#(<= main_~i~0 42), 53774#(<= main_~i~0 43), 53775#(<= main_~i~0 44), 53776#(<= main_~i~0 45), 53777#(<= main_~i~0 46), 53778#(<= main_~i~0 47), 53779#(<= main_~i~0 48), 53780#(<= main_~i~0 49), 53781#(<= main_~i~0 50), 53782#(<= main_~i~0 51), 53783#(<= main_~i~0 52), 53784#(<= main_~i~0 53), 53785#(<= main_~i~0 54), 53786#(<= main_~i~0 55), 53787#(<= main_~i~0 56), 53788#(<= main_~i~0 57), 53789#(<= main_~i~0 58), 53790#(<= main_~i~0 59), 53791#(<= main_~i~0 60), 53792#(<= main_~i~0 61), 53793#(<= main_~i~0 62), 53794#(<= main_~i~0 63), 53795#(<= main_~i~0 64), 53796#(<= main_~i~0 65), 53797#(<= main_~i~0 66), 53798#(<= main_~i~0 67), 53799#(<= main_~i~0 68), 53800#(<= main_~i~0 69), 53801#(<= main_~i~0 70), 53802#(<= main_~i~0 71), 53803#(<= main_~i~0 72), 53804#(<= main_~i~0 73), 53805#(<= main_~i~0 74), 53806#(<= main_~i~0 75), 53807#(<= main_~i~0 76), 53808#(<= main_~i~0 77), 53809#(<= main_~i~0 78), 53810#(<= main_~i~0 79), 53811#(<= main_~i~0 80), 53812#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 53813#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 53814#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 53815#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 53816#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 53817#(and (<= 5 main_~i~0) (<= main_~i~0 85)), 53818#(and (<= main_~i~0 86) (<= 6 main_~i~0)), 53819#(and (<= 7 main_~i~0) (<= main_~i~0 87)), 53820#(and (<= 8 main_~i~0) (<= main_~i~0 88)), 53729#true, 53730#false, 53731#(<= main_~i~0 0), 53732#(<= main_~i~0 1), 53733#(<= main_~i~0 2), 53734#(<= main_~i~0 3), 53735#(<= main_~i~0 4), 53736#(<= main_~i~0 5), 53737#(<= main_~i~0 6), 53738#(<= main_~i~0 7), 53739#(<= main_~i~0 8), 53740#(<= main_~i~0 9), 53741#(<= main_~i~0 10), 53742#(<= main_~i~0 11), 53743#(<= main_~i~0 12), 53744#(<= main_~i~0 13), 53745#(<= main_~i~0 14), 53746#(<= main_~i~0 15), 53747#(<= main_~i~0 16), 53748#(<= main_~i~0 17), 53749#(<= main_~i~0 18), 53750#(<= main_~i~0 19), 53751#(<= main_~i~0 20), 53752#(<= main_~i~0 21), 53753#(<= main_~i~0 22), 53754#(<= main_~i~0 23), 53755#(<= main_~i~0 24), 53756#(<= main_~i~0 25), 53757#(<= main_~i~0 26), 53758#(<= main_~i~0 27), 53759#(<= main_~i~0 28)] [2018-02-04 15:11:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:11:54,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-02-04 15:11:54,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-02-04 15:11:54,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 15:11:54,278 INFO L87 Difference]: Start difference. First operand 453 states and 453 transitions. Second operand 92 states. [2018-02-04 15:11:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:11:57,881 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-02-04 15:11:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 15:11:57,881 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 447 [2018-02-04 15:11:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:11:57,882 INFO L225 Difference]: With dead ends: 458 [2018-02-04 15:11:57,882 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 15:11:57,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-02-04 15:11:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 15:11:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2018-02-04 15:11:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 15:11:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-02-04 15:11:57,885 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 447 [2018-02-04 15:11:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:11:57,885 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-02-04 15:11:57,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-02-04 15:11:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-02-04 15:11:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-02-04 15:11:57,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:11:57,886 INFO L351 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-02-04 15:11:57,886 INFO L371 AbstractCegarLoop]: === Iteration 94 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:11:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash -431005161, now seen corresponding path program 89 times [2018-02-04 15:11:57,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:11:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:11:57,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:00,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:00,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-02-04 15:12:00,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:00,171 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 15:12:00,171 INFO L182 omatonBuilderFactory]: Interpolants [54913#true, 54914#false, 54915#(<= main_~i~0 0), 54916#(<= main_~i~0 1), 54917#(<= main_~i~0 2), 54918#(<= main_~i~0 3), 54919#(<= main_~i~0 4), 54920#(<= main_~i~0 5), 54921#(<= main_~i~0 6), 54922#(<= main_~i~0 7), 54923#(<= main_~i~0 8), 54924#(<= main_~i~0 9), 54925#(<= main_~i~0 10), 54926#(<= main_~i~0 11), 54927#(<= main_~i~0 12), 54928#(<= main_~i~0 13), 54929#(<= main_~i~0 14), 54930#(<= main_~i~0 15), 54931#(<= main_~i~0 16), 54932#(<= main_~i~0 17), 54933#(<= main_~i~0 18), 54934#(<= main_~i~0 19), 54935#(<= main_~i~0 20), 54936#(<= main_~i~0 21), 54937#(<= main_~i~0 22), 54938#(<= main_~i~0 23), 54939#(<= main_~i~0 24), 54940#(<= main_~i~0 25), 54941#(<= main_~i~0 26), 54942#(<= main_~i~0 27), 54943#(<= main_~i~0 28), 54944#(<= main_~i~0 29), 54945#(<= main_~i~0 30), 54946#(<= main_~i~0 31), 54947#(<= main_~i~0 32), 54948#(<= main_~i~0 33), 54949#(<= main_~i~0 34), 54950#(<= main_~i~0 35), 54951#(<= main_~i~0 36), 54952#(<= main_~i~0 37), 54953#(<= main_~i~0 38), 54954#(<= main_~i~0 39), 54955#(<= main_~i~0 40), 54956#(<= main_~i~0 41), 54957#(<= main_~i~0 42), 54958#(<= main_~i~0 43), 54959#(<= main_~i~0 44), 54960#(<= main_~i~0 45), 54961#(<= main_~i~0 46), 54962#(<= main_~i~0 47), 54963#(<= main_~i~0 48), 54964#(<= main_~i~0 49), 54965#(<= main_~i~0 50), 54966#(<= main_~i~0 51), 54967#(<= main_~i~0 52), 54968#(<= main_~i~0 53), 54969#(<= main_~i~0 54), 54970#(<= main_~i~0 55), 54971#(<= main_~i~0 56), 54972#(<= main_~i~0 57), 54973#(<= main_~i~0 58), 54974#(<= main_~i~0 59), 54975#(<= main_~i~0 60), 54976#(<= main_~i~0 61), 54977#(<= main_~i~0 62), 54978#(<= main_~i~0 63), 54979#(<= main_~i~0 64), 54980#(<= main_~i~0 65), 54981#(<= main_~i~0 66), 54982#(<= main_~i~0 67), 54983#(<= main_~i~0 68), 54984#(<= main_~i~0 69), 54985#(<= main_~i~0 70), 54986#(<= main_~i~0 71), 54987#(<= main_~i~0 72), 54988#(<= main_~i~0 73), 54989#(<= main_~i~0 74), 54990#(<= main_~i~0 75), 54991#(<= main_~i~0 76), 54992#(<= main_~i~0 77), 54993#(<= main_~i~0 78), 54994#(<= main_~i~0 79), 54995#(<= main_~i~0 80), 54996#(<= main_~i~0 81), 54997#(<= main_~i~0 82), 54998#(<= main_~i~0 83), 54999#(<= main_~i~0 84), 55000#(<= main_~i~0 85), 55001#(<= main_~i~0 86), 55002#(<= main_~i~0 87), 55003#(<= main_~i~0 88), 55004#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 55005#(and (<= 1 main_~i~0) (<= main_~i~0 89))] [2018-02-04 15:12:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:00,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-04 15:12:00,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-04 15:12:00,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4100, Invalid=4456, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 15:12:00,173 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 93 states. [2018-02-04 15:12:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:02,957 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-02-04 15:12:02,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-02-04 15:12:02,957 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-02-04 15:12:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:02,958 INFO L225 Difference]: With dead ends: 463 [2018-02-04 15:12:02,958 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 15:12:02,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=12288, Invalid=20654, Unknown=0, NotChecked=0, Total=32942 [2018-02-04 15:12:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 15:12:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-02-04 15:12:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-04 15:12:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-02-04 15:12:02,962 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 452 [2018-02-04 15:12:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:02,962 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-02-04 15:12:02,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-04 15:12:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-02-04 15:12:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-02-04 15:12:02,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:02,964 INFO L351 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:02,964 INFO L371 AbstractCegarLoop]: === Iteration 95 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:12:02,964 INFO L82 PathProgramCache]: Analyzing trace with hash 400302012, now seen corresponding path program 90 times [2018-02-04 15:12:02,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:02,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:05,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:05,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-02-04 15:12:05,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:05,286 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 15:12:05,286 INFO L182 omatonBuilderFactory]: Interpolants [56192#(<= main_~i~0 80), 56193#(<= main_~i~0 81), 56194#(<= main_~i~0 82), 56195#(<= main_~i~0 83), 56196#(<= main_~i~0 84), 56197#(<= main_~i~0 85), 56198#(<= main_~i~0 86), 56199#(<= main_~i~0 87), 56200#(<= main_~i~0 88), 56201#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 56202#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 56203#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 56110#true, 56111#false, 56112#(<= main_~i~0 0), 56113#(<= main_~i~0 1), 56114#(<= main_~i~0 2), 56115#(<= main_~i~0 3), 56116#(<= main_~i~0 4), 56117#(<= main_~i~0 5), 56118#(<= main_~i~0 6), 56119#(<= main_~i~0 7), 56120#(<= main_~i~0 8), 56121#(<= main_~i~0 9), 56122#(<= main_~i~0 10), 56123#(<= main_~i~0 11), 56124#(<= main_~i~0 12), 56125#(<= main_~i~0 13), 56126#(<= main_~i~0 14), 56127#(<= main_~i~0 15), 56128#(<= main_~i~0 16), 56129#(<= main_~i~0 17), 56130#(<= main_~i~0 18), 56131#(<= main_~i~0 19), 56132#(<= main_~i~0 20), 56133#(<= main_~i~0 21), 56134#(<= main_~i~0 22), 56135#(<= main_~i~0 23), 56136#(<= main_~i~0 24), 56137#(<= main_~i~0 25), 56138#(<= main_~i~0 26), 56139#(<= main_~i~0 27), 56140#(<= main_~i~0 28), 56141#(<= main_~i~0 29), 56142#(<= main_~i~0 30), 56143#(<= main_~i~0 31), 56144#(<= main_~i~0 32), 56145#(<= main_~i~0 33), 56146#(<= main_~i~0 34), 56147#(<= main_~i~0 35), 56148#(<= main_~i~0 36), 56149#(<= main_~i~0 37), 56150#(<= main_~i~0 38), 56151#(<= main_~i~0 39), 56152#(<= main_~i~0 40), 56153#(<= main_~i~0 41), 56154#(<= main_~i~0 42), 56155#(<= main_~i~0 43), 56156#(<= main_~i~0 44), 56157#(<= main_~i~0 45), 56158#(<= main_~i~0 46), 56159#(<= main_~i~0 47), 56160#(<= main_~i~0 48), 56161#(<= main_~i~0 49), 56162#(<= main_~i~0 50), 56163#(<= main_~i~0 51), 56164#(<= main_~i~0 52), 56165#(<= main_~i~0 53), 56166#(<= main_~i~0 54), 56167#(<= main_~i~0 55), 56168#(<= main_~i~0 56), 56169#(<= main_~i~0 57), 56170#(<= main_~i~0 58), 56171#(<= main_~i~0 59), 56172#(<= main_~i~0 60), 56173#(<= main_~i~0 61), 56174#(<= main_~i~0 62), 56175#(<= main_~i~0 63), 56176#(<= main_~i~0 64), 56177#(<= main_~i~0 65), 56178#(<= main_~i~0 66), 56179#(<= main_~i~0 67), 56180#(<= main_~i~0 68), 56181#(<= main_~i~0 69), 56182#(<= main_~i~0 70), 56183#(<= main_~i~0 71), 56184#(<= main_~i~0 72), 56185#(<= main_~i~0 73), 56186#(<= main_~i~0 74), 56187#(<= main_~i~0 75), 56188#(<= main_~i~0 76), 56189#(<= main_~i~0 77), 56190#(<= main_~i~0 78), 56191#(<= main_~i~0 79)] [2018-02-04 15:12:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:05,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-02-04 15:12:05,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-02-04 15:12:05,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4102, Invalid=4640, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 15:12:05,287 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 94 states. [2018-02-04 15:12:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:07,900 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-02-04 15:12:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-02-04 15:12:07,900 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 457 [2018-02-04 15:12:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:07,901 INFO L225 Difference]: With dead ends: 468 [2018-02-04 15:12:07,901 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 15:12:07,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=12381, Invalid=21291, Unknown=0, NotChecked=0, Total=33672 [2018-02-04 15:12:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 15:12:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-02-04 15:12:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-02-04 15:12:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 468 transitions. [2018-02-04 15:12:07,905 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 468 transitions. Word has length 457 [2018-02-04 15:12:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:07,906 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 468 transitions. [2018-02-04 15:12:07,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-02-04 15:12:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 468 transitions. [2018-02-04 15:12:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-02-04 15:12:07,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:07,907 INFO L351 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:07,907 INFO L371 AbstractCegarLoop]: === Iteration 96 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:12:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1689444041, now seen corresponding path program 91 times [2018-02-04 15:12:07,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:07,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:10,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:10,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-02-04 15:12:10,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:10,294 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 15:12:10,294 INFO L182 omatonBuilderFactory]: Interpolants [57344#(<= main_~i~0 22), 57345#(<= main_~i~0 23), 57346#(<= main_~i~0 24), 57347#(<= main_~i~0 25), 57348#(<= main_~i~0 26), 57349#(<= main_~i~0 27), 57350#(<= main_~i~0 28), 57351#(<= main_~i~0 29), 57352#(<= main_~i~0 30), 57353#(<= main_~i~0 31), 57354#(<= main_~i~0 32), 57355#(<= main_~i~0 33), 57356#(<= main_~i~0 34), 57357#(<= main_~i~0 35), 57358#(<= main_~i~0 36), 57359#(<= main_~i~0 37), 57360#(<= main_~i~0 38), 57361#(<= main_~i~0 39), 57362#(<= main_~i~0 40), 57363#(<= main_~i~0 41), 57364#(<= main_~i~0 42), 57365#(<= main_~i~0 43), 57366#(<= main_~i~0 44), 57367#(<= main_~i~0 45), 57368#(<= main_~i~0 46), 57369#(<= main_~i~0 47), 57370#(<= main_~i~0 48), 57371#(<= main_~i~0 49), 57372#(<= main_~i~0 50), 57373#(<= main_~i~0 51), 57374#(<= main_~i~0 52), 57375#(<= main_~i~0 53), 57376#(<= main_~i~0 54), 57377#(<= main_~i~0 55), 57378#(<= main_~i~0 56), 57379#(<= main_~i~0 57), 57380#(<= main_~i~0 58), 57381#(<= main_~i~0 59), 57382#(<= main_~i~0 60), 57383#(<= main_~i~0 61), 57384#(<= main_~i~0 62), 57385#(<= main_~i~0 63), 57386#(<= main_~i~0 64), 57387#(<= main_~i~0 65), 57388#(<= main_~i~0 66), 57389#(<= main_~i~0 67), 57390#(<= main_~i~0 68), 57391#(<= main_~i~0 69), 57392#(<= main_~i~0 70), 57393#(<= main_~i~0 71), 57394#(<= main_~i~0 72), 57395#(<= main_~i~0 73), 57396#(<= main_~i~0 74), 57397#(<= main_~i~0 75), 57398#(<= main_~i~0 76), 57399#(<= main_~i~0 77), 57400#(<= main_~i~0 78), 57401#(<= main_~i~0 79), 57402#(<= main_~i~0 80), 57403#(<= main_~i~0 81), 57404#(<= main_~i~0 82), 57405#(<= main_~i~0 83), 57406#(<= main_~i~0 84), 57407#(<= main_~i~0 85), 57408#(<= main_~i~0 86), 57409#(<= main_~i~0 87), 57410#(<= main_~i~0 88), 57411#(<= main_~i~0 89), 57412#(<= main_~i~0 90), 57413#(and (<= 0 main_~i~0) (<= main_~i~0 90)), 57414#(and (<= main_~i~0 91) (<= 1 main_~i~0)), 57320#true, 57321#false, 57322#(<= main_~i~0 0), 57323#(<= main_~i~0 1), 57324#(<= main_~i~0 2), 57325#(<= main_~i~0 3), 57326#(<= main_~i~0 4), 57327#(<= main_~i~0 5), 57328#(<= main_~i~0 6), 57329#(<= main_~i~0 7), 57330#(<= main_~i~0 8), 57331#(<= main_~i~0 9), 57332#(<= main_~i~0 10), 57333#(<= main_~i~0 11), 57334#(<= main_~i~0 12), 57335#(<= main_~i~0 13), 57336#(<= main_~i~0 14), 57337#(<= main_~i~0 15), 57338#(<= main_~i~0 16), 57339#(<= main_~i~0 17), 57340#(<= main_~i~0 18), 57341#(<= main_~i~0 19), 57342#(<= main_~i~0 20), 57343#(<= main_~i~0 21)] [2018-02-04 15:12:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:10,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-02-04 15:12:10,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-02-04 15:12:10,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 15:12:10,296 INFO L87 Difference]: Start difference. First operand 468 states and 468 transitions. Second operand 95 states. [2018-02-04 15:12:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:12,814 INFO L93 Difference]: Finished difference Result 473 states and 473 transitions. [2018-02-04 15:12:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 15:12:12,814 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-02-04 15:12:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:12,815 INFO L225 Difference]: With dead ends: 473 [2018-02-04 15:12:12,815 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 15:12:12,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12837, Invalid=21573, Unknown=0, NotChecked=0, Total=34410 [2018-02-04 15:12:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 15:12:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2018-02-04 15:12:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-02-04 15:12:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-02-04 15:12:12,818 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 462 [2018-02-04 15:12:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:12,819 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-02-04 15:12:12,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-02-04 15:12:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-02-04 15:12:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-02-04 15:12:12,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:12,820 INFO L351 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:12,820 INFO L371 AbstractCegarLoop]: === Iteration 97 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 15:12:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash 490263708, now seen corresponding path program 92 times [2018-02-04 15:12:12,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:12,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:15,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:15,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-02-04 15:12:15,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:15,245 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 15:12:15,245 INFO L182 omatonBuilderFactory]: Interpolants [58624#(<= main_~i~0 79), 58625#(<= main_~i~0 80), 58626#(<= main_~i~0 81), 58627#(<= main_~i~0 82), 58628#(<= main_~i~0 83), 58629#(<= main_~i~0 84), 58630#(<= main_~i~0 85), 58631#(<= main_~i~0 86), 58632#(<= main_~i~0 87), 58633#(<= main_~i~0 88), 58634#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 58635#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 58636#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 58637#(and (<= main_~i~0 91) (<= 3 main_~i~0)), 58638#(and (<= 4 main_~i~0) (<= main_~i~0 92)), 58543#true, 58544#false, 58545#(<= main_~i~0 0), 58546#(<= main_~i~0 1), 58547#(<= main_~i~0 2), 58548#(<= main_~i~0 3), 58549#(<= main_~i~0 4), 58550#(<= main_~i~0 5), 58551#(<= main_~i~0 6), 58552#(<= main_~i~0 7), 58553#(<= main_~i~0 8), 58554#(<= main_~i~0 9), 58555#(<= main_~i~0 10), 58556#(<= main_~i~0 11), 58557#(<= main_~i~0 12), 58558#(<= main_~i~0 13), 58559#(<= main_~i~0 14), 58560#(<= main_~i~0 15), 58561#(<= main_~i~0 16), 58562#(<= main_~i~0 17), 58563#(<= main_~i~0 18), 58564#(<= main_~i~0 19), 58565#(<= main_~i~0 20), 58566#(<= main_~i~0 21), 58567#(<= main_~i~0 22), 58568#(<= main_~i~0 23), 58569#(<= main_~i~0 24), 58570#(<= main_~i~0 25), 58571#(<= main_~i~0 26), 58572#(<= main_~i~0 27), 58573#(<= main_~i~0 28), 58574#(<= main_~i~0 29), 58575#(<= main_~i~0 30), 58576#(<= main_~i~0 31), 58577#(<= main_~i~0 32), 58578#(<= main_~i~0 33), 58579#(<= main_~i~0 34), 58580#(<= main_~i~0 35), 58581#(<= main_~i~0 36), 58582#(<= main_~i~0 37), 58583#(<= main_~i~0 38), 58584#(<= main_~i~0 39), 58585#(<= main_~i~0 40), 58586#(<= main_~i~0 41), 58587#(<= main_~i~0 42), 58588#(<= main_~i~0 43), 58589#(<= main_~i~0 44), 58590#(<= main_~i~0 45), 58591#(<= main_~i~0 46), 58592#(<= main_~i~0 47), 58593#(<= main_~i~0 48), 58594#(<= main_~i~0 49), 58595#(<= main_~i~0 50), 58596#(<= main_~i~0 51), 58597#(<= main_~i~0 52), 58598#(<= main_~i~0 53), 58599#(<= main_~i~0 54), 58600#(<= main_~i~0 55), 58601#(<= main_~i~0 56), 58602#(<= main_~i~0 57), 58603#(<= main_~i~0 58), 58604#(<= main_~i~0 59), 58605#(<= main_~i~0 60), 58606#(<= main_~i~0 61), 58607#(<= main_~i~0 62), 58608#(<= main_~i~0 63), 58609#(<= main_~i~0 64), 58610#(<= main_~i~0 65), 58611#(<= main_~i~0 66), 58612#(<= main_~i~0 67), 58613#(<= main_~i~0 68), 58614#(<= main_~i~0 69), 58615#(<= main_~i~0 70), 58616#(<= main_~i~0 71), 58617#(<= main_~i~0 72), 58618#(<= main_~i~0 73), 58619#(<= main_~i~0 74), 58620#(<= main_~i~0 75), 58621#(<= main_~i~0 76), 58622#(<= main_~i~0 77), 58623#(<= main_~i~0 78)] [2018-02-04 15:12:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:15,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-02-04 15:12:15,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-02-04 15:12:15,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4106, Invalid=5014, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 15:12:15,247 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 96 states. Received shutdown request... [2018-02-04 15:12:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 15:12:17,631 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 15:12:17,635 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 15:12:17,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:12:17 BoogieIcfgContainer [2018-02-04 15:12:17,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:12:17,636 INFO L168 Benchmark]: Toolchain (without parser) took 186822.98 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 354.4 MB in the beginning and 959.7 MB in the end (delta: -605.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 15:12:17,637 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:12:17,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.00 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 346.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:12:17,637 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 ms. Allocated memory is still 397.9 MB. Free memory is still 346.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:12:17,637 INFO L168 Benchmark]: RCFGBuilder took 156.93 ms. Allocated memory is still 397.9 MB. Free memory was 346.5 MB in the beginning and 331.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 15:12:17,638 INFO L168 Benchmark]: TraceAbstraction took 186518.49 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.9 MB in the beginning and 959.7 MB in the end (delta: -627.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 15:12:17,639 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.20 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 128.00 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 346.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 16.76 ms. Allocated memory is still 397.9 MB. Free memory is still 346.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 156.93 ms. Allocated memory is still 397.9 MB. Free memory was 346.5 MB in the beginning and 331.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 186518.49 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 331.9 MB in the beginning and 959.7 MB in the end (delta: -627.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and interpolant automaton (currently 80 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 174 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and interpolant automaton (currently 80 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 174 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and interpolant automaton (currently 80 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 174 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and interpolant automaton (currently 80 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 174 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and interpolant automaton (currently 80 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 174 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 186.4s OverallTime, 97 OverallIterations, 93 TraceHistogramMax, 106.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1357 SDtfs, 28309 SDslu, 24423 SDs, 0 SdLazy, 55643 SolverSat, 4352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8707 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139928 ImplicationChecksByTransitivity, 139.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/657409 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 96 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 75.8s InterpolantComputationTime, 22129 NumberOfCodeBlocks, 22129 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 22032 ConstructedInterpolants, 0 QuantifiedInterpolants, 22066750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 3 PerfectInterpolantSequences, 17/657409 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/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-12-17-644.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-12-17-644.csv Completed graceful shutdown