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_z3.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:24:17,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:24:17,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:24:17,286 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:24:17,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:24:17,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:24:17,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:24:17,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:24:17,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:24:17,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:24:17,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:24:17,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:24:17,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:24:17,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:24:17,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:24:17,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:24:17,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:24:17,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:24:17,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:24:17,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:24:17,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:24:17,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:24:17,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:24:17,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:24:17,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:24:17,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:24:17,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:24:17,306 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:24:17,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:24:17,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:24:17,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:24:17,307 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 04:24:17,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:24:17,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:24:17,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:24:17,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:24:17,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:24:17,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:24:17,319 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:24:17,319 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:24:17,319 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:24:17,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:24:17,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:24:17,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:24:17,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 04:24:17,320 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 04:24:17,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:17,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:24:17,358 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:24:17,361 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:24:17,362 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:24:17,362 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:24:17,363 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 04:24:17,462 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:24:17,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:24:17,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:24:17,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:24:17,470 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:24:17,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4612f1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17, skipping insertion in model container [2018-02-04 04:24:17,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,489 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:24:17,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:24:17,610 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:24:17,619 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:24:17,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17 WrapperNode [2018-02-04 04:24:17,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:24:17,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:24:17,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:24:17,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:24:17,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (1/1) ... [2018-02-04 04:24:17,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:24:17,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:24:17,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:24:17,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:24:17,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (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 04:24:17,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:24:17,678 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:24:17,678 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:24:17,678 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:24:17,678 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:24:17,678 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:24:17,678 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:24:17,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:24:17,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:24:17,775 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:24:17,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:24:17 BoogieIcfgContainer [2018-02-04 04:24:17,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:24:17,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:24:17,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:24:17,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:24:17,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:24:17" (1/3) ... [2018-02-04 04:24:17,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11771c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:24:17, skipping insertion in model container [2018-02-04 04:24:17,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:24:17" (2/3) ... [2018-02-04 04:24:17,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11771c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:24:17, skipping insertion in model container [2018-02-04 04:24:17,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:24:17" (3/3) ... [2018-02-04 04:24:17,781 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-04 04:24:17,788 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:24:17,793 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 04:24:17,821 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:24:17,821 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:24:17,822 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 04:24:17,822 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 04:24:17,822 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:24:17,822 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:24:17,822 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:24:17,822 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:24:17,823 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:24:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-04 04:24:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 04:24:17,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:17,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:17,844 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:17,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:17,910 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 04:24:17,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:24:17,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:24:17,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:17,947 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 04:24:17,947 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 39#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:17,947 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 04:24:17,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:24:17,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:24:17,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:24:17,963 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-04 04:24:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,024 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-02-04 04:24:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:24:18,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 04:24:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,034 INFO L225 Difference]: With dead ends: 32 [2018-02-04 04:24:18,034 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 04:24:18,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:24:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 04:24:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 04:24:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 04:24:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 04:24:18,066 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 7 [2018-02-04 04:24:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,067 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 04:24:18,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:24:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 04:24:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:24:18,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,068 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,068 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,093 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 04:24:18,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 04:24:18,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:24:18,110 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 102#(= main_~i~0 0), 103#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:18,110 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 04:24:18,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:24:18,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:24:18,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:24:18,112 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2018-02-04 04:24:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,146 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 04:24:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:24:18,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 04:24:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,147 INFO L225 Difference]: With dead ends: 40 [2018-02-04 04:24:18,148 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 04:24:18,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:24:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 04:24:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-04 04:24:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:24:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 04:24:18,155 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 12 [2018-02-04 04:24:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,155 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 04:24:18,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:24:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 04:24:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:24:18,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,156 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,156 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,176 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 04:24:18,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:24:18,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:24:18,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,206 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 04:24:18,206 INFO L182 omatonBuilderFactory]: Interpolants [176#false, 179#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 175#true] [2018-02-04 04:24:18,206 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 04:24:18,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:24:18,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:24:18,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:24:18,207 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-02-04 04:24:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,223 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-04 04:24:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:24:18,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 04:24:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,224 INFO L225 Difference]: With dead ends: 33 [2018-02-04 04:24:18,224 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 04:24:18,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:24:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 04:24:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-04 04:24:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 04:24:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-04 04:24:18,228 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2018-02-04 04:24:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,228 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-04 04:24:18,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:24:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-04 04:24:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:24:18,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,229 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,230 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,260 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 04:24:18,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 04:24:18,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,278 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 04:24:18,278 INFO L182 omatonBuilderFactory]: Interpolants [246#true, 247#false, 250#(= main_~i~0 0), 251#(= main_~i~0 1), 252#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:18,278 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 04:24:18,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:24:18,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:24:18,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:24:18,279 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2018-02-04 04:24:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,326 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 04:24:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:24:18,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:24:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,328 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:24:18,328 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 04:24:18,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:24:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 04:24:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2018-02-04 04:24:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 04:24:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 04:24:18,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2018-02-04 04:24:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,337 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 04:24:18,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:24:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 04:24:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:24:18,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,338 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,338 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1068831120, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 04:24:18,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:24:18,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:24:18,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,394 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 04:24:18,394 INFO L182 omatonBuilderFactory]: Interpolants [352#false, 355#(= main_~i~0 0), 356#(<= main_~i~0 main_~x~0), 351#true] [2018-02-04 04:24:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 04:24:18,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:24:18,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:24:18,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:24:18,395 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2018-02-04 04:24:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,435 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 04:24:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:24:18,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 04:24:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,436 INFO L225 Difference]: With dead ends: 41 [2018-02-04 04:24:18,436 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 04:24:18,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:24:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 04:24:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 04:24:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 04:24:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-04 04:24:18,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2018-02-04 04:24:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,440 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-04 04:24:18,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:24:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-04 04:24:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:24:18,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,441 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,441 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,471 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 04:24:18,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 04:24:18,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,488 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 04:24:18,488 INFO L182 omatonBuilderFactory]: Interpolants [448#(= main_~i~0 2), 449#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 442#true, 443#false, 446#(= main_~i~0 0), 447#(= main_~i~0 1)] [2018-02-04 04:24:18,488 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 04:24:18,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:24:18,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:24:18,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:24:18,489 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 6 states. [2018-02-04 04:24:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,534 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 04:24:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:24:18,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 04:24:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,535 INFO L225 Difference]: With dead ends: 65 [2018-02-04 04:24:18,535 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 04:24:18,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:24:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 04:24:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-02-04 04:24:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 04:24:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-04 04:24:18,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 22 [2018-02-04 04:24:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,538 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-04 04:24:18,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:24:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-04 04:24:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:24:18,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,538 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 04:24:18,539 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:24:18,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-04 04:24:18,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,579 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 04:24:18,579 INFO L182 omatonBuilderFactory]: Interpolants [562#(= 0 main_~x~0), 567#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 558#true, 559#false] [2018-02-04 04:24:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:24:18,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:24:18,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:24:18,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:24:18,580 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-02-04 04:24:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,593 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 04:24:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:24:18,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-04 04:24:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,594 INFO L225 Difference]: With dead ends: 49 [2018-02-04 04:24:18,594 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 04:24:18,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:24:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 04:24:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 04:24:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 04:24:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 04:24:18,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-02-04 04:24:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,597 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 04:24:18,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:24:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 04:24:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:24:18,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,599 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,599 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,642 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 04:24:18,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 04:24:18,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:24:18,671 INFO L182 omatonBuilderFactory]: Interpolants [672#(= main_~i~0 2), 673#(= main_~i~0 3), 674#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 666#true, 667#false, 670#(= main_~i~0 0), 671#(= main_~i~0 1)] [2018-02-04 04:24:18,672 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 04:24:18,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:24:18,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:24:18,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:24:18,672 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-02-04 04:24:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,747 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-02-04 04:24:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:24:18,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:24:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,748 INFO L225 Difference]: With dead ends: 105 [2018-02-04 04:24:18,748 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 04:24:18,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:24:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 04:24:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 54. [2018-02-04 04:24:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 04:24:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 04:24:18,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 27 [2018-02-04 04:24:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,753 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 04:24:18,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:24:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 04:24:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:24:18,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,754 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,754 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,796 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 04:24:18,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 04:24:18,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,812 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 04:24:18,813 INFO L182 omatonBuilderFactory]: Interpolants [834#true, 835#false, 838#(= main_~i~0 0), 839#(= main_~i~0 1), 840#(= main_~i~0 2), 841#(= main_~i~0 3), 842#(= main_~i~0 4), 843#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:18,813 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 04:24:18,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:24:18,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:24:18,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:24:18,813 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-02-04 04:24:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:18,909 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-02-04 04:24:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:24:18,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 04:24:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:18,911 INFO L225 Difference]: With dead ends: 127 [2018-02-04 04:24:18,911 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 04:24:18,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:24:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 04:24:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2018-02-04 04:24:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 04:24:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-02-04 04:24:18,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 32 [2018-02-04 04:24:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:18,916 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-02-04 04:24:18,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:24:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-02-04 04:24:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:24:18,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:18,917 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:18,917 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1847336049, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:18,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:24:18,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:18,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 04:24:18,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:24:18,978 INFO L182 omatonBuilderFactory]: Interpolants [1044#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1030#true, 1031#false, 1034#(= 0 main_~x~0), 1039#(= 1 main_~x~0)] [2018-02-04 04:24:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:24:18,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:24:18,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:24:18,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:24:18,979 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2018-02-04 04:24:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,024 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-02-04 04:24:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:24:19,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 04:24:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,025 INFO L225 Difference]: With dead ends: 65 [2018-02-04 04:24:19,026 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 04:24:19,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:24:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 04:24:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 04:24:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 04:24:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-02-04 04:24:19,031 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 37 [2018-02-04 04:24:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,031 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-02-04 04:24:19,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:24:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-02-04 04:24:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:24:19,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,032 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,032 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,080 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 04:24:19,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:19,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 04:24:19,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:24:19,109 INFO L182 omatonBuilderFactory]: Interpolants [1184#(= main_~i~0 5), 1185#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 1175#true, 1176#false, 1179#(= main_~i~0 0), 1180#(= main_~i~0 1), 1181#(= main_~i~0 2), 1182#(= main_~i~0 3), 1183#(= main_~i~0 4)] [2018-02-04 04:24:19,109 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 04:24:19,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:24:19,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:24:19,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:24:19,110 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2018-02-04 04:24:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,194 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2018-02-04 04:24:19,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:24:19,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-04 04:24:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,195 INFO L225 Difference]: With dead ends: 185 [2018-02-04 04:24:19,195 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 04:24:19,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:24:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 04:24:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 70. [2018-02-04 04:24:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 04:24:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-04 04:24:19,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-02-04 04:24:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,201 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-04 04:24:19,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:24:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-04 04:24:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:24:19,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,201 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,201 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,239 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 04:24:19,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:19,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 04:24:19,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:19,256 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 04:24:19,256 INFO L182 omatonBuilderFactory]: Interpolants [1441#true, 1442#false, 1445#(= main_~i~0 0), 1446#(= main_~i~0 1), 1447#(= main_~i~0 2), 1448#(= main_~i~0 3), 1449#(= main_~i~0 4), 1450#(= main_~i~0 5), 1451#(= main_~i~0 6), 1452#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:19,257 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 04:24:19,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:24:19,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:24:19,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:24:19,257 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-02-04 04:24:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,390 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2018-02-04 04:24:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:24:19,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 04:24:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,391 INFO L225 Difference]: With dead ends: 213 [2018-02-04 04:24:19,391 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 04:24:19,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:24:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 04:24:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 75. [2018-02-04 04:24:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 04:24:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-02-04 04:24:19,399 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 42 [2018-02-04 04:24:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,399 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-02-04 04:24:19,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:24:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-02-04 04:24:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:24:19,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,401 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,401 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1801003465, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:24:19,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:19,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 04:24:19,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 04:24:19,438 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 1745#(= 0 main_~x~0), 1750#(= 1 main_~x~0), 1755#(= main_~x~0 2), 1741#true, 1742#false] [2018-02-04 04:24:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 04:24:19,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:24:19,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:24:19,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:24:19,438 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 6 states. [2018-02-04 04:24:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,458 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-04 04:24:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:24:19,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-04 04:24:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,459 INFO L225 Difference]: With dead ends: 81 [2018-02-04 04:24:19,459 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 04:24:19,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:24:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 04:24:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 04:24:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:24:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-04 04:24:19,462 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 47 [2018-02-04 04:24:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,463 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-04 04:24:19,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:24:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-04 04:24:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:24:19,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,464 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,464 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,502 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 04:24:19,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:19,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:24:19,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:19,518 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 04:24:19,518 INFO L182 omatonBuilderFactory]: Interpolants [1923#true, 1924#false, 1927#(= main_~i~0 0), 1928#(= main_~i~0 1), 1929#(= main_~i~0 2), 1930#(= main_~i~0 3), 1931#(= main_~i~0 4), 1932#(= main_~i~0 5), 1933#(= main_~i~0 6), 1934#(= main_~i~0 7), 1935#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:19,518 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 04:24:19,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:24:19,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:24:19,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:24:19,519 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-02-04 04:24:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,649 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2018-02-04 04:24:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:24:19,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 04:24:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,650 INFO L225 Difference]: With dead ends: 289 [2018-02-04 04:24:19,650 INFO L226 Difference]: Without dead ends: 289 [2018-02-04 04:24:19,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:24:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-04 04:24:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 86. [2018-02-04 04:24:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 04:24:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-02-04 04:24:19,657 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 47 [2018-02-04 04:24:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,657 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-02-04 04:24:19,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:24:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-02-04 04:24:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:24:19,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,658 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,659 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:19,729 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 04:24:19,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:19,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 04:24:19,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:19,746 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 04:24:19,746 INFO L182 omatonBuilderFactory]: Interpolants [2320#(= main_~i~0 5), 2321#(= main_~i~0 6), 2322#(= main_~i~0 7), 2323#(= main_~i~0 8), 2324#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 2311#true, 2312#false, 2315#(= main_~i~0 0), 2316#(= main_~i~0 1), 2317#(= main_~i~0 2), 2318#(= main_~i~0 3), 2319#(= main_~i~0 4)] [2018-02-04 04:24:19,747 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 04:24:19,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:24:19,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:24:19,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:24:19,747 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 12 states. [2018-02-04 04:24:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:19,949 INFO L93 Difference]: Finished difference Result 323 states and 367 transitions. [2018-02-04 04:24:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:24:19,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-04 04:24:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:19,953 INFO L225 Difference]: With dead ends: 323 [2018-02-04 04:24:19,954 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 04:24:19,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:24:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 04:24:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 91. [2018-02-04 04:24:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 04:24:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-02-04 04:24:19,966 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 52 [2018-02-04 04:24:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:19,966 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-02-04 04:24:19,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:24:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-02-04 04:24:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 04:24:19,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:19,968 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:19,968 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -710320253, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:19,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 04:24:20,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:20,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 04:24:20,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 04:24:20,124 INFO L182 omatonBuilderFactory]: Interpolants [2753#(= main_~x~0 2), 2739#true, 2740#false, 2758#(= main_~x~0 3), 2743#(= 0 main_~x~0), 2763#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 2748#(= 1 main_~x~0)] [2018-02-04 04:24:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 04:24:20,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:24:20,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:24:20,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:24:20,125 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2018-02-04 04:24:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:20,194 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-04 04:24:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:24:20,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-02-04 04:24:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:20,195 INFO L225 Difference]: With dead ends: 97 [2018-02-04 04:24:20,195 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 04:24:20,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:24:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 04:24:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 04:24:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 04:24:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-02-04 04:24:20,202 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 57 [2018-02-04 04:24:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:20,202 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-02-04 04:24:20,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:24:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-02-04 04:24:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 04:24:20,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:20,203 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:20,204 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:20,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 04:24:20,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,293 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 04:24:20,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:20,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:24:20,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:20,321 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 04:24:20,321 INFO L182 omatonBuilderFactory]: Interpolants [2958#true, 2959#false, 2962#(= main_~i~0 0), 2963#(= main_~i~0 1), 2964#(= main_~i~0 2), 2965#(= main_~i~0 3), 2966#(= main_~i~0 4), 2967#(= main_~i~0 5), 2968#(= main_~i~0 6), 2969#(= main_~i~0 7), 2970#(= main_~i~0 8), 2971#(= main_~i~0 9), 2972#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:20,322 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 04:24:20,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:24:20,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:24:20,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:24:20,322 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 13 states. [2018-02-04 04:24:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:20,577 INFO L93 Difference]: Finished difference Result 417 states and 476 transitions. [2018-02-04 04:24:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:24:20,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 04:24:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:20,578 INFO L225 Difference]: With dead ends: 417 [2018-02-04 04:24:20,578 INFO L226 Difference]: Without dead ends: 417 [2018-02-04 04:24:20,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:24:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-04 04:24:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 102. [2018-02-04 04:24:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 04:24:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-04 04:24:20,583 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 57 [2018-02-04 04:24:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:20,583 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-04 04:24:20,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:24:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-04 04:24:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 04:24:20,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:20,584 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:20,584 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:20,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,653 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 04:24:20,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:20,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:24:20,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:20,669 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 04:24:20,669 INFO L182 omatonBuilderFactory]: Interpolants [3492#true, 3493#false, 3496#(= main_~i~0 0), 3497#(= main_~i~0 1), 3498#(= main_~i~0 2), 3499#(= main_~i~0 3), 3500#(= main_~i~0 4), 3501#(= main_~i~0 5), 3502#(= main_~i~0 6), 3503#(= main_~i~0 7), 3504#(= main_~i~0 8), 3505#(= main_~i~0 9), 3506#(= main_~i~0 10), 3507#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:20,670 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 04:24:20,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:24:20,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:24:20,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:24:20,670 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 14 states. [2018-02-04 04:24:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:20,917 INFO L93 Difference]: Finished difference Result 457 states and 522 transitions. [2018-02-04 04:24:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:24:20,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 04:24:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:20,923 INFO L225 Difference]: With dead ends: 457 [2018-02-04 04:24:20,923 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 04:24:20,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:24:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 04:24:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 107. [2018-02-04 04:24:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:24:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-04 04:24:20,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 62 [2018-02-04 04:24:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:20,928 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-04 04:24:20,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:24:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-04 04:24:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:24:20,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:20,929 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:20,929 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1220230333, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:20,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-04 04:24:20,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:20,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 04:24:20,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 04:24:20,983 INFO L182 omatonBuilderFactory]: Interpolants [4096#(= main_~x~0 4), 4081#(= 1 main_~x~0), 4101#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 4086#(= main_~x~0 2), 4072#true, 4073#false, 4091#(= main_~x~0 3), 4076#(= 0 main_~x~0)] [2018-02-04 04:24:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-04 04:24:20,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:24:20,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:24:20,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:24:20,984 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 8 states. [2018-02-04 04:24:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:21,024 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-04 04:24:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:24:21,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-04 04:24:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:21,025 INFO L225 Difference]: With dead ends: 113 [2018-02-04 04:24:21,025 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 04:24:21,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:24:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 04:24:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 04:24:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:24:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-02-04 04:24:21,029 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 67 [2018-02-04 04:24:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:21,029 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-02-04 04:24:21,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:24:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-02-04 04:24:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:24:21,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:21,030 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:21,030 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:21,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,134 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 04:24:21,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:21,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:24:21,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:21,191 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 04:24:21,192 INFO L182 omatonBuilderFactory]: Interpolants [4328#true, 4329#false, 4332#(= main_~i~0 0), 4333#(= main_~i~0 1), 4334#(= main_~i~0 2), 4335#(= main_~i~0 3), 4336#(= main_~i~0 4), 4337#(= main_~i~0 5), 4338#(= main_~i~0 6), 4339#(= main_~i~0 7), 4340#(= main_~i~0 8), 4341#(= main_~i~0 9), 4342#(= main_~i~0 10), 4343#(= main_~i~0 11), 4344#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:21,192 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 04:24:21,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:24:21,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:24:21,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:24:21,193 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 15 states. [2018-02-04 04:24:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:21,479 INFO L93 Difference]: Finished difference Result 569 states and 652 transitions. [2018-02-04 04:24:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:24:21,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-02-04 04:24:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:21,489 INFO L225 Difference]: With dead ends: 569 [2018-02-04 04:24:21,489 INFO L226 Difference]: Without dead ends: 569 [2018-02-04 04:24:21,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:24:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-04 04:24:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 118. [2018-02-04 04:24:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 04:24:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2018-02-04 04:24:21,493 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 67 [2018-02-04 04:24:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:21,494 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2018-02-04 04:24:21,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:24:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-02-04 04:24:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:24:21,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:21,494 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:21,494 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 78469495, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:21,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 04:24:21,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:21,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 04:24:21,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:24:21,612 INFO L182 omatonBuilderFactory]: Interpolants [5056#(= main_~x~0 4), 5041#(= 1 main_~x~0), 5061#(= main_~x~0 5), 5046#(= main_~x~0 2), 5032#true, 5033#false, 5066#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 5051#(= main_~x~0 3), 5036#(= 0 main_~x~0)] [2018-02-04 04:24:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 04:24:21,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:24:21,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:24:21,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:24:21,613 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 9 states. [2018-02-04 04:24:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:21,674 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-02-04 04:24:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:24:21,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-02-04 04:24:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:21,675 INFO L225 Difference]: With dead ends: 124 [2018-02-04 04:24:21,675 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 04:24:21,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:24:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 04:24:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 04:24:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 04:24:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-02-04 04:24:21,677 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 77 [2018-02-04 04:24:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:21,677 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-02-04 04:24:21,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:24:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-02-04 04:24:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 04:24:21,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:21,677 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:21,677 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:21,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:21,769 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 04:24:21,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:21,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:24:21,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:21,786 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 04:24:21,787 INFO L182 omatonBuilderFactory]: Interpolants [5315#true, 5316#false, 5319#(= main_~i~0 0), 5320#(= main_~i~0 1), 5321#(= main_~i~0 2), 5322#(= main_~i~0 3), 5323#(= main_~i~0 4), 5324#(= main_~i~0 5), 5325#(= main_~i~0 6), 5326#(= main_~i~0 7), 5327#(= main_~i~0 8), 5328#(= main_~i~0 9), 5329#(= main_~i~0 10), 5330#(= main_~i~0 11), 5331#(= main_~i~0 12), 5332#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:21,787 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 04:24:21,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:24:21,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:24:21,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:24:21,787 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 16 states. [2018-02-04 04:24:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:22,066 INFO L93 Difference]: Finished difference Result 693 states and 796 transitions. [2018-02-04 04:24:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:24:22,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-04 04:24:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:22,069 INFO L225 Difference]: With dead ends: 693 [2018-02-04 04:24:22,069 INFO L226 Difference]: Without dead ends: 693 [2018-02-04 04:24:22,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:24:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-02-04 04:24:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 129. [2018-02-04 04:24:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 04:24:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-04 04:24:22,076 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 72 [2018-02-04 04:24:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:22,077 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-04 04:24:22,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:24:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-04 04:24:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:24:22,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:22,078 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:22,078 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:22,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,163 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 04:24:22,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:22,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:24:22,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:22,179 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 04:24:22,179 INFO L182 omatonBuilderFactory]: Interpolants [6155#true, 6156#false, 6159#(= main_~i~0 0), 6160#(= main_~i~0 1), 6161#(= main_~i~0 2), 6162#(= main_~i~0 3), 6163#(= main_~i~0 4), 6164#(= main_~i~0 5), 6165#(= main_~i~0 6), 6166#(= main_~i~0 7), 6167#(= main_~i~0 8), 6168#(= main_~i~0 9), 6169#(= main_~i~0 10), 6170#(= main_~i~0 11), 6171#(= main_~i~0 12), 6172#(= main_~i~0 13), 6173#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:22,180 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 04:24:22,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:24:22,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:24:22,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:24:22,180 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 17 states. [2018-02-04 04:24:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:22,480 INFO L93 Difference]: Finished difference Result 745 states and 856 transitions. [2018-02-04 04:24:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:24:22,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-04 04:24:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:22,481 INFO L225 Difference]: With dead ends: 745 [2018-02-04 04:24:22,481 INFO L226 Difference]: Without dead ends: 745 [2018-02-04 04:24:22,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:24:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-02-04 04:24:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 134. [2018-02-04 04:24:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 04:24:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2018-02-04 04:24:22,488 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 77 [2018-02-04 04:24:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:22,489 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2018-02-04 04:24:22,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:24:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2018-02-04 04:24:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:24:22,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:22,490 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:22,490 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash 735466929, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:22,494 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-02-04 04:24:22,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:22,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 04:24:22,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-04 04:24:22,596 INFO L182 omatonBuilderFactory]: Interpolants [7072#(= main_~x~0 3), 7057#(= 0 main_~x~0), 7092#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 7077#(= main_~x~0 4), 7062#(= 1 main_~x~0), 7082#(= main_~x~0 5), 7067#(= main_~x~0 2), 7053#true, 7054#false, 7087#(= main_~x~0 6)] [2018-02-04 04:24:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-02-04 04:24:22,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:24:22,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:24:22,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:24:22,597 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 10 states. [2018-02-04 04:24:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:22,706 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-02-04 04:24:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:24:22,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-02-04 04:24:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:22,707 INFO L225 Difference]: With dead ends: 140 [2018-02-04 04:24:22,707 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 04:24:22,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:24:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 04:24:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-04 04:24:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:24:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-04 04:24:22,710 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 87 [2018-02-04 04:24:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:22,710 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-04 04:24:22,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:24:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-04 04:24:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:24:22,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:22,711 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:22,711 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:22,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:22,849 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 04:24:22,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:22,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:24:22,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:22,883 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 04:24:22,884 INFO L182 omatonBuilderFactory]: Interpolants [7392#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 7373#true, 7374#false, 7377#(= main_~i~0 0), 7378#(= main_~i~0 1), 7379#(= main_~i~0 2), 7380#(= main_~i~0 3), 7381#(= main_~i~0 4), 7382#(= main_~i~0 5), 7383#(= main_~i~0 6), 7384#(= main_~i~0 7), 7385#(= main_~i~0 8), 7386#(= main_~i~0 9), 7387#(= main_~i~0 10), 7388#(= main_~i~0 11), 7389#(= main_~i~0 12), 7390#(= main_~i~0 13), 7391#(= main_~i~0 14)] [2018-02-04 04:24:22,884 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 04:24:22,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:24:22,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:24:22,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:24:22,885 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 18 states. [2018-02-04 04:24:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:23,321 INFO L93 Difference]: Finished difference Result 887 states and 1021 transitions. [2018-02-04 04:24:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:24:23,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-02-04 04:24:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:23,324 INFO L225 Difference]: With dead ends: 887 [2018-02-04 04:24:23,324 INFO L226 Difference]: Without dead ends: 887 [2018-02-04 04:24:23,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:24:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-02-04 04:24:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 145. [2018-02-04 04:24:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 04:24:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-02-04 04:24:23,333 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 82 [2018-02-04 04:24:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:23,334 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-02-04 04:24:23,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:24:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-02-04 04:24:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:24:23,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:23,335 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:23,335 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:23,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,473 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 04:24:23,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:23,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:24:23,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:23,499 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 04:24:23,499 INFO L182 omatonBuilderFactory]: Interpolants [8425#true, 8426#false, 8429#(= main_~i~0 0), 8430#(= main_~i~0 1), 8431#(= main_~i~0 2), 8432#(= main_~i~0 3), 8433#(= main_~i~0 4), 8434#(= main_~i~0 5), 8435#(= main_~i~0 6), 8436#(= main_~i~0 7), 8437#(= main_~i~0 8), 8438#(= main_~i~0 9), 8439#(= main_~i~0 10), 8440#(= main_~i~0 11), 8441#(= main_~i~0 12), 8442#(= main_~i~0 13), 8443#(= main_~i~0 14), 8444#(= main_~i~0 15), 8445#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:23,499 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 04:24:23,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:24:23,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:24:23,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:24:23,500 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 19 states. [2018-02-04 04:24:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:23,925 INFO L93 Difference]: Finished difference Result 945 states and 1088 transitions. [2018-02-04 04:24:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:24:23,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 04:24:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:23,927 INFO L225 Difference]: With dead ends: 945 [2018-02-04 04:24:23,927 INFO L226 Difference]: Without dead ends: 945 [2018-02-04 04:24:23,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:24:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-02-04 04:24:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 150. [2018-02-04 04:24:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 04:24:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2018-02-04 04:24:23,932 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 87 [2018-02-04 04:24:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:23,933 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2018-02-04 04:24:23,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:24:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2018-02-04 04:24:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:24:23,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:23,933 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:23,933 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1556402539, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:23,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-02-04 04:24:24,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:24,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 04:24:24,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-04 04:24:24,013 INFO L182 omatonBuilderFactory]: Interpolants [9585#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 9570#(= main_~x~0 5), 9555#(= main_~x~0 2), 9541#true, 9542#false, 9575#(= main_~x~0 6), 9560#(= main_~x~0 3), 9545#(= 0 main_~x~0), 9580#(= main_~x~0 7), 9565#(= main_~x~0 4), 9550#(= 1 main_~x~0)] [2018-02-04 04:24:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-02-04 04:24:24,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:24:24,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:24:24,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:24:24,013 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand 11 states. [2018-02-04 04:24:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:24,097 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-02-04 04:24:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:24:24,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-02-04 04:24:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:24,097 INFO L225 Difference]: With dead ends: 156 [2018-02-04 04:24:24,097 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 04:24:24,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:24:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 04:24:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-04 04:24:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 04:24:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2018-02-04 04:24:24,100 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 97 [2018-02-04 04:24:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:24,100 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2018-02-04 04:24:24,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:24:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2018-02-04 04:24:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:24:24,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:24,101 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:24,101 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:24,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:24,207 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 04:24:24,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:24,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:24:24,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:24,225 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 04:24:24,225 INFO L182 omatonBuilderFactory]: Interpolants [9898#true, 9899#false, 9902#(= main_~i~0 0), 9903#(= main_~i~0 1), 9904#(= main_~i~0 2), 9905#(= main_~i~0 3), 9906#(= main_~i~0 4), 9907#(= main_~i~0 5), 9908#(= main_~i~0 6), 9909#(= main_~i~0 7), 9910#(= main_~i~0 8), 9911#(= main_~i~0 9), 9912#(= main_~i~0 10), 9913#(= main_~i~0 11), 9914#(= main_~i~0 12), 9915#(= main_~i~0 13), 9916#(= main_~i~0 14), 9917#(= main_~i~0 15), 9918#(= main_~i~0 16), 9919#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:24,225 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 04:24:24,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:24:24,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:24:24,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:24:24,225 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 20 states. [2018-02-04 04:24:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:24,667 INFO L93 Difference]: Finished difference Result 1105 states and 1274 transitions. [2018-02-04 04:24:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:24:24,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-02-04 04:24:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:24,670 INFO L225 Difference]: With dead ends: 1105 [2018-02-04 04:24:24,670 INFO L226 Difference]: Without dead ends: 1105 [2018-02-04 04:24:24,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:24:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-02-04 04:24:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 161. [2018-02-04 04:24:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 04:24:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2018-02-04 04:24:24,679 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 92 [2018-02-04 04:24:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:24,679 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2018-02-04 04:24:24,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:24:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2018-02-04 04:24:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:24:24,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:24,680 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:24,681 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:24,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:24,806 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 04:24:24,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:24,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:24:24,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:24:24,822 INFO L182 omatonBuilderFactory]: Interpolants [11200#(= main_~i~0 10), 11201#(= main_~i~0 11), 11202#(= main_~i~0 12), 11203#(= main_~i~0 13), 11204#(= main_~i~0 14), 11205#(= main_~i~0 15), 11206#(= main_~i~0 16), 11207#(= main_~i~0 17), 11208#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 11186#true, 11187#false, 11190#(= main_~i~0 0), 11191#(= main_~i~0 1), 11192#(= main_~i~0 2), 11193#(= main_~i~0 3), 11194#(= main_~i~0 4), 11195#(= main_~i~0 5), 11196#(= main_~i~0 6), 11197#(= main_~i~0 7), 11198#(= main_~i~0 8), 11199#(= main_~i~0 9)] [2018-02-04 04:24:24,822 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 04:24:24,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:24:24,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:24:24,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:24:24,823 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 21 states. [2018-02-04 04:24:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:25,274 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2018-02-04 04:24:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:24:25,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-02-04 04:24:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:25,276 INFO L225 Difference]: With dead ends: 1169 [2018-02-04 04:24:25,276 INFO L226 Difference]: Without dead ends: 1169 [2018-02-04 04:24:25,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:24:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-02-04 04:24:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 166. [2018-02-04 04:24:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 04:24:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-02-04 04:24:25,285 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 97 [2018-02-04 04:24:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:25,285 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-02-04 04:24:25,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:24:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-02-04 04:24:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 04:24:25,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:25,286 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:25,287 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -868258651, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:25,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-02-04 04:24:25,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:25,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 04:24:25,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-04 04:24:25,381 INFO L182 omatonBuilderFactory]: Interpolants [12544#true, 12545#false, 12593#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 12578#(= main_~x~0 6), 12563#(= main_~x~0 3), 12548#(= 0 main_~x~0), 12583#(= main_~x~0 7), 12568#(= main_~x~0 4), 12553#(= 1 main_~x~0), 12588#(= main_~x~0 8), 12573#(= main_~x~0 5), 12558#(= main_~x~0 2)] [2018-02-04 04:24:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-02-04 04:24:25,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:24:25,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:24:25,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:24:25,381 INFO L87 Difference]: Start difference. First operand 166 states and 192 transitions. Second operand 12 states. [2018-02-04 04:24:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:25,472 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2018-02-04 04:24:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:24:25,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-02-04 04:24:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:25,473 INFO L225 Difference]: With dead ends: 172 [2018-02-04 04:24:25,473 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 04:24:25,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:24:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 04:24:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-04 04:24:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 04:24:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2018-02-04 04:24:25,476 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 107 [2018-02-04 04:24:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:25,476 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2018-02-04 04:24:25,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:24:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2018-02-04 04:24:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 04:24:25,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:25,478 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:25,478 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:25,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:25,615 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 04:24:25,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:25,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:24:25,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:25,640 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 04:24:25,640 INFO L182 omatonBuilderFactory]: Interpolants [12960#(= main_~i~0 18), 12961#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 12938#true, 12939#false, 12942#(= main_~i~0 0), 12943#(= main_~i~0 1), 12944#(= main_~i~0 2), 12945#(= main_~i~0 3), 12946#(= main_~i~0 4), 12947#(= main_~i~0 5), 12948#(= main_~i~0 6), 12949#(= main_~i~0 7), 12950#(= main_~i~0 8), 12951#(= main_~i~0 9), 12952#(= main_~i~0 10), 12953#(= main_~i~0 11), 12954#(= main_~i~0 12), 12955#(= main_~i~0 13), 12956#(= main_~i~0 14), 12957#(= main_~i~0 15), 12958#(= main_~i~0 16), 12959#(= main_~i~0 17)] [2018-02-04 04:24:25,641 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 04:24:25,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:24:25,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:24:25,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:24:25,642 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand 22 states. [2018-02-04 04:24:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:26,151 INFO L93 Difference]: Finished difference Result 1347 states and 1555 transitions. [2018-02-04 04:24:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:24:26,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-04 04:24:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:26,153 INFO L225 Difference]: With dead ends: 1347 [2018-02-04 04:24:26,153 INFO L226 Difference]: Without dead ends: 1347 [2018-02-04 04:24:26,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:24:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-02-04 04:24:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 177. [2018-02-04 04:24:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 04:24:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2018-02-04 04:24:26,162 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 102 [2018-02-04 04:24:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:26,162 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2018-02-04 04:24:26,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:24:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2018-02-04 04:24:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 04:24:26,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:26,184 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:26,184 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:26,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:26,368 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 04:24:26,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:26,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:24:26,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:26,397 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 04:24:26,397 INFO L182 omatonBuilderFactory]: Interpolants [14496#(= main_~i~0 6), 14497#(= main_~i~0 7), 14498#(= main_~i~0 8), 14499#(= main_~i~0 9), 14500#(= main_~i~0 10), 14501#(= main_~i~0 11), 14502#(= main_~i~0 12), 14503#(= main_~i~0 13), 14504#(= main_~i~0 14), 14505#(= main_~i~0 15), 14506#(= main_~i~0 16), 14507#(= main_~i~0 17), 14508#(= main_~i~0 18), 14509#(= main_~i~0 19), 14510#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 14486#true, 14487#false, 14490#(= main_~i~0 0), 14491#(= main_~i~0 1), 14492#(= main_~i~0 2), 14493#(= main_~i~0 3), 14494#(= main_~i~0 4), 14495#(= main_~i~0 5)] [2018-02-04 04:24:26,397 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 04:24:26,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:24:26,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:24:26,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:24:26,398 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 23 states. [2018-02-04 04:24:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:26,983 INFO L93 Difference]: Finished difference Result 1417 states and 1636 transitions. [2018-02-04 04:24:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:24:26,984 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2018-02-04 04:24:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:26,986 INFO L225 Difference]: With dead ends: 1417 [2018-02-04 04:24:26,986 INFO L226 Difference]: Without dead ends: 1417 [2018-02-04 04:24:26,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:24:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2018-02-04 04:24:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 182. [2018-02-04 04:24:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 04:24:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2018-02-04 04:24:26,995 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 107 [2018-02-04 04:24:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:26,995 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2018-02-04 04:24:26,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:24:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2018-02-04 04:24:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 04:24:26,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:26,996 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:26,996 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -549140641, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:27,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-02-04 04:24:27,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:27,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 04:24:27,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 04:24:27,094 INFO L182 omatonBuilderFactory]: Interpolants [16129#(= main_~x~0 3), 16164#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 16134#(= main_~x~0 4), 16139#(= main_~x~0 5), 16110#true, 16111#false, 16144#(= main_~x~0 6), 16114#(= 0 main_~x~0), 16149#(= main_~x~0 7), 16119#(= 1 main_~x~0), 16154#(= main_~x~0 8), 16124#(= main_~x~0 2), 16159#(= main_~x~0 9)] [2018-02-04 04:24:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-02-04 04:24:27,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:24:27,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:24:27,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:24:27,095 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand 13 states. [2018-02-04 04:24:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:27,275 INFO L93 Difference]: Finished difference Result 188 states and 218 transitions. [2018-02-04 04:24:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:24:27,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-02-04 04:24:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:27,276 INFO L225 Difference]: With dead ends: 188 [2018-02-04 04:24:27,276 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 04:24:27,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:24:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 04:24:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 04:24:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 04:24:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2018-02-04 04:24:27,279 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 117 [2018-02-04 04:24:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:27,279 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2018-02-04 04:24:27,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:24:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2018-02-04 04:24:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 04:24:27,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:27,280 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:27,280 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:27,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:27,527 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 04:24:27,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:27,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:24:27,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:27,556 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 04:24:27,556 INFO L182 omatonBuilderFactory]: Interpolants [16545#(= main_~i~0 0), 16546#(= main_~i~0 1), 16547#(= main_~i~0 2), 16548#(= main_~i~0 3), 16549#(= main_~i~0 4), 16550#(= main_~i~0 5), 16551#(= main_~i~0 6), 16552#(= main_~i~0 7), 16553#(= main_~i~0 8), 16554#(= main_~i~0 9), 16555#(= main_~i~0 10), 16556#(= main_~i~0 11), 16557#(= main_~i~0 12), 16558#(= main_~i~0 13), 16559#(= main_~i~0 14), 16560#(= main_~i~0 15), 16561#(= main_~i~0 16), 16562#(= main_~i~0 17), 16563#(= main_~i~0 18), 16564#(= main_~i~0 19), 16565#(= main_~i~0 20), 16566#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 16541#true, 16542#false] [2018-02-04 04:24:27,557 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 04:24:27,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:24:27,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:24:27,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:24:27,557 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 24 states. [2018-02-04 04:24:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:28,375 INFO L93 Difference]: Finished difference Result 1613 states and 1864 transitions. [2018-02-04 04:24:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:24:28,376 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2018-02-04 04:24:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:28,380 INFO L225 Difference]: With dead ends: 1613 [2018-02-04 04:24:28,380 INFO L226 Difference]: Without dead ends: 1613 [2018-02-04 04:24:28,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:24:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-02-04 04:24:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 193. [2018-02-04 04:24:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 04:24:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 224 transitions. [2018-02-04 04:24:28,391 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 224 transitions. Word has length 112 [2018-02-04 04:24:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:28,391 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 224 transitions. [2018-02-04 04:24:28,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:24:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 224 transitions. [2018-02-04 04:24:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 04:24:28,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:28,392 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:28,392 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1158381977, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:28,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-02-04 04:24:28,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:28,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 04:24:28,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-04 04:24:28,539 INFO L182 omatonBuilderFactory]: Interpolants [18432#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 18402#(= main_~x~0 5), 18373#true, 18374#false, 18407#(= main_~x~0 6), 18377#(= 0 main_~x~0), 18412#(= main_~x~0 7), 18382#(= 1 main_~x~0), 18417#(= main_~x~0 8), 18387#(= main_~x~0 2), 18422#(= main_~x~0 9), 18392#(= main_~x~0 3), 18427#(= main_~x~0 10), 18397#(= main_~x~0 4)] [2018-02-04 04:24:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-02-04 04:24:28,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:24:28,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:24:28,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:24:28,540 INFO L87 Difference]: Start difference. First operand 193 states and 224 transitions. Second operand 14 states. [2018-02-04 04:24:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:28,702 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2018-02-04 04:24:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:24:28,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-02-04 04:24:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:28,703 INFO L225 Difference]: With dead ends: 199 [2018-02-04 04:24:28,703 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 04:24:28,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:24:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 04:24:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-02-04 04:24:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 04:24:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-02-04 04:24:28,707 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 127 [2018-02-04 04:24:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:28,707 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-02-04 04:24:28,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:24:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-02-04 04:24:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 04:24:28,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:28,708 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:28,708 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:28,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:28,863 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 04:24:28,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:28,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:24:28,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:28,879 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 04:24:28,880 INFO L182 omatonBuilderFactory]: Interpolants [18831#true, 18832#false, 18835#(= main_~i~0 0), 18836#(= main_~i~0 1), 18837#(= main_~i~0 2), 18838#(= main_~i~0 3), 18839#(= main_~i~0 4), 18840#(= main_~i~0 5), 18841#(= main_~i~0 6), 18842#(= main_~i~0 7), 18843#(= main_~i~0 8), 18844#(= main_~i~0 9), 18845#(= main_~i~0 10), 18846#(= main_~i~0 11), 18847#(= main_~i~0 12), 18848#(= main_~i~0 13), 18849#(= main_~i~0 14), 18850#(= main_~i~0 15), 18851#(= main_~i~0 16), 18852#(= main_~i~0 17), 18853#(= main_~i~0 18), 18854#(= main_~i~0 19), 18855#(= main_~i~0 20), 18856#(= main_~i~0 21), 18857#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:28,880 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 04:24:28,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:24:28,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:24:28,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:24:28,880 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 25 states. [2018-02-04 04:24:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:29,595 INFO L93 Difference]: Finished difference Result 1821 states and 2106 transitions. [2018-02-04 04:24:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:24:29,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-02-04 04:24:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:29,598 INFO L225 Difference]: With dead ends: 1821 [2018-02-04 04:24:29,598 INFO L226 Difference]: Without dead ends: 1821 [2018-02-04 04:24:29,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:24:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-02-04 04:24:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 204. [2018-02-04 04:24:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 04:24:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2018-02-04 04:24:29,604 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 117 [2018-02-04 04:24:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:29,605 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2018-02-04 04:24:29,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:24:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2018-02-04 04:24:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 04:24:29,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:29,605 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:29,605 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:29,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:29,766 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 04:24:29,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:29,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:24:29,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:29,781 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 04:24:29,781 INFO L182 omatonBuilderFactory]: Interpolants [20883#true, 20884#false, 20887#(= main_~i~0 0), 20888#(= main_~i~0 1), 20889#(= main_~i~0 2), 20890#(= main_~i~0 3), 20891#(= main_~i~0 4), 20892#(= main_~i~0 5), 20893#(= main_~i~0 6), 20894#(= main_~i~0 7), 20895#(= main_~i~0 8), 20896#(= main_~i~0 9), 20897#(= main_~i~0 10), 20898#(= main_~i~0 11), 20899#(= main_~i~0 12), 20900#(= main_~i~0 13), 20901#(= main_~i~0 14), 20902#(= main_~i~0 15), 20903#(= main_~i~0 16), 20904#(= main_~i~0 17), 20905#(= main_~i~0 18), 20906#(= main_~i~0 19), 20907#(= main_~i~0 20), 20908#(= main_~i~0 21), 20909#(= main_~i~0 22), 20910#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:29,782 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 04:24:29,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:24:29,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:24:29,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:24:29,782 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand 26 states. [2018-02-04 04:24:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:30,555 INFO L93 Difference]: Finished difference Result 1903 states and 2201 transitions. [2018-02-04 04:24:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:24:30,556 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2018-02-04 04:24:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:30,561 INFO L225 Difference]: With dead ends: 1903 [2018-02-04 04:24:30,561 INFO L226 Difference]: Without dead ends: 1903 [2018-02-04 04:24:30,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:24:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-02-04 04:24:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 209. [2018-02-04 04:24:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 04:24:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2018-02-04 04:24:30,572 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 122 [2018-02-04 04:24:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:30,573 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2018-02-04 04:24:30,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:24:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2018-02-04 04:24:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:24:30,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:30,574 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:30,574 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1862124717, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:30,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-02-04 04:24:30,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:30,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 04:24:30,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-04 04:24:30,679 INFO L182 omatonBuilderFactory]: Interpolants [23072#(= main_~x~0 9), 23042#(= main_~x~0 3), 23077#(= main_~x~0 10), 23047#(= main_~x~0 4), 23082#(= main_~x~0 11), 23052#(= main_~x~0 5), 23023#true, 23087#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 23024#false, 23057#(= main_~x~0 6), 23027#(= 0 main_~x~0), 23062#(= main_~x~0 7), 23032#(= 1 main_~x~0), 23067#(= main_~x~0 8), 23037#(= main_~x~0 2)] [2018-02-04 04:24:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 432 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-02-04 04:24:30,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:24:30,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:24:30,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:24:30,679 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand 15 states. [2018-02-04 04:24:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:30,841 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-02-04 04:24:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:24:30,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-02-04 04:24:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:30,842 INFO L225 Difference]: With dead ends: 215 [2018-02-04 04:24:30,842 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 04:24:30,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:24:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 04:24:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-04 04:24:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 04:24:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 250 transitions. [2018-02-04 04:24:30,844 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 250 transitions. Word has length 137 [2018-02-04 04:24:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:30,844 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 250 transitions. [2018-02-04 04:24:30,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:24:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 250 transitions. [2018-02-04 04:24:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 04:24:30,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:30,844 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:30,844 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:30,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:31,011 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 04:24:31,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:31,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 04:24:31,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:31,027 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 04:24:31,027 INFO L182 omatonBuilderFactory]: Interpolants [23518#true, 23519#false, 23522#(= main_~i~0 0), 23523#(= main_~i~0 1), 23524#(= main_~i~0 2), 23525#(= main_~i~0 3), 23526#(= main_~i~0 4), 23527#(= main_~i~0 5), 23528#(= main_~i~0 6), 23529#(= main_~i~0 7), 23530#(= main_~i~0 8), 23531#(= main_~i~0 9), 23532#(= main_~i~0 10), 23533#(= main_~i~0 11), 23534#(= main_~i~0 12), 23535#(= main_~i~0 13), 23536#(= main_~i~0 14), 23537#(= main_~i~0 15), 23538#(= main_~i~0 16), 23539#(= main_~i~0 17), 23540#(= main_~i~0 18), 23541#(= main_~i~0 19), 23542#(= main_~i~0 20), 23543#(= main_~i~0 21), 23544#(= main_~i~0 22), 23545#(= main_~i~0 23), 23546#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:31,027 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 04:24:31,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:24:31,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:24:31,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:24:31,028 INFO L87 Difference]: Start difference. First operand 215 states and 250 transitions. Second operand 27 states. [2018-02-04 04:24:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:31,869 INFO L93 Difference]: Finished difference Result 2129 states and 2464 transitions. [2018-02-04 04:24:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:24:31,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 127 [2018-02-04 04:24:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:31,872 INFO L225 Difference]: With dead ends: 2129 [2018-02-04 04:24:31,872 INFO L226 Difference]: Without dead ends: 2129 [2018-02-04 04:24:31,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:24:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-02-04 04:24:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 220. [2018-02-04 04:24:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 04:24:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2018-02-04 04:24:31,880 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 127 [2018-02-04 04:24:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:31,880 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2018-02-04 04:24:31,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:24:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2018-02-04 04:24:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 04:24:31,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:31,881 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:31,881 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:31,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:32,048 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 04:24:32,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:32,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 04:24:32,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:32,064 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 04:24:32,064 INFO L182 omatonBuilderFactory]: Interpolants [25920#(= main_~i~0 20), 25921#(= main_~i~0 21), 25922#(= main_~i~0 22), 25923#(= main_~i~0 23), 25924#(= main_~i~0 24), 25925#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 25896#true, 25897#false, 25900#(= main_~i~0 0), 25901#(= main_~i~0 1), 25902#(= main_~i~0 2), 25903#(= main_~i~0 3), 25904#(= main_~i~0 4), 25905#(= main_~i~0 5), 25906#(= main_~i~0 6), 25907#(= main_~i~0 7), 25908#(= main_~i~0 8), 25909#(= main_~i~0 9), 25910#(= main_~i~0 10), 25911#(= main_~i~0 11), 25912#(= main_~i~0 12), 25913#(= main_~i~0 13), 25914#(= main_~i~0 14), 25915#(= main_~i~0 15), 25916#(= main_~i~0 16), 25917#(= main_~i~0 17), 25918#(= main_~i~0 18), 25919#(= main_~i~0 19)] [2018-02-04 04:24:32,064 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 04:24:32,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 04:24:32,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 04:24:32,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:24:32,064 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand 28 states. [2018-02-04 04:24:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:32,930 INFO L93 Difference]: Finished difference Result 2217 states and 2566 transitions. [2018-02-04 04:24:32,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:24:32,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 132 [2018-02-04 04:24:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:32,936 INFO L225 Difference]: With dead ends: 2217 [2018-02-04 04:24:32,936 INFO L226 Difference]: Without dead ends: 2217 [2018-02-04 04:24:32,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:24:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-02-04 04:24:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 225. [2018-02-04 04:24:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 04:24:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-02-04 04:24:32,948 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 132 [2018-02-04 04:24:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:32,948 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-02-04 04:24:32,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 04:24:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-02-04 04:24:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 04:24:32,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:32,949 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:32,949 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1422890125, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:32,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-02-04 04:24:33,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:33,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 04:24:33,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-02-04 04:24:33,075 INFO L182 omatonBuilderFactory]: Interpolants [28417#(= main_~x~0 9), 28387#(= main_~x~0 3), 28422#(= main_~x~0 10), 28392#(= main_~x~0 4), 28427#(= main_~x~0 11), 28397#(= main_~x~0 5), 28368#true, 28432#(= main_~x~0 12), 28369#false, 28402#(= main_~x~0 6), 28372#(= 0 main_~x~0), 28437#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 28407#(= main_~x~0 7), 28377#(= 1 main_~x~0), 28412#(= main_~x~0 8), 28382#(= main_~x~0 2)] [2018-02-04 04:24:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-02-04 04:24:33,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 04:24:33,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 04:24:33,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:24:33,075 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-02-04 04:24:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:33,257 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2018-02-04 04:24:33,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:24:33,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 147 [2018-02-04 04:24:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:33,258 INFO L225 Difference]: With dead ends: 231 [2018-02-04 04:24:33,258 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 04:24:33,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:24:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 04:24:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-02-04 04:24:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 04:24:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-04 04:24:33,260 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 147 [2018-02-04 04:24:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:33,260 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-04 04:24:33,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 04:24:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-04 04:24:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:24:33,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:33,261 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:33,261 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:33,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:33,466 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 04:24:33,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:33,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 04:24:33,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:33,482 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 04:24:33,482 INFO L182 omatonBuilderFactory]: Interpolants [28928#(= main_~i~0 24), 28929#(= main_~i~0 25), 28930#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 28900#true, 28901#false, 28904#(= main_~i~0 0), 28905#(= main_~i~0 1), 28906#(= main_~i~0 2), 28907#(= main_~i~0 3), 28908#(= main_~i~0 4), 28909#(= main_~i~0 5), 28910#(= main_~i~0 6), 28911#(= main_~i~0 7), 28912#(= main_~i~0 8), 28913#(= main_~i~0 9), 28914#(= main_~i~0 10), 28915#(= main_~i~0 11), 28916#(= main_~i~0 12), 28917#(= main_~i~0 13), 28918#(= main_~i~0 14), 28919#(= main_~i~0 15), 28920#(= main_~i~0 16), 28921#(= main_~i~0 17), 28922#(= main_~i~0 18), 28923#(= main_~i~0 19), 28924#(= main_~i~0 20), 28925#(= main_~i~0 21), 28926#(= main_~i~0 22), 28927#(= main_~i~0 23)] [2018-02-04 04:24:33,482 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 04:24:33,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:24:33,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:24:33,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:24:33,483 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 29 states. [2018-02-04 04:24:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:34,386 INFO L93 Difference]: Finished difference Result 2461 states and 2850 transitions. [2018-02-04 04:24:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:24:34,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 137 [2018-02-04 04:24:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:34,391 INFO L225 Difference]: With dead ends: 2461 [2018-02-04 04:24:34,391 INFO L226 Difference]: Without dead ends: 2461 [2018-02-04 04:24:34,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:24:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2018-02-04 04:24:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 236. [2018-02-04 04:24:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 04:24:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-02-04 04:24:34,400 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 137 [2018-02-04 04:24:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:34,400 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-02-04 04:24:34,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:24:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-02-04 04:24:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 04:24:34,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:34,401 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:34,401 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:34,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:34,603 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 04:24:34,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:34,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 04:24:34,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:34,619 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 04:24:34,619 INFO L182 omatonBuilderFactory]: Interpolants [31628#true, 31629#false, 31632#(= main_~i~0 0), 31633#(= main_~i~0 1), 31634#(= main_~i~0 2), 31635#(= main_~i~0 3), 31636#(= main_~i~0 4), 31637#(= main_~i~0 5), 31638#(= main_~i~0 6), 31639#(= main_~i~0 7), 31640#(= main_~i~0 8), 31641#(= main_~i~0 9), 31642#(= main_~i~0 10), 31643#(= main_~i~0 11), 31644#(= main_~i~0 12), 31645#(= main_~i~0 13), 31646#(= main_~i~0 14), 31647#(= main_~i~0 15), 31648#(= main_~i~0 16), 31649#(= main_~i~0 17), 31650#(= main_~i~0 18), 31651#(= main_~i~0 19), 31652#(= main_~i~0 20), 31653#(= main_~i~0 21), 31654#(= main_~i~0 22), 31655#(= main_~i~0 23), 31656#(= main_~i~0 24), 31657#(= main_~i~0 25), 31658#(= main_~i~0 26), 31659#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:34,619 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 04:24:34,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:24:34,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:24:34,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:24:34,619 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 30 states. [2018-02-04 04:24:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:35,614 INFO L93 Difference]: Finished difference Result 2555 states and 2959 transitions. [2018-02-04 04:24:35,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:24:35,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 142 [2018-02-04 04:24:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:35,619 INFO L225 Difference]: With dead ends: 2555 [2018-02-04 04:24:35,619 INFO L226 Difference]: Without dead ends: 2555 [2018-02-04 04:24:35,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:24:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-02-04 04:24:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 241. [2018-02-04 04:24:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 04:24:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2018-02-04 04:24:35,630 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 142 [2018-02-04 04:24:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:35,630 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2018-02-04 04:24:35,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:24:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2018-02-04 04:24:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:24:35,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:35,630 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:35,631 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:35,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1169019577, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:35,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-02-04 04:24:35,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:35,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 04:24:35,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-02-04 04:24:35,762 INFO L182 omatonBuilderFactory]: Interpolants [34465#(= 1 main_~x~0), 34530#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 34500#(= main_~x~0 8), 34470#(= main_~x~0 2), 34505#(= main_~x~0 9), 34475#(= main_~x~0 3), 34510#(= main_~x~0 10), 34480#(= main_~x~0 4), 34515#(= main_~x~0 11), 34485#(= main_~x~0 5), 34456#true, 34520#(= main_~x~0 12), 34457#false, 34490#(= main_~x~0 6), 34460#(= 0 main_~x~0), 34525#(= main_~x~0 13), 34495#(= main_~x~0 7)] [2018-02-04 04:24:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-02-04 04:24:35,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:24:35,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:24:35,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:24:35,763 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand 17 states. [2018-02-04 04:24:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:35,986 INFO L93 Difference]: Finished difference Result 247 states and 288 transitions. [2018-02-04 04:24:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:24:35,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2018-02-04 04:24:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:35,986 INFO L225 Difference]: With dead ends: 247 [2018-02-04 04:24:35,987 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 04:24:35,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:24:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 04:24:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-02-04 04:24:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 04:24:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 288 transitions. [2018-02-04 04:24:35,988 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 288 transitions. Word has length 157 [2018-02-04 04:24:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:35,989 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 288 transitions. [2018-02-04 04:24:35,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:24:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 288 transitions. [2018-02-04 04:24:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 04:24:35,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:35,989 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:35,989 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:35,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:36,208 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 04:24:36,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:36,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 04:24:36,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:36,223 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 04:24:36,223 INFO L182 omatonBuilderFactory]: Interpolants [35025#true, 35026#false, 35029#(= main_~i~0 0), 35030#(= main_~i~0 1), 35031#(= main_~i~0 2), 35032#(= main_~i~0 3), 35033#(= main_~i~0 4), 35034#(= main_~i~0 5), 35035#(= main_~i~0 6), 35036#(= main_~i~0 7), 35037#(= main_~i~0 8), 35038#(= main_~i~0 9), 35039#(= main_~i~0 10), 35040#(= main_~i~0 11), 35041#(= main_~i~0 12), 35042#(= main_~i~0 13), 35043#(= main_~i~0 14), 35044#(= main_~i~0 15), 35045#(= main_~i~0 16), 35046#(= main_~i~0 17), 35047#(= main_~i~0 18), 35048#(= main_~i~0 19), 35049#(= main_~i~0 20), 35050#(= main_~i~0 21), 35051#(= main_~i~0 22), 35052#(= main_~i~0 23), 35053#(= main_~i~0 24), 35054#(= main_~i~0 25), 35055#(= main_~i~0 26), 35056#(= main_~i~0 27), 35057#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:36,224 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 04:24:36,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:24:36,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:24:36,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:24:36,224 INFO L87 Difference]: Start difference. First operand 247 states and 288 transitions. Second operand 31 states. [2018-02-04 04:24:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:37,292 INFO L93 Difference]: Finished difference Result 2817 states and 3264 transitions. [2018-02-04 04:24:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:24:37,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-02-04 04:24:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:37,298 INFO L225 Difference]: With dead ends: 2817 [2018-02-04 04:24:37,298 INFO L226 Difference]: Without dead ends: 2817 [2018-02-04 04:24:37,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:24:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-02-04 04:24:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 252. [2018-02-04 04:24:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 04:24:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 294 transitions. [2018-02-04 04:24:37,309 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 294 transitions. Word has length 147 [2018-02-04 04:24:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:37,309 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 294 transitions. [2018-02-04 04:24:37,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:24:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 294 transitions. [2018-02-04 04:24:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 04:24:37,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:37,310 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:37,310 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:37,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:37,557 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 04:24:37,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:37,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 04:24:37,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:37,573 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 04:24:37,573 INFO L182 omatonBuilderFactory]: Interpolants [38144#(= main_~i~0 13), 38145#(= main_~i~0 14), 38146#(= main_~i~0 15), 38147#(= main_~i~0 16), 38148#(= main_~i~0 17), 38149#(= main_~i~0 18), 38150#(= main_~i~0 19), 38151#(= main_~i~0 20), 38152#(= main_~i~0 21), 38153#(= main_~i~0 22), 38154#(= main_~i~0 23), 38155#(= main_~i~0 24), 38156#(= main_~i~0 25), 38157#(= main_~i~0 26), 38158#(= main_~i~0 27), 38159#(= main_~i~0 28), 38160#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 38127#true, 38128#false, 38131#(= main_~i~0 0), 38132#(= main_~i~0 1), 38133#(= main_~i~0 2), 38134#(= main_~i~0 3), 38135#(= main_~i~0 4), 38136#(= main_~i~0 5), 38137#(= main_~i~0 6), 38138#(= main_~i~0 7), 38139#(= main_~i~0 8), 38140#(= main_~i~0 9), 38141#(= main_~i~0 10), 38142#(= main_~i~0 11), 38143#(= main_~i~0 12)] [2018-02-04 04:24:37,573 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 04:24:37,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:24:37,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:24:37,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:24:37,574 INFO L87 Difference]: Start difference. First operand 252 states and 294 transitions. Second operand 32 states. [2018-02-04 04:24:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:38,752 INFO L93 Difference]: Finished difference Result 2917 states and 3380 transitions. [2018-02-04 04:24:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:24:38,753 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 152 [2018-02-04 04:24:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:38,756 INFO L225 Difference]: With dead ends: 2917 [2018-02-04 04:24:38,756 INFO L226 Difference]: Without dead ends: 2917 [2018-02-04 04:24:38,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:24:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2018-02-04 04:24:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 257. [2018-02-04 04:24:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-04 04:24:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2018-02-04 04:24:38,766 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 152 [2018-02-04 04:24:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:38,766 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2018-02-04 04:24:38,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:24:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2018-02-04 04:24:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:24:38,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:38,767 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:38,767 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1650416255, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:38,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-02-04 04:24:38,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:38,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 04:24:38,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-02-04 04:24:38,892 INFO L182 omatonBuilderFactory]: Interpolants [41344#(= 1 main_~x~0), 41409#(= main_~x~0 14), 41379#(= main_~x~0 8), 41349#(= main_~x~0 2), 41414#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 41384#(= main_~x~0 9), 41354#(= main_~x~0 3), 41389#(= main_~x~0 10), 41359#(= main_~x~0 4), 41394#(= main_~x~0 11), 41364#(= main_~x~0 5), 41335#true, 41399#(= main_~x~0 12), 41336#false, 41369#(= main_~x~0 6), 41339#(= 0 main_~x~0), 41404#(= main_~x~0 13), 41374#(= main_~x~0 7)] [2018-02-04 04:24:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-02-04 04:24:38,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:24:38,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:24:38,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:24:38,892 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 18 states. [2018-02-04 04:24:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:39,155 INFO L93 Difference]: Finished difference Result 263 states and 307 transitions. [2018-02-04 04:24:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:24:39,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2018-02-04 04:24:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:39,156 INFO L225 Difference]: With dead ends: 263 [2018-02-04 04:24:39,156 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 04:24:39,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:24:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 04:24:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-04 04:24:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 04:24:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 307 transitions. [2018-02-04 04:24:39,160 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 307 transitions. Word has length 167 [2018-02-04 04:24:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:39,160 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 307 transitions. [2018-02-04 04:24:39,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:24:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 307 transitions. [2018-02-04 04:24:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:24:39,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:39,161 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:39,161 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 04:24:39,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:39,498 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 04:24:39,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:39,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 04:24:39,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:39,514 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 04:24:39,514 INFO L182 omatonBuilderFactory]: Interpolants [41941#true, 41942#false, 41945#(= main_~i~0 0), 41946#(= main_~i~0 1), 41947#(= main_~i~0 2), 41948#(= main_~i~0 3), 41949#(= main_~i~0 4), 41950#(= main_~i~0 5), 41951#(= main_~i~0 6), 41952#(= main_~i~0 7), 41953#(= main_~i~0 8), 41954#(= main_~i~0 9), 41955#(= main_~i~0 10), 41956#(= main_~i~0 11), 41957#(= main_~i~0 12), 41958#(= main_~i~0 13), 41959#(= main_~i~0 14), 41960#(= main_~i~0 15), 41961#(= main_~i~0 16), 41962#(= main_~i~0 17), 41963#(= main_~i~0 18), 41964#(= main_~i~0 19), 41965#(= main_~i~0 20), 41966#(= main_~i~0 21), 41967#(= main_~i~0 22), 41968#(= main_~i~0 23), 41969#(= main_~i~0 24), 41970#(= main_~i~0 25), 41971#(= main_~i~0 26), 41972#(= main_~i~0 27), 41973#(= main_~i~0 28), 41974#(= main_~i~0 29), 41975#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:39,514 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 04:24:39,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:24:39,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:24:39,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:24:39,515 INFO L87 Difference]: Start difference. First operand 263 states and 307 transitions. Second operand 33 states. [2018-02-04 04:24:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:40,851 INFO L93 Difference]: Finished difference Result 3197 states and 3706 transitions. [2018-02-04 04:24:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:24:40,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2018-02-04 04:24:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:40,857 INFO L225 Difference]: With dead ends: 3197 [2018-02-04 04:24:40,857 INFO L226 Difference]: Without dead ends: 3197 [2018-02-04 04:24:40,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:24:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-02-04 04:24:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 268. [2018-02-04 04:24:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 04:24:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 313 transitions. [2018-02-04 04:24:40,877 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 313 transitions. Word has length 157 [2018-02-04 04:24:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:40,877 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 313 transitions. [2018-02-04 04:24:40,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:24:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 313 transitions. [2018-02-04 04:24:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:24:40,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:40,879 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:40,879 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 654941499, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:40,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-04 04:24:41,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:41,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 04:24:41,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-02-04 04:24:41,046 INFO L182 omatonBuilderFactory]: Interpolants [45441#true, 45505#(= main_~x~0 12), 45442#false, 45475#(= main_~x~0 6), 45445#(= 0 main_~x~0), 45510#(= main_~x~0 13), 45480#(= main_~x~0 7), 45450#(= 1 main_~x~0), 45515#(= main_~x~0 14), 45485#(= main_~x~0 8), 45455#(= main_~x~0 2), 45520#(= main_~x~0 15), 45490#(= main_~x~0 9), 45460#(= main_~x~0 3), 45525#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 45495#(= main_~x~0 10), 45465#(= main_~x~0 4), 45500#(= main_~x~0 11), 45470#(= main_~x~0 5)] [2018-02-04 04:24:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 768 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-04 04:24:41,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:24:41,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:24:41,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:24:41,047 INFO L87 Difference]: Start difference. First operand 268 states and 313 transitions. Second operand 19 states. [2018-02-04 04:24:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:41,350 INFO L93 Difference]: Finished difference Result 274 states and 320 transitions. [2018-02-04 04:24:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:24:41,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 177 [2018-02-04 04:24:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:41,351 INFO L225 Difference]: With dead ends: 274 [2018-02-04 04:24:41,351 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 04:24:41,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:24:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 04:24:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-02-04 04:24:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 04:24:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 320 transitions. [2018-02-04 04:24:41,353 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 320 transitions. Word has length 177 [2018-02-04 04:24:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:41,354 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 320 transitions. [2018-02-04 04:24:41,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:24:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 320 transitions. [2018-02-04 04:24:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 04:24:41,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:41,354 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:41,354 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:41,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:41,746 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 04:24:41,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:41,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 04:24:41,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:41,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 04:24:41,776 INFO L182 omatonBuilderFactory]: Interpolants [46080#(= main_~i~0 2), 46081#(= main_~i~0 3), 46082#(= main_~i~0 4), 46083#(= main_~i~0 5), 46084#(= main_~i~0 6), 46085#(= main_~i~0 7), 46086#(= main_~i~0 8), 46087#(= main_~i~0 9), 46088#(= main_~i~0 10), 46089#(= main_~i~0 11), 46090#(= main_~i~0 12), 46091#(= main_~i~0 13), 46092#(= main_~i~0 14), 46093#(= main_~i~0 15), 46094#(= main_~i~0 16), 46095#(= main_~i~0 17), 46096#(= main_~i~0 18), 46097#(= main_~i~0 19), 46098#(= main_~i~0 20), 46099#(= main_~i~0 21), 46100#(= main_~i~0 22), 46101#(= main_~i~0 23), 46102#(= main_~i~0 24), 46103#(= main_~i~0 25), 46104#(= main_~i~0 26), 46105#(= main_~i~0 27), 46106#(= main_~i~0 28), 46107#(= main_~i~0 29), 46108#(= main_~i~0 30), 46109#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 46074#true, 46075#false, 46078#(= main_~i~0 0), 46079#(= main_~i~0 1)] [2018-02-04 04:24:41,776 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 04:24:41,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 04:24:41,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 04:24:41,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:24:41,776 INFO L87 Difference]: Start difference. First operand 274 states and 320 transitions. Second operand 34 states. [2018-02-04 04:24:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:43,100 INFO L93 Difference]: Finished difference Result 3489 states and 4046 transitions. [2018-02-04 04:24:43,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:24:43,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2018-02-04 04:24:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:43,114 INFO L225 Difference]: With dead ends: 3489 [2018-02-04 04:24:43,114 INFO L226 Difference]: Without dead ends: 3489 [2018-02-04 04:24:43,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:24:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2018-02-04 04:24:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 279. [2018-02-04 04:24:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 04:24:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 326 transitions. [2018-02-04 04:24:43,136 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 326 transitions. Word has length 162 [2018-02-04 04:24:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:43,136 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 326 transitions. [2018-02-04 04:24:43,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 04:24:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 326 transitions. [2018-02-04 04:24:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:24:43,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:43,138 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:43,138 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:43,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:43,557 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 04:24:43,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:43,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 04:24:43,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:43,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 04:24:43,574 INFO L182 omatonBuilderFactory]: Interpolants [49878#true, 49879#false, 49882#(= main_~i~0 0), 49883#(= main_~i~0 1), 49884#(= main_~i~0 2), 49885#(= main_~i~0 3), 49886#(= main_~i~0 4), 49887#(= main_~i~0 5), 49888#(= main_~i~0 6), 49889#(= main_~i~0 7), 49890#(= main_~i~0 8), 49891#(= main_~i~0 9), 49892#(= main_~i~0 10), 49893#(= main_~i~0 11), 49894#(= main_~i~0 12), 49895#(= main_~i~0 13), 49896#(= main_~i~0 14), 49897#(= main_~i~0 15), 49898#(= main_~i~0 16), 49899#(= main_~i~0 17), 49900#(= main_~i~0 18), 49901#(= main_~i~0 19), 49902#(= main_~i~0 20), 49903#(= main_~i~0 21), 49904#(= main_~i~0 22), 49905#(= main_~i~0 23), 49906#(= main_~i~0 24), 49907#(= main_~i~0 25), 49908#(= main_~i~0 26), 49909#(= main_~i~0 27), 49910#(= main_~i~0 28), 49911#(= main_~i~0 29), 49912#(= main_~i~0 30), 49913#(= main_~i~0 31), 49914#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:43,574 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 04:24:43,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:24:43,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:24:43,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:24:43,575 INFO L87 Difference]: Start difference. First operand 279 states and 326 transitions. Second operand 35 states. [2018-02-04 04:24:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:45,003 INFO L93 Difference]: Finished difference Result 3601 states and 4176 transitions. [2018-02-04 04:24:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:24:45,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 04:24:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:45,017 INFO L225 Difference]: With dead ends: 3601 [2018-02-04 04:24:45,017 INFO L226 Difference]: Without dead ends: 3601 [2018-02-04 04:24:45,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:24:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2018-02-04 04:24:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 284. [2018-02-04 04:24:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:24:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2018-02-04 04:24:45,039 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 167 [2018-02-04 04:24:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:45,039 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2018-02-04 04:24:45,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:24:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2018-02-04 04:24:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:24:45,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:45,040 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:45,040 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -451693451, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:45,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-02-04 04:24:45,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:45,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 04:24:45,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-02-04 04:24:45,282 INFO L182 omatonBuilderFactory]: Interpolants [53824#(= main_~x~0 4), 53889#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 53859#(= main_~x~0 11), 53829#(= main_~x~0 5), 53800#true, 53864#(= main_~x~0 12), 53801#false, 53834#(= main_~x~0 6), 53804#(= 0 main_~x~0), 53869#(= main_~x~0 13), 53839#(= main_~x~0 7), 53809#(= 1 main_~x~0), 53874#(= main_~x~0 14), 53844#(= main_~x~0 8), 53814#(= main_~x~0 2), 53879#(= main_~x~0 15), 53849#(= main_~x~0 9), 53819#(= main_~x~0 3), 53884#(= main_~x~0 16), 53854#(= main_~x~0 10)] [2018-02-04 04:24:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 867 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-02-04 04:24:45,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:24:45,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:24:45,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:24:45,283 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand 20 states. [2018-02-04 04:24:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:45,613 INFO L93 Difference]: Finished difference Result 290 states and 339 transitions. [2018-02-04 04:24:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:24:45,613 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 187 [2018-02-04 04:24:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:45,614 INFO L225 Difference]: With dead ends: 290 [2018-02-04 04:24:45,614 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 04:24:45,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:24:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 04:24:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-02-04 04:24:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 04:24:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2018-02-04 04:24:45,617 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 187 [2018-02-04 04:24:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:45,618 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2018-02-04 04:24:45,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:24:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2018-02-04 04:24:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 04:24:45,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:45,619 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:45,619 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-04 04:24:45,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:46,000 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 04:24:46,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:46,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 04:24:46,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:24:46,016 INFO L182 omatonBuilderFactory]: Interpolants [54470#true, 54471#false, 54474#(= main_~i~0 0), 54475#(= main_~i~0 1), 54476#(= main_~i~0 2), 54477#(= main_~i~0 3), 54478#(= main_~i~0 4), 54479#(= main_~i~0 5), 54480#(= main_~i~0 6), 54481#(= main_~i~0 7), 54482#(= main_~i~0 8), 54483#(= main_~i~0 9), 54484#(= main_~i~0 10), 54485#(= main_~i~0 11), 54486#(= main_~i~0 12), 54487#(= main_~i~0 13), 54488#(= main_~i~0 14), 54489#(= main_~i~0 15), 54490#(= main_~i~0 16), 54491#(= main_~i~0 17), 54492#(= main_~i~0 18), 54493#(= main_~i~0 19), 54494#(= main_~i~0 20), 54495#(= main_~i~0 21), 54496#(= main_~i~0 22), 54497#(= main_~i~0 23), 54498#(= main_~i~0 24), 54499#(= main_~i~0 25), 54500#(= main_~i~0 26), 54501#(= main_~i~0 27), 54502#(= main_~i~0 28), 54503#(= main_~i~0 29), 54504#(= main_~i~0 30), 54505#(= main_~i~0 31), 54506#(= main_~i~0 32), 54507#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:24:46,016 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 04:24:46,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 04:24:46,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 04:24:46,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:24:46,017 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand 36 states. [2018-02-04 04:24:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:47,464 INFO L93 Difference]: Finished difference Result 3911 states and 4537 transitions. [2018-02-04 04:24:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:24:47,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 172 [2018-02-04 04:24:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:47,496 INFO L225 Difference]: With dead ends: 3911 [2018-02-04 04:24:47,496 INFO L226 Difference]: Without dead ends: 3911 [2018-02-04 04:24:47,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:24:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2018-02-04 04:24:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 295. [2018-02-04 04:24:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 04:24:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2018-02-04 04:24:47,512 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 172 [2018-02-04 04:24:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:47,512 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2018-02-04 04:24:47,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 04:24:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2018-02-04 04:24:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:24:47,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:47,513 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:47,513 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:47,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:47,860 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 04:24:47,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:47,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 04:24:47,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:47,876 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 04:24:47,876 INFO L182 omatonBuilderFactory]: Interpolants [58752#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 58714#true, 58715#false, 58718#(= main_~i~0 0), 58719#(= main_~i~0 1), 58720#(= main_~i~0 2), 58721#(= main_~i~0 3), 58722#(= main_~i~0 4), 58723#(= main_~i~0 5), 58724#(= main_~i~0 6), 58725#(= main_~i~0 7), 58726#(= main_~i~0 8), 58727#(= main_~i~0 9), 58728#(= main_~i~0 10), 58729#(= main_~i~0 11), 58730#(= main_~i~0 12), 58731#(= main_~i~0 13), 58732#(= main_~i~0 14), 58733#(= main_~i~0 15), 58734#(= main_~i~0 16), 58735#(= main_~i~0 17), 58736#(= main_~i~0 18), 58737#(= main_~i~0 19), 58738#(= main_~i~0 20), 58739#(= main_~i~0 21), 58740#(= main_~i~0 22), 58741#(= main_~i~0 23), 58742#(= main_~i~0 24), 58743#(= main_~i~0 25), 58744#(= main_~i~0 26), 58745#(= main_~i~0 27), 58746#(= main_~i~0 28), 58747#(= main_~i~0 29), 58748#(= main_~i~0 30), 58749#(= main_~i~0 31), 58750#(= main_~i~0 32), 58751#(= main_~i~0 33)] [2018-02-04 04:24:47,876 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 04:24:47,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:24:47,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:24:47,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:24:47,877 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand 37 states. [2018-02-04 04:24:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:49,427 INFO L93 Difference]: Finished difference Result 4029 states and 4674 transitions. [2018-02-04 04:24:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:24:49,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 177 [2018-02-04 04:24:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:49,430 INFO L225 Difference]: With dead ends: 4029 [2018-02-04 04:24:49,430 INFO L226 Difference]: Without dead ends: 4029 [2018-02-04 04:24:49,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:24:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2018-02-04 04:24:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 300. [2018-02-04 04:24:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-04 04:24:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 351 transitions. [2018-02-04 04:24:49,443 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 351 transitions. Word has length 177 [2018-02-04 04:24:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:49,444 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 351 transitions. [2018-02-04 04:24:49,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:24:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 351 transitions. [2018-02-04 04:24:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:24:49,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:49,444 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:49,444 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1719503663, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:49,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-02-04 04:24:49,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:49,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 04:24:49,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-02-04 04:24:49,636 INFO L182 omatonBuilderFactory]: Interpolants [63136#(= main_~x~0 10), 63106#(= main_~x~0 4), 63171#(= main_~x~0 17), 63141#(= main_~x~0 11), 63111#(= main_~x~0 5), 63176#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 63082#true, 63146#(= main_~x~0 12), 63083#false, 63116#(= main_~x~0 6), 63086#(= 0 main_~x~0), 63151#(= main_~x~0 13), 63121#(= main_~x~0 7), 63091#(= 1 main_~x~0), 63156#(= main_~x~0 14), 63126#(= main_~x~0 8), 63096#(= main_~x~0 2), 63161#(= main_~x~0 15), 63131#(= main_~x~0 9), 63101#(= main_~x~0 3), 63166#(= main_~x~0 16)] [2018-02-04 04:24:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-02-04 04:24:49,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:24:49,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:24:49,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:24:49,636 INFO L87 Difference]: Start difference. First operand 300 states and 351 transitions. Second operand 21 states. [2018-02-04 04:24:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:50,001 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2018-02-04 04:24:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:24:50,001 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 197 [2018-02-04 04:24:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:50,002 INFO L225 Difference]: With dead ends: 306 [2018-02-04 04:24:50,002 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 04:24:50,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:24:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 04:24:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-02-04 04:24:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-04 04:24:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2018-02-04 04:24:50,004 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 197 [2018-02-04 04:24:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:50,004 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2018-02-04 04:24:50,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:24:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2018-02-04 04:24:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:24:50,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:50,005 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:50,005 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:50,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:50,328 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 04:24:50,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:50,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 04:24:50,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:50,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 04:24:50,345 INFO L182 omatonBuilderFactory]: Interpolants [63808#(= main_~i~0 15), 63809#(= main_~i~0 16), 63810#(= main_~i~0 17), 63811#(= main_~i~0 18), 63812#(= main_~i~0 19), 63813#(= main_~i~0 20), 63814#(= main_~i~0 21), 63815#(= main_~i~0 22), 63816#(= main_~i~0 23), 63817#(= main_~i~0 24), 63818#(= main_~i~0 25), 63819#(= main_~i~0 26), 63820#(= main_~i~0 27), 63821#(= main_~i~0 28), 63822#(= main_~i~0 29), 63823#(= main_~i~0 30), 63824#(= main_~i~0 31), 63825#(= main_~i~0 32), 63826#(= main_~i~0 33), 63827#(= main_~i~0 34), 63828#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 63789#true, 63790#false, 63793#(= main_~i~0 0), 63794#(= main_~i~0 1), 63795#(= main_~i~0 2), 63796#(= main_~i~0 3), 63797#(= main_~i~0 4), 63798#(= main_~i~0 5), 63799#(= main_~i~0 6), 63800#(= main_~i~0 7), 63801#(= main_~i~0 8), 63802#(= main_~i~0 9), 63803#(= main_~i~0 10), 63804#(= main_~i~0 11), 63805#(= main_~i~0 12), 63806#(= main_~i~0 13), 63807#(= main_~i~0 14)] [2018-02-04 04:24:50,345 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 04:24:50,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:24:50,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:24:50,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:24:50,345 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand 38 states. [2018-02-04 04:24:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:52,006 INFO L93 Difference]: Finished difference Result 4357 states and 5056 transitions. [2018-02-04 04:24:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:24:52,006 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 182 [2018-02-04 04:24:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:52,010 INFO L225 Difference]: With dead ends: 4357 [2018-02-04 04:24:52,010 INFO L226 Difference]: Without dead ends: 4357 [2018-02-04 04:24:52,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:24:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2018-02-04 04:24:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 311. [2018-02-04 04:24:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 04:24:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 364 transitions. [2018-02-04 04:24:52,032 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 364 transitions. Word has length 182 [2018-02-04 04:24:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:52,032 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 364 transitions. [2018-02-04 04:24:52,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:24:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 364 transitions. [2018-02-04 04:24:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:24:52,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:52,032 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:52,033 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:52,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:52,401 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 04:24:52,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:52,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 04:24:52,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:52,417 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 04:24:52,417 INFO L182 omatonBuilderFactory]: Interpolants [68497#true, 68498#false, 68501#(= main_~i~0 0), 68503#(= main_~i~0 2), 68502#(= main_~i~0 1), 68505#(= main_~i~0 4), 68504#(= main_~i~0 3), 68507#(= main_~i~0 6), 68506#(= main_~i~0 5), 68509#(= main_~i~0 8), 68508#(= main_~i~0 7), 68511#(= main_~i~0 10), 68510#(= main_~i~0 9), 68513#(= main_~i~0 12), 68512#(= main_~i~0 11), 68515#(= main_~i~0 14), 68514#(= main_~i~0 13), 68517#(= main_~i~0 16), 68516#(= main_~i~0 15), 68519#(= main_~i~0 18), 68518#(= main_~i~0 17), 68521#(= main_~i~0 20), 68520#(= main_~i~0 19), 68523#(= main_~i~0 22), 68522#(= main_~i~0 21), 68525#(= main_~i~0 24), 68524#(= main_~i~0 23), 68527#(= main_~i~0 26), 68526#(= main_~i~0 25), 68529#(= main_~i~0 28), 68528#(= main_~i~0 27), 68531#(= main_~i~0 30), 68530#(= main_~i~0 29), 68533#(= main_~i~0 32), 68532#(= main_~i~0 31), 68535#(= main_~i~0 34), 68534#(= main_~i~0 33), 68537#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 68536#(= main_~i~0 35)] [2018-02-04 04:24:52,418 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 04:24:52,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:24:52,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:24:52,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:24:52,418 INFO L87 Difference]: Start difference. First operand 311 states and 364 transitions. Second operand 39 states. [2018-02-04 04:24:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:54,220 INFO L93 Difference]: Finished difference Result 4481 states and 5200 transitions. [2018-02-04 04:24:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:24:54,220 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 187 [2018-02-04 04:24:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:54,223 INFO L225 Difference]: With dead ends: 4481 [2018-02-04 04:24:54,223 INFO L226 Difference]: Without dead ends: 4481 [2018-02-04 04:24:54,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:24:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2018-02-04 04:24:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 316. [2018-02-04 04:24:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 04:24:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 370 transitions. [2018-02-04 04:24:54,238 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 370 transitions. Word has length 187 [2018-02-04 04:24:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:54,239 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 370 transitions. [2018-02-04 04:24:54,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:24:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 370 transitions. [2018-02-04 04:24:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:24:54,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:54,239 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:54,239 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1413333353, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:54,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-02-04 04:24:54,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:54,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 04:24:54,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-02-04 04:24:54,427 INFO L182 omatonBuilderFactory]: Interpolants [73409#(= main_~x~0 14), 73344#(= 1 main_~x~0), 73379#(= main_~x~0 8), 73349#(= main_~x~0 2), 73414#(= main_~x~0 15), 73384#(= main_~x~0 9), 73419#(= main_~x~0 16), 73354#(= main_~x~0 3), 73389#(= main_~x~0 10), 73359#(= main_~x~0 4), 73424#(= main_~x~0 17), 73394#(= main_~x~0 11), 73429#(= main_~x~0 18), 73364#(= main_~x~0 5), 73335#true, 73399#(= main_~x~0 12), 73369#(= main_~x~0 6), 73336#false, 73339#(= 0 main_~x~0), 73434#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 73404#(= main_~x~0 13), 73374#(= main_~x~0 7)] [2018-02-04 04:24:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1083 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-02-04 04:24:54,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:24:54,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:24:54,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:24:54,428 INFO L87 Difference]: Start difference. First operand 316 states and 370 transitions. Second operand 22 states. [2018-02-04 04:24:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:54,937 INFO L93 Difference]: Finished difference Result 322 states and 377 transitions. [2018-02-04 04:24:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:24:54,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 207 [2018-02-04 04:24:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:54,938 INFO L225 Difference]: With dead ends: 322 [2018-02-04 04:24:54,938 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 04:24:54,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:24:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 04:24:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-02-04 04:24:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-04 04:24:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 377 transitions. [2018-02-04 04:24:54,941 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 377 transitions. Word has length 207 [2018-02-04 04:24:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:54,942 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 377 transitions. [2018-02-04 04:24:54,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:24:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 377 transitions. [2018-02-04 04:24:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:24:54,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:54,943 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:54,943 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:54,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:55,416 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 04:24:55,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:55,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 04:24:55,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:55,432 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 04:24:55,432 INFO L182 omatonBuilderFactory]: Interpolants [74113#(= main_~i~0 30), 74112#(= main_~i~0 29), 74115#(= main_~i~0 32), 74114#(= main_~i~0 31), 74117#(= main_~i~0 34), 74116#(= main_~i~0 33), 74119#(= main_~i~0 36), 74118#(= main_~i~0 35), 74120#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 74079#true, 74080#false, 74083#(= main_~i~0 0), 74085#(= main_~i~0 2), 74084#(= main_~i~0 1), 74087#(= main_~i~0 4), 74086#(= main_~i~0 3), 74089#(= main_~i~0 6), 74088#(= main_~i~0 5), 74091#(= main_~i~0 8), 74090#(= main_~i~0 7), 74093#(= main_~i~0 10), 74092#(= main_~i~0 9), 74095#(= main_~i~0 12), 74094#(= main_~i~0 11), 74097#(= main_~i~0 14), 74096#(= main_~i~0 13), 74099#(= main_~i~0 16), 74098#(= main_~i~0 15), 74101#(= main_~i~0 18), 74100#(= main_~i~0 17), 74103#(= main_~i~0 20), 74102#(= main_~i~0 19), 74105#(= main_~i~0 22), 74104#(= main_~i~0 21), 74107#(= main_~i~0 24), 74106#(= main_~i~0 23), 74109#(= main_~i~0 26), 74108#(= main_~i~0 25), 74111#(= main_~i~0 28), 74110#(= main_~i~0 27)] [2018-02-04 04:24:55,433 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 04:24:55,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 04:24:55,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 04:24:55,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:24:55,433 INFO L87 Difference]: Start difference. First operand 322 states and 377 transitions. Second operand 40 states. [2018-02-04 04:24:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:57,306 INFO L93 Difference]: Finished difference Result 4827 states and 5603 transitions. [2018-02-04 04:24:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:24:57,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 192 [2018-02-04 04:24:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:57,309 INFO L225 Difference]: With dead ends: 4827 [2018-02-04 04:24:57,310 INFO L226 Difference]: Without dead ends: 4827 [2018-02-04 04:24:57,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:24:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2018-02-04 04:24:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 327. [2018-02-04 04:24:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 04:24:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 383 transitions. [2018-02-04 04:24:57,326 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 383 transitions. Word has length 192 [2018-02-04 04:24:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:57,326 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 383 transitions. [2018-02-04 04:24:57,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 04:24:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 383 transitions. [2018-02-04 04:24:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:24:57,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:57,327 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:57,327 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:57,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:57,722 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 04:24:57,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:57,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 04:24:57,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:57,738 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 04:24:57,738 INFO L182 omatonBuilderFactory]: Interpolants [79297#(= main_~i~0 18), 79296#(= main_~i~0 17), 79299#(= main_~i~0 20), 79298#(= main_~i~0 19), 79301#(= main_~i~0 22), 79300#(= main_~i~0 21), 79303#(= main_~i~0 24), 79302#(= main_~i~0 23), 79305#(= main_~i~0 26), 79304#(= main_~i~0 25), 79307#(= main_~i~0 28), 79306#(= main_~i~0 27), 79309#(= main_~i~0 30), 79308#(= main_~i~0 29), 79311#(= main_~i~0 32), 79310#(= main_~i~0 31), 79313#(= main_~i~0 34), 79312#(= main_~i~0 33), 79315#(= main_~i~0 36), 79314#(= main_~i~0 35), 79317#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 79316#(= main_~i~0 37), 79275#true, 79276#false, 79279#(= main_~i~0 0), 79281#(= main_~i~0 2), 79280#(= main_~i~0 1), 79283#(= main_~i~0 4), 79282#(= main_~i~0 3), 79285#(= main_~i~0 6), 79284#(= main_~i~0 5), 79287#(= main_~i~0 8), 79286#(= main_~i~0 7), 79289#(= main_~i~0 10), 79288#(= main_~i~0 9), 79291#(= main_~i~0 12), 79290#(= main_~i~0 11), 79293#(= main_~i~0 14), 79292#(= main_~i~0 13), 79295#(= main_~i~0 16), 79294#(= main_~i~0 15)] [2018-02-04 04:24:57,738 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 04:24:57,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:24:57,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:24:57,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:24:57,738 INFO L87 Difference]: Start difference. First operand 327 states and 383 transitions. Second operand 41 states. [2018-02-04 04:24:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:24:59,655 INFO L93 Difference]: Finished difference Result 4957 states and 5754 transitions. [2018-02-04 04:24:59,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:24:59,656 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 197 [2018-02-04 04:24:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:24:59,659 INFO L225 Difference]: With dead ends: 4957 [2018-02-04 04:24:59,659 INFO L226 Difference]: Without dead ends: 4957 [2018-02-04 04:24:59,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:24:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2018-02-04 04:24:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 332. [2018-02-04 04:24:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-02-04 04:24:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 389 transitions. [2018-02-04 04:24:59,685 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 389 transitions. Word has length 197 [2018-02-04 04:24:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:24:59,685 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 389 transitions. [2018-02-04 04:24:59,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:24:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 389 transitions. [2018-02-04 04:24:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 04:24:59,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:24:59,686 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:24:59,686 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:24:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash 193132323, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:24:59,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:24:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:24:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-02-04 04:24:59,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:24:59,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 04:24:59,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:24:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-02-04 04:24:59,901 INFO L182 omatonBuilderFactory]: Interpolants [84641#(= main_~x~0 6), 84608#false, 84611#(= 0 main_~x~0), 84706#(= main_~x~0 19), 84676#(= main_~x~0 13), 84711#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 84646#(= main_~x~0 7), 84681#(= main_~x~0 14), 84616#(= 1 main_~x~0), 84651#(= main_~x~0 8), 84621#(= main_~x~0 2), 84686#(= main_~x~0 15), 84656#(= main_~x~0 9), 84691#(= main_~x~0 16), 84626#(= main_~x~0 3), 84661#(= main_~x~0 10), 84631#(= main_~x~0 4), 84696#(= main_~x~0 17), 84666#(= main_~x~0 11), 84701#(= main_~x~0 18), 84636#(= main_~x~0 5), 84607#true, 84671#(= main_~x~0 12)] [2018-02-04 04:24:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-02-04 04:24:59,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:24:59,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:24:59,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:24:59,902 INFO L87 Difference]: Start difference. First operand 332 states and 389 transitions. Second operand 23 states. [2018-02-04 04:25:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:00,340 INFO L93 Difference]: Finished difference Result 338 states and 396 transitions. [2018-02-04 04:25:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:25:00,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 217 [2018-02-04 04:25:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:00,341 INFO L225 Difference]: With dead ends: 338 [2018-02-04 04:25:00,341 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 04:25:00,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:25:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 04:25:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-04 04:25:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 04:25:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 396 transitions. [2018-02-04 04:25:00,343 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 396 transitions. Word has length 217 [2018-02-04 04:25:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:00,343 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 396 transitions. [2018-02-04 04:25:00,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:25:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 396 transitions. [2018-02-04 04:25:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:25:00,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:00,344 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:00,344 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:00,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:00,848 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 04:25:00,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:00,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 04:25:00,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:00,865 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 04:25:00,865 INFO L182 omatonBuilderFactory]: Interpolants [85389#false, 85388#true, 85393#(= main_~i~0 1), 85392#(= main_~i~0 0), 85395#(= main_~i~0 3), 85394#(= main_~i~0 2), 85397#(= main_~i~0 5), 85396#(= main_~i~0 4), 85399#(= main_~i~0 7), 85398#(= main_~i~0 6), 85401#(= main_~i~0 9), 85400#(= main_~i~0 8), 85403#(= main_~i~0 11), 85402#(= main_~i~0 10), 85405#(= main_~i~0 13), 85404#(= main_~i~0 12), 85407#(= main_~i~0 15), 85406#(= main_~i~0 14), 85409#(= main_~i~0 17), 85408#(= main_~i~0 16), 85411#(= main_~i~0 19), 85410#(= main_~i~0 18), 85413#(= main_~i~0 21), 85412#(= main_~i~0 20), 85415#(= main_~i~0 23), 85414#(= main_~i~0 22), 85417#(= main_~i~0 25), 85416#(= main_~i~0 24), 85419#(= main_~i~0 27), 85418#(= main_~i~0 26), 85421#(= main_~i~0 29), 85420#(= main_~i~0 28), 85423#(= main_~i~0 31), 85422#(= main_~i~0 30), 85425#(= main_~i~0 33), 85424#(= main_~i~0 32), 85427#(= main_~i~0 35), 85426#(= main_~i~0 34), 85429#(= main_~i~0 37), 85428#(= main_~i~0 36), 85431#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 85430#(= main_~i~0 38)] [2018-02-04 04:25:00,865 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 04:25:00,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:25:00,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:25:00,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:25:00,866 INFO L87 Difference]: Start difference. First operand 338 states and 396 transitions. Second operand 42 states. [2018-02-04 04:25:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:03,214 INFO L93 Difference]: Finished difference Result 5321 states and 6178 transitions. [2018-02-04 04:25:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:25:03,215 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-02-04 04:25:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:03,219 INFO L225 Difference]: With dead ends: 5321 [2018-02-04 04:25:03,219 INFO L226 Difference]: Without dead ends: 5321 [2018-02-04 04:25:03,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:25:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2018-02-04 04:25:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 343. [2018-02-04 04:25:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 04:25:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 402 transitions. [2018-02-04 04:25:03,239 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 402 transitions. Word has length 202 [2018-02-04 04:25:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:03,239 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 402 transitions. [2018-02-04 04:25:03,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:25:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 402 transitions. [2018-02-04 04:25:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:25:03,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:03,240 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:03,241 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1212953507, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:03,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-02-04 04:25:03,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:03,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 04:25:03,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-02-04 04:25:03,420 INFO L182 omatonBuilderFactory]: Interpolants [91105#(= 1 main_~x~0), 91200#(= main_~x~0 20), 91170#(= main_~x~0 14), 91205#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 91140#(= main_~x~0 8), 91175#(= main_~x~0 15), 91110#(= main_~x~0 2), 91145#(= main_~x~0 9), 91115#(= main_~x~0 3), 91180#(= main_~x~0 16), 91150#(= main_~x~0 10), 91185#(= main_~x~0 17), 91120#(= main_~x~0 4), 91155#(= main_~x~0 11), 91125#(= main_~x~0 5), 91190#(= main_~x~0 18), 91097#false, 91096#true, 91160#(= main_~x~0 12), 91195#(= main_~x~0 19), 91130#(= main_~x~0 6), 91165#(= main_~x~0 13), 91100#(= 0 main_~x~0), 91135#(= main_~x~0 7)] [2018-02-04 04:25:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1323 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-02-04 04:25:03,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:25:03,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:25:03,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:25:03,421 INFO L87 Difference]: Start difference. First operand 343 states and 402 transitions. Second operand 24 states. [2018-02-04 04:25:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:03,877 INFO L93 Difference]: Finished difference Result 349 states and 409 transitions. [2018-02-04 04:25:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:25:03,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 227 [2018-02-04 04:25:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:03,878 INFO L225 Difference]: With dead ends: 349 [2018-02-04 04:25:03,878 INFO L226 Difference]: Without dead ends: 349 [2018-02-04 04:25:03,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:25:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-04 04:25:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-02-04 04:25:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-04 04:25:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 409 transitions. [2018-02-04 04:25:03,880 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 409 transitions. Word has length 227 [2018-02-04 04:25:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:03,880 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 409 transitions. [2018-02-04 04:25:03,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:25:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 409 transitions. [2018-02-04 04:25:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:25:03,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:03,881 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:03,881 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:03,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:04,305 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 04:25:04,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:04,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 04:25:04,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:04,321 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 04:25:04,321 INFO L182 omatonBuilderFactory]: Interpolants [91905#false, 91904#true, 91909#(= main_~i~0 1), 91908#(= main_~i~0 0), 91911#(= main_~i~0 3), 91910#(= main_~i~0 2), 91913#(= main_~i~0 5), 91912#(= main_~i~0 4), 91915#(= main_~i~0 7), 91914#(= main_~i~0 6), 91917#(= main_~i~0 9), 91916#(= main_~i~0 8), 91919#(= main_~i~0 11), 91918#(= main_~i~0 10), 91921#(= main_~i~0 13), 91920#(= main_~i~0 12), 91923#(= main_~i~0 15), 91922#(= main_~i~0 14), 91925#(= main_~i~0 17), 91924#(= main_~i~0 16), 91927#(= main_~i~0 19), 91926#(= main_~i~0 18), 91929#(= main_~i~0 21), 91928#(= main_~i~0 20), 91931#(= main_~i~0 23), 91930#(= main_~i~0 22), 91933#(= main_~i~0 25), 91932#(= main_~i~0 24), 91935#(= main_~i~0 27), 91934#(= main_~i~0 26), 91937#(= main_~i~0 29), 91936#(= main_~i~0 28), 91939#(= main_~i~0 31), 91938#(= main_~i~0 30), 91941#(= main_~i~0 33), 91940#(= main_~i~0 32), 91943#(= main_~i~0 35), 91942#(= main_~i~0 34), 91945#(= main_~i~0 37), 91944#(= main_~i~0 36), 91947#(= main_~i~0 39), 91946#(= main_~i~0 38), 91948#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:25:04,321 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 04:25:04,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 04:25:04,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 04:25:04,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:25:04,322 INFO L87 Difference]: Start difference. First operand 349 states and 409 transitions. Second operand 43 states. [2018-02-04 04:25:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:06,434 INFO L93 Difference]: Finished difference Result 5697 states and 6616 transitions. [2018-02-04 04:25:06,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:25:06,435 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 207 [2018-02-04 04:25:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:06,439 INFO L225 Difference]: With dead ends: 5697 [2018-02-04 04:25:06,439 INFO L226 Difference]: Without dead ends: 5697 [2018-02-04 04:25:06,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:25:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2018-02-04 04:25:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 354. [2018-02-04 04:25:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 04:25:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 415 transitions. [2018-02-04 04:25:06,459 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 415 transitions. Word has length 207 [2018-02-04 04:25:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:06,460 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 415 transitions. [2018-02-04 04:25:06,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 04:25:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 415 transitions. [2018-02-04 04:25:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 04:25:06,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:06,461 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:06,461 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:06,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:06,969 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 04:25:06,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:06,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 04:25:06,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:06,986 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 04:25:06,986 INFO L182 omatonBuilderFactory]: Interpolants [98001#false, 98000#true, 98005#(= main_~i~0 1), 98004#(= main_~i~0 0), 98007#(= main_~i~0 3), 98006#(= main_~i~0 2), 98009#(= main_~i~0 5), 98008#(= main_~i~0 4), 98011#(= main_~i~0 7), 98010#(= main_~i~0 6), 98013#(= main_~i~0 9), 98012#(= main_~i~0 8), 98015#(= main_~i~0 11), 98014#(= main_~i~0 10), 98017#(= main_~i~0 13), 98016#(= main_~i~0 12), 98019#(= main_~i~0 15), 98018#(= main_~i~0 14), 98021#(= main_~i~0 17), 98020#(= main_~i~0 16), 98023#(= main_~i~0 19), 98022#(= main_~i~0 18), 98025#(= main_~i~0 21), 98024#(= main_~i~0 20), 98027#(= main_~i~0 23), 98026#(= main_~i~0 22), 98029#(= main_~i~0 25), 98028#(= main_~i~0 24), 98031#(= main_~i~0 27), 98030#(= main_~i~0 26), 98033#(= main_~i~0 29), 98032#(= main_~i~0 28), 98035#(= main_~i~0 31), 98034#(= main_~i~0 30), 98037#(= main_~i~0 33), 98036#(= main_~i~0 32), 98039#(= main_~i~0 35), 98038#(= main_~i~0 34), 98041#(= main_~i~0 37), 98040#(= main_~i~0 36), 98043#(= main_~i~0 39), 98042#(= main_~i~0 38), 98045#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 98044#(= main_~i~0 40)] [2018-02-04 04:25:06,986 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 04:25:06,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:25:06,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:25:06,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:25:06,987 INFO L87 Difference]: Start difference. First operand 354 states and 415 transitions. Second operand 44 states. [2018-02-04 04:25:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:09,397 INFO L93 Difference]: Finished difference Result 5839 states and 6781 transitions. [2018-02-04 04:25:09,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:25:09,398 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-02-04 04:25:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:09,402 INFO L225 Difference]: With dead ends: 5839 [2018-02-04 04:25:09,402 INFO L226 Difference]: Without dead ends: 5839 [2018-02-04 04:25:09,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:25:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2018-02-04 04:25:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 359. [2018-02-04 04:25:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 04:25:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2018-02-04 04:25:09,422 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 212 [2018-02-04 04:25:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:09,423 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2018-02-04 04:25:09,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:25:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2018-02-04 04:25:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:25:09,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:09,423 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:09,424 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash -328277737, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:09,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-02-04 04:25:09,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:09,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 04:25:09,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-02-04 04:25:09,619 INFO L182 omatonBuilderFactory]: Interpolants [104323#(= main_~x~0 15), 104258#(= main_~x~0 2), 104263#(= main_~x~0 3), 104328#(= main_~x~0 16), 104333#(= main_~x~0 17), 104268#(= main_~x~0 4), 104273#(= main_~x~0 5), 104338#(= main_~x~0 18), 104343#(= main_~x~0 19), 104278#(= main_~x~0 6), 104283#(= main_~x~0 7), 104348#(= main_~x~0 20), 104353#(= main_~x~0 21), 104288#(= main_~x~0 8), 104293#(= main_~x~0 9), 104358#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 104298#(= main_~x~0 10), 104303#(= main_~x~0 11), 104245#false, 104244#true, 104308#(= main_~x~0 12), 104313#(= main_~x~0 13), 104248#(= 0 main_~x~0), 104253#(= 1 main_~x~0), 104318#(= main_~x~0 14)] [2018-02-04 04:25:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-02-04 04:25:09,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:25:09,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:25:09,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:25:09,619 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand 25 states. [2018-02-04 04:25:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:10,122 INFO L93 Difference]: Finished difference Result 365 states and 428 transitions. [2018-02-04 04:25:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:25:10,122 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 237 [2018-02-04 04:25:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:10,122 INFO L225 Difference]: With dead ends: 365 [2018-02-04 04:25:10,122 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 04:25:10,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:25:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 04:25:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-02-04 04:25:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 04:25:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 428 transitions. [2018-02-04 04:25:10,125 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 428 transitions. Word has length 237 [2018-02-04 04:25:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:10,125 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 428 transitions. [2018-02-04 04:25:10,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:25:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 428 transitions. [2018-02-04 04:25:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 04:25:10,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:10,126 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:10,126 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:10,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:10,611 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 04:25:10,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:10,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 04:25:10,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:10,627 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 04:25:10,627 INFO L182 omatonBuilderFactory]: Interpolants [105089#true, 105090#false, 105093#(= main_~i~0 0), 105095#(= main_~i~0 2), 105094#(= main_~i~0 1), 105097#(= main_~i~0 4), 105096#(= main_~i~0 3), 105099#(= main_~i~0 6), 105098#(= main_~i~0 5), 105101#(= main_~i~0 8), 105100#(= main_~i~0 7), 105103#(= main_~i~0 10), 105102#(= main_~i~0 9), 105105#(= main_~i~0 12), 105104#(= main_~i~0 11), 105107#(= main_~i~0 14), 105106#(= main_~i~0 13), 105109#(= main_~i~0 16), 105108#(= main_~i~0 15), 105111#(= main_~i~0 18), 105110#(= main_~i~0 17), 105113#(= main_~i~0 20), 105112#(= main_~i~0 19), 105115#(= main_~i~0 22), 105114#(= main_~i~0 21), 105117#(= main_~i~0 24), 105116#(= main_~i~0 23), 105119#(= main_~i~0 26), 105118#(= main_~i~0 25), 105121#(= main_~i~0 28), 105120#(= main_~i~0 27), 105123#(= main_~i~0 30), 105122#(= main_~i~0 29), 105125#(= main_~i~0 32), 105124#(= main_~i~0 31), 105127#(= main_~i~0 34), 105126#(= main_~i~0 33), 105129#(= main_~i~0 36), 105128#(= main_~i~0 35), 105131#(= main_~i~0 38), 105130#(= main_~i~0 37), 105133#(= main_~i~0 40), 105132#(= main_~i~0 39), 105135#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 105134#(= main_~i~0 41)] [2018-02-04 04:25:10,627 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 04:25:10,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:25:10,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:25:10,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:25:10,628 INFO L87 Difference]: Start difference. First operand 365 states and 428 transitions. Second operand 45 states. [2018-02-04 04:25:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:12,938 INFO L93 Difference]: Finished difference Result 6233 states and 7240 transitions. [2018-02-04 04:25:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:25:12,938 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 217 [2018-02-04 04:25:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:12,943 INFO L225 Difference]: With dead ends: 6233 [2018-02-04 04:25:12,943 INFO L226 Difference]: Without dead ends: 6233 [2018-02-04 04:25:12,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:25:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2018-02-04 04:25:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 370. [2018-02-04 04:25:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-04 04:25:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 434 transitions. [2018-02-04 04:25:12,975 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 434 transitions. Word has length 217 [2018-02-04 04:25:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:12,976 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 434 transitions. [2018-02-04 04:25:12,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:25:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 434 transitions. [2018-02-04 04:25:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 04:25:12,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:12,977 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:12,977 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:12,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:13,488 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 04:25:13,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:13,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 04:25:13,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:13,504 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 04:25:13,505 INFO L182 omatonBuilderFactory]: Interpolants [111745#(= main_~i~0 2), 111744#(= main_~i~0 1), 111747#(= main_~i~0 4), 111746#(= main_~i~0 3), 111749#(= main_~i~0 6), 111748#(= main_~i~0 5), 111751#(= main_~i~0 8), 111750#(= main_~i~0 7), 111753#(= main_~i~0 10), 111752#(= main_~i~0 9), 111755#(= main_~i~0 12), 111754#(= main_~i~0 11), 111757#(= main_~i~0 14), 111756#(= main_~i~0 13), 111759#(= main_~i~0 16), 111758#(= main_~i~0 15), 111761#(= main_~i~0 18), 111760#(= main_~i~0 17), 111763#(= main_~i~0 20), 111762#(= main_~i~0 19), 111765#(= main_~i~0 22), 111764#(= main_~i~0 21), 111767#(= main_~i~0 24), 111766#(= main_~i~0 23), 111769#(= main_~i~0 26), 111768#(= main_~i~0 25), 111771#(= main_~i~0 28), 111770#(= main_~i~0 27), 111773#(= main_~i~0 30), 111772#(= main_~i~0 29), 111775#(= main_~i~0 32), 111774#(= main_~i~0 31), 111777#(= main_~i~0 34), 111776#(= main_~i~0 33), 111779#(= main_~i~0 36), 111778#(= main_~i~0 35), 111781#(= main_~i~0 38), 111780#(= main_~i~0 37), 111783#(= main_~i~0 40), 111782#(= main_~i~0 39), 111785#(= main_~i~0 42), 111784#(= main_~i~0 41), 111786#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 111739#true, 111740#false, 111743#(= main_~i~0 0)] [2018-02-04 04:25:13,505 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 04:25:13,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 04:25:13,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 04:25:13,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:25:13,505 INFO L87 Difference]: Start difference. First operand 370 states and 434 transitions. Second operand 46 states. [2018-02-04 04:25:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:15,982 INFO L93 Difference]: Finished difference Result 6381 states and 7412 transitions. [2018-02-04 04:25:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:25:15,983 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 222 [2018-02-04 04:25:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:15,987 INFO L225 Difference]: With dead ends: 6381 [2018-02-04 04:25:15,987 INFO L226 Difference]: Without dead ends: 6381 [2018-02-04 04:25:15,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:25:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2018-02-04 04:25:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 375. [2018-02-04 04:25:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 04:25:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2018-02-04 04:25:16,010 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 222 [2018-02-04 04:25:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:16,011 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2018-02-04 04:25:16,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 04:25:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2018-02-04 04:25:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 04:25:16,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:16,011 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:16,011 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1081420463, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:16,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-02-04 04:25:16,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:16,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 04:25:16,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-02-04 04:25:16,242 INFO L182 omatonBuilderFactory]: Interpolants [118657#(= main_~x~0 22), 118592#(= main_~x~0 9), 118597#(= main_~x~0 10), 118662#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 118602#(= main_~x~0 11), 118543#true, 118607#(= main_~x~0 12), 118544#false, 118547#(= 0 main_~x~0), 118612#(= main_~x~0 13), 118617#(= main_~x~0 14), 118552#(= 1 main_~x~0), 118557#(= main_~x~0 2), 118622#(= main_~x~0 15), 118627#(= main_~x~0 16), 118562#(= main_~x~0 3), 118567#(= main_~x~0 4), 118632#(= main_~x~0 17), 118637#(= main_~x~0 18), 118572#(= main_~x~0 5), 118577#(= main_~x~0 6), 118642#(= main_~x~0 19), 118647#(= main_~x~0 20), 118582#(= main_~x~0 7), 118587#(= main_~x~0 8), 118652#(= main_~x~0 21)] [2018-02-04 04:25:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-02-04 04:25:16,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:25:16,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:25:16,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:25:16,243 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand 26 states. [2018-02-04 04:25:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:16,782 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-02-04 04:25:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:25:16,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 247 [2018-02-04 04:25:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:16,782 INFO L225 Difference]: With dead ends: 381 [2018-02-04 04:25:16,782 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 04:25:16,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:25:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 04:25:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-02-04 04:25:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 04:25:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 447 transitions. [2018-02-04 04:25:16,784 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 447 transitions. Word has length 247 [2018-02-04 04:25:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:16,784 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 447 transitions. [2018-02-04 04:25:16,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:25:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 447 transitions. [2018-02-04 04:25:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:25:16,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:16,785 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:16,785 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:16,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:17,281 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 04:25:17,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:17,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 04:25:17,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:25:17,304 INFO L182 omatonBuilderFactory]: Interpolants [119425#true, 119426#false, 119429#(= main_~i~0 0), 119431#(= main_~i~0 2), 119430#(= main_~i~0 1), 119433#(= main_~i~0 4), 119432#(= main_~i~0 3), 119435#(= main_~i~0 6), 119434#(= main_~i~0 5), 119437#(= main_~i~0 8), 119436#(= main_~i~0 7), 119439#(= main_~i~0 10), 119438#(= main_~i~0 9), 119441#(= main_~i~0 12), 119440#(= main_~i~0 11), 119443#(= main_~i~0 14), 119442#(= main_~i~0 13), 119445#(= main_~i~0 16), 119444#(= main_~i~0 15), 119447#(= main_~i~0 18), 119446#(= main_~i~0 17), 119449#(= main_~i~0 20), 119448#(= main_~i~0 19), 119451#(= main_~i~0 22), 119450#(= main_~i~0 21), 119453#(= main_~i~0 24), 119452#(= main_~i~0 23), 119455#(= main_~i~0 26), 119454#(= main_~i~0 25), 119457#(= main_~i~0 28), 119456#(= main_~i~0 27), 119459#(= main_~i~0 30), 119458#(= main_~i~0 29), 119461#(= main_~i~0 32), 119460#(= main_~i~0 31), 119463#(= main_~i~0 34), 119462#(= main_~i~0 33), 119465#(= main_~i~0 36), 119464#(= main_~i~0 35), 119467#(= main_~i~0 38), 119466#(= main_~i~0 37), 119469#(= main_~i~0 40), 119468#(= main_~i~0 39), 119471#(= main_~i~0 42), 119470#(= main_~i~0 41), 119473#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 119472#(= main_~i~0 43)] [2018-02-04 04:25:17,304 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 04:25:17,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:25:17,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:25:17,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:25:17,305 INFO L87 Difference]: Start difference. First operand 381 states and 447 transitions. Second operand 47 states. [2018-02-04 04:25:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:19,810 INFO L93 Difference]: Finished difference Result 6793 states and 7892 transitions. [2018-02-04 04:25:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:25:19,811 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 227 [2018-02-04 04:25:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:19,816 INFO L225 Difference]: With dead ends: 6793 [2018-02-04 04:25:19,816 INFO L226 Difference]: Without dead ends: 6793 [2018-02-04 04:25:19,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:25:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2018-02-04 04:25:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 386. [2018-02-04 04:25:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 04:25:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 453 transitions. [2018-02-04 04:25:19,840 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 453 transitions. Word has length 227 [2018-02-04 04:25:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:19,840 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 453 transitions. [2018-02-04 04:25:19,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:25:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 453 transitions. [2018-02-04 04:25:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 04:25:19,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:19,841 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:19,841 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:19,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:20,344 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 04:25:20,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:20,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 04:25:20,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:20,360 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 04:25:20,360 INFO L182 omatonBuilderFactory]: Interpolants [126657#(= main_~i~0 0), 126659#(= main_~i~0 2), 126658#(= main_~i~0 1), 126661#(= main_~i~0 4), 126660#(= main_~i~0 3), 126663#(= main_~i~0 6), 126662#(= main_~i~0 5), 126665#(= main_~i~0 8), 126664#(= main_~i~0 7), 126667#(= main_~i~0 10), 126666#(= main_~i~0 9), 126669#(= main_~i~0 12), 126668#(= main_~i~0 11), 126671#(= main_~i~0 14), 126670#(= main_~i~0 13), 126673#(= main_~i~0 16), 126672#(= main_~i~0 15), 126675#(= main_~i~0 18), 126674#(= main_~i~0 17), 126677#(= main_~i~0 20), 126676#(= main_~i~0 19), 126679#(= main_~i~0 22), 126678#(= main_~i~0 21), 126681#(= main_~i~0 24), 126680#(= main_~i~0 23), 126683#(= main_~i~0 26), 126682#(= main_~i~0 25), 126685#(= main_~i~0 28), 126684#(= main_~i~0 27), 126687#(= main_~i~0 30), 126686#(= main_~i~0 29), 126689#(= main_~i~0 32), 126688#(= main_~i~0 31), 126691#(= main_~i~0 34), 126690#(= main_~i~0 33), 126693#(= main_~i~0 36), 126692#(= main_~i~0 35), 126695#(= main_~i~0 38), 126694#(= main_~i~0 37), 126697#(= main_~i~0 40), 126696#(= main_~i~0 39), 126699#(= main_~i~0 42), 126698#(= main_~i~0 41), 126701#(= main_~i~0 44), 126700#(= main_~i~0 43), 126702#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 126653#true, 126654#false] [2018-02-04 04:25:20,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 04:25:20,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 04:25:20,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 04:25:20,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:25:20,361 INFO L87 Difference]: Start difference. First operand 386 states and 453 transitions. Second operand 48 states. [2018-02-04 04:25:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:23,089 INFO L93 Difference]: Finished difference Result 6947 states and 8071 transitions. [2018-02-04 04:25:23,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:25:23,090 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 232 [2018-02-04 04:25:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:23,094 INFO L225 Difference]: With dead ends: 6947 [2018-02-04 04:25:23,094 INFO L226 Difference]: Without dead ends: 6947 [2018-02-04 04:25:23,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:25:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2018-02-04 04:25:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 391. [2018-02-04 04:25:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 04:25:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 459 transitions. [2018-02-04 04:25:23,118 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 459 transitions. Word has length 232 [2018-02-04 04:25:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:23,118 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 459 transitions. [2018-02-04 04:25:23,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 04:25:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 459 transitions. [2018-02-04 04:25:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 04:25:23,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:23,119 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:23,119 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1662404875, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:23,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-02-04 04:25:23,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:23,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 04:25:23,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-02-04 04:25:23,366 INFO L182 omatonBuilderFactory]: Interpolants [134080#(= main_~x~0 7), 134145#(= main_~x~0 20), 134150#(= main_~x~0 21), 134085#(= main_~x~0 8), 134090#(= main_~x~0 9), 134155#(= main_~x~0 22), 134095#(= main_~x~0 10), 134160#(= main_~x~0 23), 134100#(= main_~x~0 11), 134165#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 134042#false, 134041#true, 134105#(= main_~x~0 12), 134110#(= main_~x~0 13), 134045#(= 0 main_~x~0), 134050#(= 1 main_~x~0), 134115#(= main_~x~0 14), 134055#(= main_~x~0 2), 134120#(= main_~x~0 15), 134060#(= main_~x~0 3), 134125#(= main_~x~0 16), 134130#(= main_~x~0 17), 134065#(= main_~x~0 4), 134070#(= main_~x~0 5), 134135#(= main_~x~0 18), 134075#(= main_~x~0 6), 134140#(= main_~x~0 19)] [2018-02-04 04:25:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-02-04 04:25:23,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:25:23,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:25:23,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:25:23,366 INFO L87 Difference]: Start difference. First operand 391 states and 459 transitions. Second operand 27 states. [2018-02-04 04:25:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:23,932 INFO L93 Difference]: Finished difference Result 397 states and 466 transitions. [2018-02-04 04:25:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:25:23,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 257 [2018-02-04 04:25:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:23,933 INFO L225 Difference]: With dead ends: 397 [2018-02-04 04:25:23,933 INFO L226 Difference]: Without dead ends: 397 [2018-02-04 04:25:23,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:25:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-04 04:25:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-02-04 04:25:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 04:25:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 466 transitions. [2018-02-04 04:25:23,935 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 466 transitions. Word has length 257 [2018-02-04 04:25:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:23,935 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 466 transitions. [2018-02-04 04:25:23,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:25:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 466 transitions. [2018-02-04 04:25:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:25:23,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:23,936 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:23,936 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:23,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:24,479 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 04:25:24,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:24,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 04:25:24,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:24,495 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 04:25:24,495 INFO L182 omatonBuilderFactory]: Interpolants [134960#true, 134961#false, 134966#(= main_~i~0 2), 134967#(= main_~i~0 3), 134964#(= main_~i~0 0), 134965#(= main_~i~0 1), 134970#(= main_~i~0 6), 134971#(= main_~i~0 7), 134968#(= main_~i~0 4), 134969#(= main_~i~0 5), 134974#(= main_~i~0 10), 134975#(= main_~i~0 11), 134972#(= main_~i~0 8), 134973#(= main_~i~0 9), 134978#(= main_~i~0 14), 134979#(= main_~i~0 15), 134976#(= main_~i~0 12), 134977#(= main_~i~0 13), 134982#(= main_~i~0 18), 134983#(= main_~i~0 19), 134980#(= main_~i~0 16), 134981#(= main_~i~0 17), 134986#(= main_~i~0 22), 134987#(= main_~i~0 23), 134984#(= main_~i~0 20), 134985#(= main_~i~0 21), 134990#(= main_~i~0 26), 134991#(= main_~i~0 27), 134988#(= main_~i~0 24), 134989#(= main_~i~0 25), 134994#(= main_~i~0 30), 134995#(= main_~i~0 31), 134992#(= main_~i~0 28), 134993#(= main_~i~0 29), 134998#(= main_~i~0 34), 134999#(= main_~i~0 35), 134996#(= main_~i~0 32), 134997#(= main_~i~0 33), 135002#(= main_~i~0 38), 135003#(= main_~i~0 39), 135000#(= main_~i~0 36), 135001#(= main_~i~0 37), 135006#(= main_~i~0 42), 135007#(= main_~i~0 43), 135004#(= main_~i~0 40), 135005#(= main_~i~0 41), 135010#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 135008#(= main_~i~0 44), 135009#(= main_~i~0 45)] [2018-02-04 04:25:24,496 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 04:25:24,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:25:24,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:25:24,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:25:24,496 INFO L87 Difference]: Start difference. First operand 397 states and 466 transitions. Second operand 49 states. [2018-02-04 04:25:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:27,279 INFO L93 Difference]: Finished difference Result 7377 states and 8572 transitions. [2018-02-04 04:25:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:25:27,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 237 [2018-02-04 04:25:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:27,286 INFO L225 Difference]: With dead ends: 7377 [2018-02-04 04:25:27,286 INFO L226 Difference]: Without dead ends: 7377 [2018-02-04 04:25:27,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:25:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2018-02-04 04:25:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 402. [2018-02-04 04:25:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 04:25:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 472 transitions. [2018-02-04 04:25:27,311 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 472 transitions. Word has length 237 [2018-02-04 04:25:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:27,312 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 472 transitions. [2018-02-04 04:25:27,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:25:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 472 transitions. [2018-02-04 04:25:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 04:25:27,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:27,312 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:27,312 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:27,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:27,865 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 04:25:27,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:27,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 04:25:27,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:27,881 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 04:25:27,881 INFO L182 omatonBuilderFactory]: Interpolants [142790#true, 142791#false, 142794#(= main_~i~0 0), 142795#(= main_~i~0 1), 142798#(= main_~i~0 4), 142799#(= main_~i~0 5), 142796#(= main_~i~0 2), 142797#(= main_~i~0 3), 142802#(= main_~i~0 8), 142803#(= main_~i~0 9), 142800#(= main_~i~0 6), 142801#(= main_~i~0 7), 142806#(= main_~i~0 12), 142807#(= main_~i~0 13), 142804#(= main_~i~0 10), 142805#(= main_~i~0 11), 142810#(= main_~i~0 16), 142811#(= main_~i~0 17), 142808#(= main_~i~0 14), 142809#(= main_~i~0 15), 142814#(= main_~i~0 20), 142815#(= main_~i~0 21), 142812#(= main_~i~0 18), 142813#(= main_~i~0 19), 142818#(= main_~i~0 24), 142819#(= main_~i~0 25), 142816#(= main_~i~0 22), 142817#(= main_~i~0 23), 142822#(= main_~i~0 28), 142823#(= main_~i~0 29), 142820#(= main_~i~0 26), 142821#(= main_~i~0 27), 142826#(= main_~i~0 32), 142827#(= main_~i~0 33), 142824#(= main_~i~0 30), 142825#(= main_~i~0 31), 142830#(= main_~i~0 36), 142831#(= main_~i~0 37), 142828#(= main_~i~0 34), 142829#(= main_~i~0 35), 142834#(= main_~i~0 40), 142835#(= main_~i~0 41), 142832#(= main_~i~0 38), 142833#(= main_~i~0 39), 142838#(= main_~i~0 44), 142839#(= main_~i~0 45), 142836#(= main_~i~0 42), 142837#(= main_~i~0 43), 142840#(= main_~i~0 46), 142841#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:25:27,881 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 04:25:27,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:25:27,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:25:27,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:25:27,882 INFO L87 Difference]: Start difference. First operand 402 states and 472 transitions. Second operand 50 states. [2018-02-04 04:25:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:30,819 INFO L93 Difference]: Finished difference Result 7537 states and 8758 transitions. [2018-02-04 04:25:30,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:25:30,820 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 242 [2018-02-04 04:25:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:30,825 INFO L225 Difference]: With dead ends: 7537 [2018-02-04 04:25:30,825 INFO L226 Difference]: Without dead ends: 7537 [2018-02-04 04:25:30,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:25:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2018-02-04 04:25:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 407. [2018-02-04 04:25:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-04 04:25:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 478 transitions. [2018-02-04 04:25:30,852 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 478 transitions. Word has length 242 [2018-02-04 04:25:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:30,852 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 478 transitions. [2018-02-04 04:25:30,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:25:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 478 transitions. [2018-02-04 04:25:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 04:25:30,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:30,853 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:30,853 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1062722629, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:30,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-02-04 04:25:31,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:31,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 04:25:31,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-02-04 04:25:31,095 INFO L182 omatonBuilderFactory]: Interpolants [150786#true, 150850#(= main_~x~0 12), 150787#false, 150915#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 150790#(= 0 main_~x~0), 150855#(= main_~x~0 13), 150795#(= 1 main_~x~0), 150860#(= main_~x~0 14), 150800#(= main_~x~0 2), 150865#(= main_~x~0 15), 150870#(= main_~x~0 16), 150805#(= main_~x~0 3), 150810#(= main_~x~0 4), 150875#(= main_~x~0 17), 150815#(= main_~x~0 5), 150880#(= main_~x~0 18), 150820#(= main_~x~0 6), 150885#(= main_~x~0 19), 150890#(= main_~x~0 20), 150825#(= main_~x~0 7), 150830#(= main_~x~0 8), 150895#(= main_~x~0 21), 150835#(= main_~x~0 9), 150900#(= main_~x~0 22), 150840#(= main_~x~0 10), 150905#(= main_~x~0 23), 150910#(= main_~x~0 24), 150845#(= main_~x~0 11)] [2018-02-04 04:25:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 1875 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-02-04 04:25:31,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 04:25:31,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 04:25:31,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:25:31,095 INFO L87 Difference]: Start difference. First operand 407 states and 478 transitions. Second operand 28 states. [2018-02-04 04:25:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:31,717 INFO L93 Difference]: Finished difference Result 413 states and 485 transitions. [2018-02-04 04:25:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:25:31,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 267 [2018-02-04 04:25:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:31,718 INFO L225 Difference]: With dead ends: 413 [2018-02-04 04:25:31,718 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 04:25:31,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:25:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 04:25:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-02-04 04:25:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 04:25:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 485 transitions. [2018-02-04 04:25:31,720 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 485 transitions. Word has length 267 [2018-02-04 04:25:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:31,720 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 485 transitions. [2018-02-04 04:25:31,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 04:25:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 485 transitions. [2018-02-04 04:25:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 04:25:31,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:31,721 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:31,721 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:31,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:32,313 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 04:25:32,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:32,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 04:25:32,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:32,329 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 04:25:32,329 INFO L182 omatonBuilderFactory]: Interpolants [151742#true, 151743#false, 151746#(= main_~i~0 0), 151747#(= main_~i~0 1), 151750#(= main_~i~0 4), 151751#(= main_~i~0 5), 151748#(= main_~i~0 2), 151749#(= main_~i~0 3), 151754#(= main_~i~0 8), 151755#(= main_~i~0 9), 151752#(= main_~i~0 6), 151753#(= main_~i~0 7), 151758#(= main_~i~0 12), 151759#(= main_~i~0 13), 151756#(= main_~i~0 10), 151757#(= main_~i~0 11), 151762#(= main_~i~0 16), 151763#(= main_~i~0 17), 151760#(= main_~i~0 14), 151761#(= main_~i~0 15), 151766#(= main_~i~0 20), 151767#(= main_~i~0 21), 151764#(= main_~i~0 18), 151765#(= main_~i~0 19), 151770#(= main_~i~0 24), 151771#(= main_~i~0 25), 151768#(= main_~i~0 22), 151769#(= main_~i~0 23), 151774#(= main_~i~0 28), 151775#(= main_~i~0 29), 151772#(= main_~i~0 26), 151773#(= main_~i~0 27), 151778#(= main_~i~0 32), 151779#(= main_~i~0 33), 151776#(= main_~i~0 30), 151777#(= main_~i~0 31), 151782#(= main_~i~0 36), 151783#(= main_~i~0 37), 151780#(= main_~i~0 34), 151781#(= main_~i~0 35), 151786#(= main_~i~0 40), 151787#(= main_~i~0 41), 151784#(= main_~i~0 38), 151785#(= main_~i~0 39), 151790#(= main_~i~0 44), 151791#(= main_~i~0 45), 151788#(= main_~i~0 42), 151789#(= main_~i~0 43), 151794#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 151792#(= main_~i~0 46), 151793#(= main_~i~0 47)] [2018-02-04 04:25:32,330 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 04:25:32,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:25:32,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:25:32,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:25:32,330 INFO L87 Difference]: Start difference. First operand 413 states and 485 transitions. Second operand 51 states. [2018-02-04 04:25:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:35,392 INFO L93 Difference]: Finished difference Result 7985 states and 9280 transitions. [2018-02-04 04:25:35,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:25:35,392 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 247 [2018-02-04 04:25:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:35,398 INFO L225 Difference]: With dead ends: 7985 [2018-02-04 04:25:35,399 INFO L226 Difference]: Without dead ends: 7985 [2018-02-04 04:25:35,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:25:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2018-02-04 04:25:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 418. [2018-02-04 04:25:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-04 04:25:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 491 transitions. [2018-02-04 04:25:35,428 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 491 transitions. Word has length 247 [2018-02-04 04:25:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:35,428 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 491 transitions. [2018-02-04 04:25:35,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:25:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 491 transitions. [2018-02-04 04:25:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 04:25:35,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:35,429 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:35,429 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1932644609, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:35,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3331 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-02-04 04:25:35,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:35,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 04:25:35,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-02-04 04:25:35,667 INFO L182 omatonBuilderFactory]: Interpolants [160322#(= main_~x~0 24), 160257#(= main_~x~0 11), 160198#true, 160262#(= main_~x~0 12), 160199#false, 160327#(= main_~x~0 25), 160202#(= 0 main_~x~0), 160267#(= main_~x~0 13), 160207#(= 1 main_~x~0), 160332#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 160272#(= main_~x~0 14), 160212#(= main_~x~0 2), 160277#(= main_~x~0 15), 160282#(= main_~x~0 16), 160217#(= main_~x~0 3), 160222#(= main_~x~0 4), 160287#(= main_~x~0 17), 160227#(= main_~x~0 5), 160292#(= main_~x~0 18), 160232#(= main_~x~0 6), 160297#(= main_~x~0 19), 160302#(= main_~x~0 20), 160237#(= main_~x~0 7), 160242#(= main_~x~0 8), 160307#(= main_~x~0 21), 160247#(= main_~x~0 9), 160312#(= main_~x~0 22), 160252#(= main_~x~0 10), 160317#(= main_~x~0 23)] [2018-02-04 04:25:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3331 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-02-04 04:25:35,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:25:35,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:25:35,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:25:35,667 INFO L87 Difference]: Start difference. First operand 418 states and 491 transitions. Second operand 29 states. [2018-02-04 04:25:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:36,351 INFO L93 Difference]: Finished difference Result 424 states and 498 transitions. [2018-02-04 04:25:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:25:36,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 277 [2018-02-04 04:25:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:36,352 INFO L225 Difference]: With dead ends: 424 [2018-02-04 04:25:36,352 INFO L226 Difference]: Without dead ends: 424 [2018-02-04 04:25:36,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:25:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-04 04:25:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-02-04 04:25:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 04:25:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 498 transitions. [2018-02-04 04:25:36,354 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 498 transitions. Word has length 277 [2018-02-04 04:25:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:36,354 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 498 transitions. [2018-02-04 04:25:36,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:25:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 498 transitions. [2018-02-04 04:25:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 04:25:36,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:36,355 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:36,355 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:36,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:36,936 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 04:25:36,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:36,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 04:25:36,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:36,952 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 04:25:36,952 INFO L182 omatonBuilderFactory]: Interpolants [161182#false, 161181#true, 161186#(= main_~i~0 1), 161187#(= main_~i~0 2), 161185#(= main_~i~0 0), 161190#(= main_~i~0 5), 161191#(= main_~i~0 6), 161188#(= main_~i~0 3), 161189#(= main_~i~0 4), 161194#(= main_~i~0 9), 161195#(= main_~i~0 10), 161192#(= main_~i~0 7), 161193#(= main_~i~0 8), 161198#(= main_~i~0 13), 161199#(= main_~i~0 14), 161196#(= main_~i~0 11), 161197#(= main_~i~0 12), 161202#(= main_~i~0 17), 161203#(= main_~i~0 18), 161200#(= main_~i~0 15), 161201#(= main_~i~0 16), 161206#(= main_~i~0 21), 161207#(= main_~i~0 22), 161204#(= main_~i~0 19), 161205#(= main_~i~0 20), 161210#(= main_~i~0 25), 161211#(= main_~i~0 26), 161208#(= main_~i~0 23), 161209#(= main_~i~0 24), 161214#(= main_~i~0 29), 161215#(= main_~i~0 30), 161212#(= main_~i~0 27), 161213#(= main_~i~0 28), 161218#(= main_~i~0 33), 161219#(= main_~i~0 34), 161216#(= main_~i~0 31), 161217#(= main_~i~0 32), 161222#(= main_~i~0 37), 161223#(= main_~i~0 38), 161220#(= main_~i~0 35), 161221#(= main_~i~0 36), 161226#(= main_~i~0 41), 161227#(= main_~i~0 42), 161224#(= main_~i~0 39), 161225#(= main_~i~0 40), 161230#(= main_~i~0 45), 161231#(= main_~i~0 46), 161228#(= main_~i~0 43), 161229#(= main_~i~0 44), 161234#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 161232#(= main_~i~0 47), 161233#(= main_~i~0 48)] [2018-02-04 04:25:36,952 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 04:25:36,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 04:25:36,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 04:25:36,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:25:36,953 INFO L87 Difference]: Start difference. First operand 424 states and 498 transitions. Second operand 52 states. [2018-02-04 04:25:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:40,162 INFO L93 Difference]: Finished difference Result 8445 states and 9816 transitions. [2018-02-04 04:25:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 04:25:40,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 252 [2018-02-04 04:25:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:40,168 INFO L225 Difference]: With dead ends: 8445 [2018-02-04 04:25:40,168 INFO L226 Difference]: Without dead ends: 8445 [2018-02-04 04:25:40,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:25:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2018-02-04 04:25:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 429. [2018-02-04 04:25:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 04:25:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 504 transitions. [2018-02-04 04:25:40,200 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 504 transitions. Word has length 252 [2018-02-04 04:25:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:40,200 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 504 transitions. [2018-02-04 04:25:40,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 04:25:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 504 transitions. [2018-02-04 04:25:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 04:25:40,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:40,201 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:40,201 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:40,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:40,803 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 04:25:40,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:40,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 04:25:40,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:40,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 04:25:40,820 INFO L182 omatonBuilderFactory]: Interpolants [170114#(= main_~i~0 1), 170115#(= main_~i~0 2), 170113#(= main_~i~0 0), 170118#(= main_~i~0 5), 170119#(= main_~i~0 6), 170116#(= main_~i~0 3), 170117#(= main_~i~0 4), 170122#(= main_~i~0 9), 170123#(= main_~i~0 10), 170120#(= main_~i~0 7), 170121#(= main_~i~0 8), 170126#(= main_~i~0 13), 170127#(= main_~i~0 14), 170124#(= main_~i~0 11), 170125#(= main_~i~0 12), 170130#(= main_~i~0 17), 170131#(= main_~i~0 18), 170128#(= main_~i~0 15), 170129#(= main_~i~0 16), 170134#(= main_~i~0 21), 170135#(= main_~i~0 22), 170132#(= main_~i~0 19), 170133#(= main_~i~0 20), 170138#(= main_~i~0 25), 170139#(= main_~i~0 26), 170136#(= main_~i~0 23), 170137#(= main_~i~0 24), 170142#(= main_~i~0 29), 170143#(= main_~i~0 30), 170140#(= main_~i~0 27), 170141#(= main_~i~0 28), 170146#(= main_~i~0 33), 170147#(= main_~i~0 34), 170144#(= main_~i~0 31), 170145#(= main_~i~0 32), 170150#(= main_~i~0 37), 170151#(= main_~i~0 38), 170148#(= main_~i~0 35), 170149#(= main_~i~0 36), 170154#(= main_~i~0 41), 170155#(= main_~i~0 42), 170152#(= main_~i~0 39), 170153#(= main_~i~0 40), 170158#(= main_~i~0 45), 170159#(= main_~i~0 46), 170156#(= main_~i~0 43), 170157#(= main_~i~0 44), 170162#(= main_~i~0 49), 170163#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 170160#(= main_~i~0 47), 170161#(= main_~i~0 48), 170110#false, 170109#true] [2018-02-04 04:25:40,820 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 04:25:40,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:25:40,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:25:40,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:25:40,820 INFO L87 Difference]: Start difference. First operand 429 states and 504 transitions. Second operand 53 states. [2018-02-04 04:25:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:44,167 INFO L93 Difference]: Finished difference Result 8617 states and 10016 transitions. [2018-02-04 04:25:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:25:44,168 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 257 [2018-02-04 04:25:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:44,174 INFO L225 Difference]: With dead ends: 8617 [2018-02-04 04:25:44,174 INFO L226 Difference]: Without dead ends: 8617 [2018-02-04 04:25:44,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:25:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2018-02-04 04:25:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 434. [2018-02-04 04:25:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 04:25:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 510 transitions. [2018-02-04 04:25:44,206 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 510 transitions. Word has length 257 [2018-02-04 04:25:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:44,206 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 510 transitions. [2018-02-04 04:25:44,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:25:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 510 transitions. [2018-02-04 04:25:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:25:44,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:44,207 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:44,207 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1848631609, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:44,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2018-02-04 04:25:44,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:44,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 04:25:44,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-02-04 04:25:44,468 INFO L182 omatonBuilderFactory]: Interpolants [179264#(= main_~x~0 9), 179329#(= main_~x~0 22), 179334#(= main_~x~0 23), 179269#(= main_~x~0 10), 179274#(= main_~x~0 11), 179339#(= main_~x~0 24), 179215#true, 179279#(= main_~x~0 12), 179219#(= 0 main_~x~0), 179216#false, 179344#(= main_~x~0 25), 179284#(= main_~x~0 13), 179349#(= main_~x~0 26), 179354#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 179224#(= 1 main_~x~0), 179289#(= main_~x~0 14), 179294#(= main_~x~0 15), 179229#(= main_~x~0 2), 179234#(= main_~x~0 3), 179299#(= main_~x~0 16), 179239#(= main_~x~0 4), 179304#(= main_~x~0 17), 179244#(= main_~x~0 5), 179309#(= main_~x~0 18), 179314#(= main_~x~0 19), 179249#(= main_~x~0 6), 179254#(= main_~x~0 7), 179319#(= main_~x~0 20), 179259#(= main_~x~0 8), 179324#(= main_~x~0 21)] [2018-02-04 04:25:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 0 proven. 2187 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2018-02-04 04:25:44,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:25:44,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:25:44,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:25:44,468 INFO L87 Difference]: Start difference. First operand 434 states and 510 transitions. Second operand 30 states. [2018-02-04 04:25:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:45,204 INFO L93 Difference]: Finished difference Result 440 states and 517 transitions. [2018-02-04 04:25:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:25:45,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 287 [2018-02-04 04:25:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:45,205 INFO L225 Difference]: With dead ends: 440 [2018-02-04 04:25:45,205 INFO L226 Difference]: Without dead ends: 440 [2018-02-04 04:25:45,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:25:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-04 04:25:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-02-04 04:25:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-04 04:25:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 517 transitions. [2018-02-04 04:25:45,207 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 517 transitions. Word has length 287 [2018-02-04 04:25:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:45,208 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 517 transitions. [2018-02-04 04:25:45,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:25:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 517 transitions. [2018-02-04 04:25:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 04:25:45,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:45,209 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:45,209 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:45,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:45,812 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 04:25:45,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:45,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 04:25:45,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:45,828 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 04:25:45,828 INFO L182 omatonBuilderFactory]: Interpolants [180235#true, 180239#(= main_~i~0 0), 180236#false, 180242#(= main_~i~0 3), 180243#(= main_~i~0 4), 180240#(= main_~i~0 1), 180241#(= main_~i~0 2), 180246#(= main_~i~0 7), 180247#(= main_~i~0 8), 180244#(= main_~i~0 5), 180245#(= main_~i~0 6), 180250#(= main_~i~0 11), 180251#(= main_~i~0 12), 180248#(= main_~i~0 9), 180249#(= main_~i~0 10), 180254#(= main_~i~0 15), 180255#(= main_~i~0 16), 180252#(= main_~i~0 13), 180253#(= main_~i~0 14), 180258#(= main_~i~0 19), 180259#(= main_~i~0 20), 180256#(= main_~i~0 17), 180257#(= main_~i~0 18), 180262#(= main_~i~0 23), 180263#(= main_~i~0 24), 180260#(= main_~i~0 21), 180261#(= main_~i~0 22), 180266#(= main_~i~0 27), 180267#(= main_~i~0 28), 180264#(= main_~i~0 25), 180265#(= main_~i~0 26), 180270#(= main_~i~0 31), 180271#(= main_~i~0 32), 180268#(= main_~i~0 29), 180269#(= main_~i~0 30), 180274#(= main_~i~0 35), 180275#(= main_~i~0 36), 180272#(= main_~i~0 33), 180273#(= main_~i~0 34), 180278#(= main_~i~0 39), 180279#(= main_~i~0 40), 180276#(= main_~i~0 37), 180277#(= main_~i~0 38), 180282#(= main_~i~0 43), 180283#(= main_~i~0 44), 180280#(= main_~i~0 41), 180281#(= main_~i~0 42), 180286#(= main_~i~0 47), 180287#(= main_~i~0 48), 180284#(= main_~i~0 45), 180285#(= main_~i~0 46), 180290#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 180288#(= main_~i~0 49), 180289#(= main_~i~0 50)] [2018-02-04 04:25:45,829 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 04:25:45,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 04:25:45,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 04:25:45,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:25:45,829 INFO L87 Difference]: Start difference. First operand 440 states and 517 transitions. Second operand 54 states. [2018-02-04 04:25:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:49,268 INFO L93 Difference]: Finished difference Result 9095 states and 10573 transitions. [2018-02-04 04:25:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 04:25:49,269 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 262 [2018-02-04 04:25:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:49,276 INFO L225 Difference]: With dead ends: 9095 [2018-02-04 04:25:49,276 INFO L226 Difference]: Without dead ends: 9095 [2018-02-04 04:25:49,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:25:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2018-02-04 04:25:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 445. [2018-02-04 04:25:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 04:25:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 523 transitions. [2018-02-04 04:25:49,310 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 523 transitions. Word has length 262 [2018-02-04 04:25:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:49,310 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 523 transitions. [2018-02-04 04:25:49,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 04:25:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 523 transitions. [2018-02-04 04:25:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 04:25:49,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:49,311 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:49,311 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:49,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:49,965 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 04:25:49,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:49,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 04:25:49,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:49,981 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 04:25:49,981 INFO L182 omatonBuilderFactory]: Interpolants [189831#true, 189835#(= main_~i~0 0), 189832#false, 189838#(= main_~i~0 3), 189839#(= main_~i~0 4), 189836#(= main_~i~0 1), 189837#(= main_~i~0 2), 189842#(= main_~i~0 7), 189843#(= main_~i~0 8), 189840#(= main_~i~0 5), 189841#(= main_~i~0 6), 189846#(= main_~i~0 11), 189847#(= main_~i~0 12), 189844#(= main_~i~0 9), 189845#(= main_~i~0 10), 189850#(= main_~i~0 15), 189851#(= main_~i~0 16), 189848#(= main_~i~0 13), 189849#(= main_~i~0 14), 189854#(= main_~i~0 19), 189855#(= main_~i~0 20), 189852#(= main_~i~0 17), 189853#(= main_~i~0 18), 189858#(= main_~i~0 23), 189859#(= main_~i~0 24), 189856#(= main_~i~0 21), 189857#(= main_~i~0 22), 189862#(= main_~i~0 27), 189863#(= main_~i~0 28), 189860#(= main_~i~0 25), 189861#(= main_~i~0 26), 189866#(= main_~i~0 31), 189867#(= main_~i~0 32), 189864#(= main_~i~0 29), 189865#(= main_~i~0 30), 189870#(= main_~i~0 35), 189871#(= main_~i~0 36), 189868#(= main_~i~0 33), 189869#(= main_~i~0 34), 189874#(= main_~i~0 39), 189875#(= main_~i~0 40), 189872#(= main_~i~0 37), 189873#(= main_~i~0 38), 189878#(= main_~i~0 43), 189879#(= main_~i~0 44), 189876#(= main_~i~0 41), 189877#(= main_~i~0 42), 189882#(= main_~i~0 47), 189883#(= main_~i~0 48), 189880#(= main_~i~0 45), 189881#(= main_~i~0 46), 189886#(= main_~i~0 51), 189887#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 189884#(= main_~i~0 49), 189885#(= main_~i~0 50)] [2018-02-04 04:25:49,981 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 04:25:49,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:25:49,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:25:49,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:25:49,982 INFO L87 Difference]: Start difference. First operand 445 states and 523 transitions. Second operand 55 states. [2018-02-04 04:25:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:53,598 INFO L93 Difference]: Finished difference Result 9273 states and 10780 transitions. [2018-02-04 04:25:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:25:53,599 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 267 [2018-02-04 04:25:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:53,605 INFO L225 Difference]: With dead ends: 9273 [2018-02-04 04:25:53,606 INFO L226 Difference]: Without dead ends: 9273 [2018-02-04 04:25:53,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:25:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-02-04 04:25:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 450. [2018-02-04 04:25:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-04 04:25:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 529 transitions. [2018-02-04 04:25:53,639 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 529 transitions. Word has length 267 [2018-02-04 04:25:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:53,639 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 529 transitions. [2018-02-04 04:25:53,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:25:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 529 transitions. [2018-02-04 04:25:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 04:25:53,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:53,640 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:53,640 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1972661517, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:53,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2018-02-04 04:25:53,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:53,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 04:25:53,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-02-04 04:25:53,924 INFO L182 omatonBuilderFactory]: Interpolants [199745#(= main_~x~0 26), 199680#(= main_~x~0 13), 199750#(= main_~x~0 27), 199685#(= main_~x~0 14), 199620#(= 1 main_~x~0), 199755#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 199690#(= main_~x~0 15), 199625#(= main_~x~0 2), 199695#(= main_~x~0 16), 199630#(= main_~x~0 3), 199635#(= main_~x~0 4), 199700#(= main_~x~0 17), 199705#(= main_~x~0 18), 199640#(= main_~x~0 5), 199710#(= main_~x~0 19), 199645#(= main_~x~0 6), 199715#(= main_~x~0 20), 199650#(= main_~x~0 7), 199655#(= main_~x~0 8), 199720#(= main_~x~0 21), 199725#(= main_~x~0 22), 199660#(= main_~x~0 9), 199730#(= main_~x~0 23), 199665#(= main_~x~0 10), 199735#(= main_~x~0 24), 199670#(= main_~x~0 11), 199611#true, 199675#(= main_~x~0 12), 199615#(= 0 main_~x~0), 199612#false, 199740#(= main_~x~0 25)] [2018-02-04 04:25:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3867 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2018-02-04 04:25:53,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:25:53,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:25:53,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:25:53,924 INFO L87 Difference]: Start difference. First operand 450 states and 529 transitions. Second operand 31 states. [2018-02-04 04:25:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:54,696 INFO L93 Difference]: Finished difference Result 456 states and 536 transitions. [2018-02-04 04:25:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:25:54,697 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 297 [2018-02-04 04:25:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:54,697 INFO L225 Difference]: With dead ends: 456 [2018-02-04 04:25:54,697 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 04:25:54,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:25:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 04:25:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2018-02-04 04:25:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-04 04:25:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 536 transitions. [2018-02-04 04:25:54,700 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 536 transitions. Word has length 297 [2018-02-04 04:25:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:54,700 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 536 transitions. [2018-02-04 04:25:54,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:25:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 536 transitions. [2018-02-04 04:25:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 04:25:54,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:54,701 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:54,701 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:54,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:55,419 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 04:25:55,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:55,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 04:25:55,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:55,435 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 04:25:55,435 INFO L182 omatonBuilderFactory]: Interpolants [200707#(= main_~i~0 35), 200706#(= main_~i~0 34), 200705#(= main_~i~0 33), 200704#(= main_~i~0 32), 200711#(= main_~i~0 39), 200710#(= main_~i~0 38), 200709#(= main_~i~0 37), 200708#(= main_~i~0 36), 200715#(= main_~i~0 43), 200714#(= main_~i~0 42), 200713#(= main_~i~0 41), 200712#(= main_~i~0 40), 200719#(= main_~i~0 47), 200718#(= main_~i~0 46), 200717#(= main_~i~0 45), 200716#(= main_~i~0 44), 200723#(= main_~i~0 51), 200722#(= main_~i~0 50), 200721#(= main_~i~0 49), 200720#(= main_~i~0 48), 200725#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 200724#(= main_~i~0 52), 200669#false, 200668#true, 200675#(= main_~i~0 3), 200674#(= main_~i~0 2), 200673#(= main_~i~0 1), 200672#(= main_~i~0 0), 200679#(= main_~i~0 7), 200678#(= main_~i~0 6), 200677#(= main_~i~0 5), 200676#(= main_~i~0 4), 200683#(= main_~i~0 11), 200682#(= main_~i~0 10), 200681#(= main_~i~0 9), 200680#(= main_~i~0 8), 200687#(= main_~i~0 15), 200686#(= main_~i~0 14), 200685#(= main_~i~0 13), 200684#(= main_~i~0 12), 200691#(= main_~i~0 19), 200690#(= main_~i~0 18), 200689#(= main_~i~0 17), 200688#(= main_~i~0 16), 200695#(= main_~i~0 23), 200694#(= main_~i~0 22), 200693#(= main_~i~0 21), 200692#(= main_~i~0 20), 200699#(= main_~i~0 27), 200698#(= main_~i~0 26), 200697#(= main_~i~0 25), 200696#(= main_~i~0 24), 200703#(= main_~i~0 31), 200702#(= main_~i~0 30), 200701#(= main_~i~0 29), 200700#(= main_~i~0 28)] [2018-02-04 04:25:55,435 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 04:25:55,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 04:25:55,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 04:25:55,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:25:55,436 INFO L87 Difference]: Start difference. First operand 456 states and 536 transitions. Second operand 56 states. [2018-02-04 04:25:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:25:59,159 INFO L93 Difference]: Finished difference Result 9769 states and 11358 transitions. [2018-02-04 04:25:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:25:59,159 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 272 [2018-02-04 04:25:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:25:59,167 INFO L225 Difference]: With dead ends: 9769 [2018-02-04 04:25:59,167 INFO L226 Difference]: Without dead ends: 9769 [2018-02-04 04:25:59,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:25:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2018-02-04 04:25:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 461. [2018-02-04 04:25:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-04 04:25:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 542 transitions. [2018-02-04 04:25:59,204 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 542 transitions. Word has length 272 [2018-02-04 04:25:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:25:59,204 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 542 transitions. [2018-02-04 04:25:59,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 04:25:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 542 transitions. [2018-02-04 04:25:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 04:25:59,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:25:59,205 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 04:25:59,205 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:25:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:25:59,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:25:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:25:59,911 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 04:25:59,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:25:59,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 04:25:59,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:25:59,928 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 04:25:59,928 INFO L182 omatonBuilderFactory]: Interpolants [210957#false, 210956#true, 210963#(= main_~i~0 3), 210962#(= main_~i~0 2), 210961#(= main_~i~0 1), 210960#(= main_~i~0 0), 210967#(= main_~i~0 7), 210966#(= main_~i~0 6), 210965#(= main_~i~0 5), 210964#(= main_~i~0 4), 210971#(= main_~i~0 11), 210970#(= main_~i~0 10), 210969#(= main_~i~0 9), 210968#(= main_~i~0 8), 210975#(= main_~i~0 15), 210974#(= main_~i~0 14), 210973#(= main_~i~0 13), 210972#(= main_~i~0 12), 210979#(= main_~i~0 19), 210978#(= main_~i~0 18), 210977#(= main_~i~0 17), 210976#(= main_~i~0 16), 210983#(= main_~i~0 23), 210982#(= main_~i~0 22), 210981#(= main_~i~0 21), 210980#(= main_~i~0 20), 210987#(= main_~i~0 27), 210986#(= main_~i~0 26), 210985#(= main_~i~0 25), 210984#(= main_~i~0 24), 210991#(= main_~i~0 31), 210990#(= main_~i~0 30), 210989#(= main_~i~0 29), 210988#(= main_~i~0 28), 210995#(= main_~i~0 35), 210994#(= main_~i~0 34), 210993#(= main_~i~0 33), 210992#(= main_~i~0 32), 210999#(= main_~i~0 39), 210998#(= main_~i~0 38), 210997#(= main_~i~0 37), 210996#(= main_~i~0 36), 211003#(= main_~i~0 43), 211002#(= main_~i~0 42), 211001#(= main_~i~0 41), 211000#(= main_~i~0 40), 211007#(= main_~i~0 47), 211006#(= main_~i~0 46), 211005#(= main_~i~0 45), 211004#(= main_~i~0 44), 211011#(= main_~i~0 51), 211010#(= main_~i~0 50), 211009#(= main_~i~0 49), 211008#(= main_~i~0 48), 211014#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 211013#(= main_~i~0 53), 211012#(= main_~i~0 52)] [2018-02-04 04:25:59,928 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 04:25:59,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 04:25:59,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 04:25:59,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:25:59,929 INFO L87 Difference]: Start difference. First operand 461 states and 542 transitions. Second operand 57 states. [2018-02-04 04:26:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:04,266 INFO L93 Difference]: Finished difference Result 9953 states and 11572 transitions. [2018-02-04 04:26:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 04:26:04,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 277 [2018-02-04 04:26:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:04,273 INFO L225 Difference]: With dead ends: 9953 [2018-02-04 04:26:04,274 INFO L226 Difference]: Without dead ends: 9953 [2018-02-04 04:26:04,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:26:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2018-02-04 04:26:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 466. [2018-02-04 04:26:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-04 04:26:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 548 transitions. [2018-02-04 04:26:04,311 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 548 transitions. Word has length 277 [2018-02-04 04:26:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:04,311 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 548 transitions. [2018-02-04 04:26:04,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 04:26:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 548 transitions. [2018-02-04 04:26:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 04:26:04,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:04,312 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:04,312 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 648537133, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:04,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2018-02-04 04:26:04,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:04,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 04:26:04,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-02-04 04:26:04,614 INFO L182 omatonBuilderFactory]: Interpolants [221443#(= 1 main_~x~0), 221568#(= main_~x~0 26), 221573#(= main_~x~0 27), 221508#(= main_~x~0 14), 221578#(= main_~x~0 28), 221513#(= main_~x~0 15), 221448#(= main_~x~0 2), 221583#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 221518#(= main_~x~0 16), 221453#(= main_~x~0 3), 221523#(= main_~x~0 17), 221458#(= main_~x~0 4), 221463#(= main_~x~0 5), 221528#(= main_~x~0 18), 221533#(= main_~x~0 19), 221468#(= main_~x~0 6), 221538#(= main_~x~0 20), 221473#(= main_~x~0 7), 221543#(= main_~x~0 21), 221478#(= main_~x~0 8), 221483#(= main_~x~0 9), 221548#(= main_~x~0 22), 221553#(= main_~x~0 23), 221488#(= main_~x~0 10), 221558#(= main_~x~0 24), 221493#(= main_~x~0 11), 221435#false, 221563#(= main_~x~0 25), 221434#true, 221498#(= main_~x~0 12), 221503#(= main_~x~0 13), 221438#(= 0 main_~x~0)] [2018-02-04 04:26:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 0 proven. 2523 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2018-02-04 04:26:04,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:26:04,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:26:04,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:26:04,615 INFO L87 Difference]: Start difference. First operand 466 states and 548 transitions. Second operand 32 states. [2018-02-04 04:26:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:05,446 INFO L93 Difference]: Finished difference Result 472 states and 555 transitions. [2018-02-04 04:26:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:26:05,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 307 [2018-02-04 04:26:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:05,447 INFO L225 Difference]: With dead ends: 472 [2018-02-04 04:26:05,447 INFO L226 Difference]: Without dead ends: 472 [2018-02-04 04:26:05,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:26:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-02-04 04:26:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2018-02-04 04:26:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-04 04:26:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 555 transitions. [2018-02-04 04:26:05,449 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 555 transitions. Word has length 307 [2018-02-04 04:26:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:05,450 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 555 transitions. [2018-02-04 04:26:05,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:26:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 555 transitions. [2018-02-04 04:26:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 04:26:05,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:05,451 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:05,451 INFO L371 AbstractCegarLoop]: === Iteration 87 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:05,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:06,184 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 04:26:06,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:06,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 04:26:06,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:06,201 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 04:26:06,201 INFO L182 omatonBuilderFactory]: Interpolants [222529#false, 222528#true, 222535#(= main_~i~0 3), 222534#(= main_~i~0 2), 222533#(= main_~i~0 1), 222532#(= main_~i~0 0), 222539#(= main_~i~0 7), 222538#(= main_~i~0 6), 222537#(= main_~i~0 5), 222536#(= main_~i~0 4), 222543#(= main_~i~0 11), 222542#(= main_~i~0 10), 222541#(= main_~i~0 9), 222540#(= main_~i~0 8), 222547#(= main_~i~0 15), 222546#(= main_~i~0 14), 222545#(= main_~i~0 13), 222544#(= main_~i~0 12), 222551#(= main_~i~0 19), 222550#(= main_~i~0 18), 222549#(= main_~i~0 17), 222548#(= main_~i~0 16), 222555#(= main_~i~0 23), 222554#(= main_~i~0 22), 222553#(= main_~i~0 21), 222552#(= main_~i~0 20), 222559#(= main_~i~0 27), 222558#(= main_~i~0 26), 222557#(= main_~i~0 25), 222556#(= main_~i~0 24), 222563#(= main_~i~0 31), 222562#(= main_~i~0 30), 222561#(= main_~i~0 29), 222560#(= main_~i~0 28), 222567#(= main_~i~0 35), 222566#(= main_~i~0 34), 222565#(= main_~i~0 33), 222564#(= main_~i~0 32), 222571#(= main_~i~0 39), 222570#(= main_~i~0 38), 222569#(= main_~i~0 37), 222568#(= main_~i~0 36), 222575#(= main_~i~0 43), 222574#(= main_~i~0 42), 222573#(= main_~i~0 41), 222572#(= main_~i~0 40), 222579#(= main_~i~0 47), 222578#(= main_~i~0 46), 222577#(= main_~i~0 45), 222576#(= main_~i~0 44), 222583#(= main_~i~0 51), 222582#(= main_~i~0 50), 222581#(= main_~i~0 49), 222580#(= main_~i~0 48), 222587#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 222586#(= main_~i~0 54), 222585#(= main_~i~0 53), 222584#(= main_~i~0 52)] [2018-02-04 04:26:06,201 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 04:26:06,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 04:26:06,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 04:26:06,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:26:06,202 INFO L87 Difference]: Start difference. First operand 472 states and 555 transitions. Second operand 58 states. [2018-02-04 04:26:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:10,255 INFO L93 Difference]: Finished difference Result 10467 states and 12171 transitions. [2018-02-04 04:26:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 04:26:10,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 282 [2018-02-04 04:26:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:10,264 INFO L225 Difference]: With dead ends: 10467 [2018-02-04 04:26:10,264 INFO L226 Difference]: Without dead ends: 10467 [2018-02-04 04:26:10,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:26:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10467 states. [2018-02-04 04:26:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10467 to 477. [2018-02-04 04:26:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-02-04 04:26:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 561 transitions. [2018-02-04 04:26:10,304 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 561 transitions. Word has length 282 [2018-02-04 04:26:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:10,304 INFO L432 AbstractCegarLoop]: Abstraction has 477 states and 561 transitions. [2018-02-04 04:26:10,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 04:26:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 561 transitions. [2018-02-04 04:26:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:26:10,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:10,305 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:10,305 INFO L371 AbstractCegarLoop]: === Iteration 88 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:10,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:11,086 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 04:26:11,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:11,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 04:26:11,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:11,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 04:26:11,102 INFO L182 omatonBuilderFactory]: Interpolants [233533#false, 233532#true, 233539#(= main_~i~0 3), 233538#(= main_~i~0 2), 233537#(= main_~i~0 1), 233536#(= main_~i~0 0), 233543#(= main_~i~0 7), 233542#(= main_~i~0 6), 233541#(= main_~i~0 5), 233540#(= main_~i~0 4), 233547#(= main_~i~0 11), 233546#(= main_~i~0 10), 233545#(= main_~i~0 9), 233544#(= main_~i~0 8), 233551#(= main_~i~0 15), 233550#(= main_~i~0 14), 233549#(= main_~i~0 13), 233548#(= main_~i~0 12), 233555#(= main_~i~0 19), 233554#(= main_~i~0 18), 233553#(= main_~i~0 17), 233552#(= main_~i~0 16), 233559#(= main_~i~0 23), 233558#(= main_~i~0 22), 233557#(= main_~i~0 21), 233556#(= main_~i~0 20), 233563#(= main_~i~0 27), 233562#(= main_~i~0 26), 233561#(= main_~i~0 25), 233560#(= main_~i~0 24), 233567#(= main_~i~0 31), 233566#(= main_~i~0 30), 233565#(= main_~i~0 29), 233564#(= main_~i~0 28), 233571#(= main_~i~0 35), 233570#(= main_~i~0 34), 233569#(= main_~i~0 33), 233568#(= main_~i~0 32), 233575#(= main_~i~0 39), 233574#(= main_~i~0 38), 233573#(= main_~i~0 37), 233572#(= main_~i~0 36), 233579#(= main_~i~0 43), 233578#(= main_~i~0 42), 233577#(= main_~i~0 41), 233576#(= main_~i~0 40), 233583#(= main_~i~0 47), 233582#(= main_~i~0 46), 233581#(= main_~i~0 45), 233580#(= main_~i~0 44), 233587#(= main_~i~0 51), 233586#(= main_~i~0 50), 233585#(= main_~i~0 49), 233584#(= main_~i~0 48), 233591#(= main_~i~0 55), 233590#(= main_~i~0 54), 233589#(= main_~i~0 53), 233588#(= main_~i~0 52), 233592#(and (< main_~i~0 100000) (<= 0 main_~i~0))] [2018-02-04 04:26:11,102 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 04:26:11,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:26:11,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:26:11,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:26:11,103 INFO L87 Difference]: Start difference. First operand 477 states and 561 transitions. Second operand 59 states. [2018-02-04 04:26:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:15,249 INFO L93 Difference]: Finished difference Result 10657 states and 12392 transitions. [2018-02-04 04:26:15,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:26:15,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 287 [2018-02-04 04:26:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:15,258 INFO L225 Difference]: With dead ends: 10657 [2018-02-04 04:26:15,258 INFO L226 Difference]: Without dead ends: 10657 [2018-02-04 04:26:15,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:26:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2018-02-04 04:26:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 482. [2018-02-04 04:26:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-04 04:26:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 567 transitions. [2018-02-04 04:26:15,297 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 567 transitions. Word has length 287 [2018-02-04 04:26:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:15,297 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 567 transitions. [2018-02-04 04:26:15,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:26:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 567 transitions. [2018-02-04 04:26:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 04:26:15,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:15,298 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:15,298 INFO L371 AbstractCegarLoop]: === Iteration 89 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1069320985, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:15,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2018-02-04 04:26:15,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:15,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 04:26:15,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-02-04 04:26:15,601 INFO L182 omatonBuilderFactory]: Interpolants [244866#(= main_~x~0 26), 244801#(= main_~x~0 13), 244736#(= 0 main_~x~0), 244871#(= main_~x~0 27), 244806#(= main_~x~0 14), 244741#(= 1 main_~x~0), 244811#(= main_~x~0 15), 244746#(= main_~x~0 2), 244751#(= main_~x~0 3), 244876#(= main_~x~0 28), 244881#(= main_~x~0 29), 244816#(= main_~x~0 16), 244886#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 244821#(= main_~x~0 17), 244756#(= main_~x~0 4), 244826#(= main_~x~0 18), 244761#(= main_~x~0 5), 244831#(= main_~x~0 19), 244766#(= main_~x~0 6), 244771#(= main_~x~0 7), 244836#(= main_~x~0 20), 244841#(= main_~x~0 21), 244776#(= main_~x~0 8), 244846#(= main_~x~0 22), 244781#(= main_~x~0 9), 244851#(= main_~x~0 23), 244786#(= main_~x~0 10), 244791#(= main_~x~0 11), 244856#(= main_~x~0 24), 244733#false, 244861#(= main_~x~0 25), 244732#true, 244796#(= main_~x~0 12)] [2018-02-04 04:26:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4443 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2018-02-04 04:26:15,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:26:15,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:26:15,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:26:15,601 INFO L87 Difference]: Start difference. First operand 482 states and 567 transitions. Second operand 33 states. [2018-02-04 04:26:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:16,499 INFO L93 Difference]: Finished difference Result 488 states and 574 transitions. [2018-02-04 04:26:16,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:26:16,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 317 [2018-02-04 04:26:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:16,500 INFO L225 Difference]: With dead ends: 488 [2018-02-04 04:26:16,500 INFO L226 Difference]: Without dead ends: 488 [2018-02-04 04:26:16,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:26:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-04 04:26:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2018-02-04 04:26:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-02-04 04:26:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 574 transitions. [2018-02-04 04:26:16,503 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 574 transitions. Word has length 317 [2018-02-04 04:26:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:16,503 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 574 transitions. [2018-02-04 04:26:16,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:26:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 574 transitions. [2018-02-04 04:26:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 04:26:16,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:16,504 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:16,504 INFO L371 AbstractCegarLoop]: === Iteration 90 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:16,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:17,290 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 04:26:17,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:17,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 04:26:17,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:17,306 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 04:26:17,306 INFO L182 omatonBuilderFactory]: Interpolants [245891#(= main_~i~0 24), 245890#(= main_~i~0 23), 245889#(= main_~i~0 22), 245888#(= main_~i~0 21), 245895#(= main_~i~0 28), 245894#(= main_~i~0 27), 245893#(= main_~i~0 26), 245892#(= main_~i~0 25), 245899#(= main_~i~0 32), 245898#(= main_~i~0 31), 245897#(= main_~i~0 30), 245896#(= main_~i~0 29), 245903#(= main_~i~0 36), 245902#(= main_~i~0 35), 245901#(= main_~i~0 34), 245900#(= main_~i~0 33), 245907#(= main_~i~0 40), 245906#(= main_~i~0 39), 245905#(= main_~i~0 38), 245904#(= main_~i~0 37), 245911#(= main_~i~0 44), 245910#(= main_~i~0 43), 245909#(= main_~i~0 42), 245908#(= main_~i~0 41), 245915#(= main_~i~0 48), 245914#(= main_~i~0 47), 245913#(= main_~i~0 46), 245912#(= main_~i~0 45), 245919#(= main_~i~0 52), 245918#(= main_~i~0 51), 245917#(= main_~i~0 50), 245916#(= main_~i~0 49), 245923#(= main_~i~0 56), 245922#(= main_~i~0 55), 245921#(= main_~i~0 54), 245920#(= main_~i~0 53), 245924#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 245863#true, 245867#(= main_~i~0 0), 245864#false, 245871#(= main_~i~0 4), 245870#(= main_~i~0 3), 245869#(= main_~i~0 2), 245868#(= main_~i~0 1), 245875#(= main_~i~0 8), 245874#(= main_~i~0 7), 245873#(= main_~i~0 6), 245872#(= main_~i~0 5), 245879#(= main_~i~0 12), 245878#(= main_~i~0 11), 245877#(= main_~i~0 10), 245876#(= main_~i~0 9), 245883#(= main_~i~0 16), 245882#(= main_~i~0 15), 245881#(= main_~i~0 14), 245880#(= main_~i~0 13), 245887#(= main_~i~0 20), 245886#(= main_~i~0 19), 245885#(= main_~i~0 18), 245884#(= main_~i~0 17)] [2018-02-04 04:26:17,307 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 04:26:17,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:26:17,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:26:17,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:26:17,307 INFO L87 Difference]: Start difference. First operand 488 states and 574 transitions. Second operand 60 states. [2018-02-04 04:26:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:21,571 INFO L93 Difference]: Finished difference Result 11189 states and 13012 transitions. [2018-02-04 04:26:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 04:26:21,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-02-04 04:26:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:21,580 INFO L225 Difference]: With dead ends: 11189 [2018-02-04 04:26:21,580 INFO L226 Difference]: Without dead ends: 11189 [2018-02-04 04:26:21,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:26:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2018-02-04 04:26:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 493. [2018-02-04 04:26:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-02-04 04:26:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 580 transitions. [2018-02-04 04:26:21,624 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 580 transitions. Word has length 292 [2018-02-04 04:26:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:21,624 INFO L432 AbstractCegarLoop]: Abstraction has 493 states and 580 transitions. [2018-02-04 04:26:21,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:26:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 580 transitions. [2018-02-04 04:26:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 04:26:21,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:21,625 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:21,625 INFO L371 AbstractCegarLoop]: === Iteration 91 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash 651486497, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:21,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2018-02-04 04:26:21,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:21,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 04:26:21,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-02-04 04:26:21,956 INFO L182 omatonBuilderFactory]: Interpolants [257731#(= main_~x~0 24), 257666#(= main_~x~0 11), 257607#true, 257671#(= main_~x~0 12), 257611#(= 0 main_~x~0), 257608#false, 257736#(= main_~x~0 25), 257741#(= main_~x~0 26), 257676#(= main_~x~0 13), 257746#(= main_~x~0 27), 257681#(= main_~x~0 14), 257616#(= 1 main_~x~0), 257751#(= main_~x~0 28), 257686#(= main_~x~0 15), 257621#(= main_~x~0 2), 257691#(= main_~x~0 16), 257626#(= main_~x~0 3), 257631#(= main_~x~0 4), 257756#(= main_~x~0 29), 257761#(= main_~x~0 30), 257696#(= main_~x~0 17), 257766#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 257701#(= main_~x~0 18), 257636#(= main_~x~0 5), 257706#(= main_~x~0 19), 257641#(= main_~x~0 6), 257711#(= main_~x~0 20), 257646#(= main_~x~0 7), 257651#(= main_~x~0 8), 257716#(= main_~x~0 21), 257721#(= main_~x~0 22), 257656#(= main_~x~0 9), 257726#(= main_~x~0 23), 257661#(= main_~x~0 10)] [2018-02-04 04:26:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2018-02-04 04:26:21,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 04:26:21,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 04:26:21,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:26:21,957 INFO L87 Difference]: Start difference. First operand 493 states and 580 transitions. Second operand 34 states. [2018-02-04 04:26:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:22,893 INFO L93 Difference]: Finished difference Result 499 states and 587 transitions. [2018-02-04 04:26:22,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:26:22,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 327 [2018-02-04 04:26:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:22,894 INFO L225 Difference]: With dead ends: 499 [2018-02-04 04:26:22,894 INFO L226 Difference]: Without dead ends: 499 [2018-02-04 04:26:22,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 04:26:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-04 04:26:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2018-02-04 04:26:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 04:26:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 587 transitions. [2018-02-04 04:26:22,897 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 587 transitions. Word has length 327 [2018-02-04 04:26:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:22,897 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 587 transitions. [2018-02-04 04:26:22,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 04:26:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 587 transitions. [2018-02-04 04:26:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 04:26:22,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:22,898 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:22,898 INFO L371 AbstractCegarLoop]: === Iteration 92 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1266675268, now seen corresponding path program 58 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:22,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:23,706 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 04:26:23,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:23,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 04:26:23,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:23,722 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 04:26:23,722 INFO L182 omatonBuilderFactory]: Interpolants [258819#(= main_~i~0 50), 258818#(= main_~i~0 49), 258817#(= main_~i~0 48), 258816#(= main_~i~0 47), 258823#(= main_~i~0 54), 258822#(= main_~i~0 53), 258821#(= main_~i~0 52), 258820#(= main_~i~0 51), 258827#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 258826#(= main_~i~0 57), 258825#(= main_~i~0 56), 258824#(= main_~i~0 55), 258766#false, 258765#true, 258771#(= main_~i~0 2), 258770#(= main_~i~0 1), 258769#(= main_~i~0 0), 258775#(= main_~i~0 6), 258774#(= main_~i~0 5), 258773#(= main_~i~0 4), 258772#(= main_~i~0 3), 258779#(= main_~i~0 10), 258778#(= main_~i~0 9), 258777#(= main_~i~0 8), 258776#(= main_~i~0 7), 258783#(= main_~i~0 14), 258782#(= main_~i~0 13), 258781#(= main_~i~0 12), 258780#(= main_~i~0 11), 258787#(= main_~i~0 18), 258786#(= main_~i~0 17), 258785#(= main_~i~0 16), 258784#(= main_~i~0 15), 258791#(= main_~i~0 22), 258790#(= main_~i~0 21), 258789#(= main_~i~0 20), 258788#(= main_~i~0 19), 258795#(= main_~i~0 26), 258794#(= main_~i~0 25), 258793#(= main_~i~0 24), 258792#(= main_~i~0 23), 258799#(= main_~i~0 30), 258798#(= main_~i~0 29), 258797#(= main_~i~0 28), 258796#(= main_~i~0 27), 258803#(= main_~i~0 34), 258802#(= main_~i~0 33), 258801#(= main_~i~0 32), 258800#(= main_~i~0 31), 258807#(= main_~i~0 38), 258806#(= main_~i~0 37), 258805#(= main_~i~0 36), 258804#(= main_~i~0 35), 258811#(= main_~i~0 42), 258810#(= main_~i~0 41), 258809#(= main_~i~0 40), 258808#(= main_~i~0 39), 258815#(= main_~i~0 46), 258814#(= main_~i~0 45), 258813#(= main_~i~0 44), 258812#(= main_~i~0 43)] [2018-02-04 04:26:23,722 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 04:26:23,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:26:23,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:26:23,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:26:23,723 INFO L87 Difference]: Start difference. First operand 499 states and 587 transitions. Second operand 61 states. [2018-02-04 04:26:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:28,246 INFO L93 Difference]: Finished difference Result 11733 states and 13646 transitions. [2018-02-04 04:26:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:26:28,246 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 297 [2018-02-04 04:26:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:28,256 INFO L225 Difference]: With dead ends: 11733 [2018-02-04 04:26:28,256 INFO L226 Difference]: Without dead ends: 11733 [2018-02-04 04:26:28,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:26:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11733 states. [2018-02-04 04:26:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 504. [2018-02-04 04:26:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-04 04:26:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 593 transitions. [2018-02-04 04:26:28,300 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 593 transitions. Word has length 297 [2018-02-04 04:26:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:28,301 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 593 transitions. [2018-02-04 04:26:28,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:26:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 593 transitions. [2018-02-04 04:26:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 04:26:28,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:28,302 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:28,302 INFO L371 AbstractCegarLoop]: === Iteration 93 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:28,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1632661303, now seen corresponding path program 59 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:28,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:29,143 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 04:26:29,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:29,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 04:26:29,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:29,159 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 04:26:29,159 INFO L182 omatonBuilderFactory]: Interpolants [271108#(= main_~i~0 39), 271109#(= main_~i~0 40), 271110#(= main_~i~0 41), 271111#(= main_~i~0 42), 271104#(= main_~i~0 35), 271105#(= main_~i~0 36), 271106#(= main_~i~0 37), 271107#(= main_~i~0 38), 271116#(= main_~i~0 47), 271117#(= main_~i~0 48), 271118#(= main_~i~0 49), 271119#(= main_~i~0 50), 271112#(= main_~i~0 43), 271113#(= main_~i~0 44), 271114#(= main_~i~0 45), 271115#(= main_~i~0 46), 271124#(= main_~i~0 55), 271125#(= main_~i~0 56), 271126#(= main_~i~0 57), 271127#(= main_~i~0 58), 271120#(= main_~i~0 51), 271121#(= main_~i~0 52), 271122#(= main_~i~0 53), 271123#(= main_~i~0 54), 271128#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 271069#(= main_~i~0 0), 271070#(= main_~i~0 1), 271071#(= main_~i~0 2), 271065#true, 271066#false, 271076#(= main_~i~0 7), 271077#(= main_~i~0 8), 271078#(= main_~i~0 9), 271079#(= main_~i~0 10), 271072#(= main_~i~0 3), 271073#(= main_~i~0 4), 271074#(= main_~i~0 5), 271075#(= main_~i~0 6), 271084#(= main_~i~0 15), 271085#(= main_~i~0 16), 271086#(= main_~i~0 17), 271087#(= main_~i~0 18), 271080#(= main_~i~0 11), 271081#(= main_~i~0 12), 271082#(= main_~i~0 13), 271083#(= main_~i~0 14), 271092#(= main_~i~0 23), 271093#(= main_~i~0 24), 271094#(= main_~i~0 25), 271095#(= main_~i~0 26), 271088#(= main_~i~0 19), 271089#(= main_~i~0 20), 271090#(= main_~i~0 21), 271091#(= main_~i~0 22), 271100#(= main_~i~0 31), 271101#(= main_~i~0 32), 271102#(= main_~i~0 33), 271103#(= main_~i~0 34), 271096#(= main_~i~0 27), 271097#(= main_~i~0 28), 271098#(= main_~i~0 29), 271099#(= main_~i~0 30)] [2018-02-04 04:26:29,160 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 04:26:29,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:26:29,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:26:29,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:26:29,160 INFO L87 Difference]: Start difference. First operand 504 states and 593 transitions. Second operand 62 states. [2018-02-04 04:26:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:33,811 INFO L93 Difference]: Finished difference Result 11935 states and 13881 transitions. [2018-02-04 04:26:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:26:33,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 302 [2018-02-04 04:26:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:33,820 INFO L225 Difference]: With dead ends: 11935 [2018-02-04 04:26:33,820 INFO L226 Difference]: Without dead ends: 11935 [2018-02-04 04:26:33,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:26:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11935 states. [2018-02-04 04:26:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11935 to 509. [2018-02-04 04:26:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-02-04 04:26:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 599 transitions. [2018-02-04 04:26:33,866 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 599 transitions. Word has length 302 [2018-02-04 04:26:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:33,866 INFO L432 AbstractCegarLoop]: Abstraction has 509 states and 599 transitions. [2018-02-04 04:26:33,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:26:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 599 transitions. [2018-02-04 04:26:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 04:26:33,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:33,868 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:33,868 INFO L371 AbstractCegarLoop]: === Iteration 94 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash 371905755, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:33,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 1987 trivial. 0 not checked. [2018-02-04 04:26:34,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:34,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 04:26:34,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-02-04 04:26:34,220 INFO L182 omatonBuilderFactory]: Interpolants [283652#(= main_~x~0 15), 283717#(= main_~x~0 28), 283712#(= main_~x~0 27), 283587#(= main_~x~0 2), 283597#(= main_~x~0 4), 283662#(= main_~x~0 17), 283727#(= main_~x~0 30), 283592#(= main_~x~0 3), 283657#(= main_~x~0 16), 283722#(= main_~x~0 29), 283732#(= main_~x~0 31), 283607#(= main_~x~0 6), 283602#(= main_~x~0 5), 283667#(= main_~x~0 18), 283612#(= main_~x~0 7), 283677#(= main_~x~0 20), 283672#(= main_~x~0 19), 283737#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 283622#(= main_~x~0 9), 283687#(= main_~x~0 22), 283617#(= main_~x~0 8), 283682#(= main_~x~0 21), 283692#(= main_~x~0 23), 283627#(= main_~x~0 10), 283573#true, 283637#(= main_~x~0 12), 283574#false, 283702#(= main_~x~0 25), 283632#(= main_~x~0 11), 283697#(= main_~x~0 24), 283582#(= 1 main_~x~0), 283647#(= main_~x~0 14), 283577#(= 0 main_~x~0), 283642#(= main_~x~0 13), 283707#(= main_~x~0 26)] [2018-02-04 04:26:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 1987 trivial. 0 not checked. [2018-02-04 04:26:34,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:26:34,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:26:34,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:26:34,220 INFO L87 Difference]: Start difference. First operand 509 states and 599 transitions. Second operand 35 states. [2018-02-04 04:26:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:35,214 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-02-04 04:26:35,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:26:35,215 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 337 [2018-02-04 04:26:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:35,215 INFO L225 Difference]: With dead ends: 515 [2018-02-04 04:26:35,215 INFO L226 Difference]: Without dead ends: 515 [2018-02-04 04:26:35,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:26:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-04 04:26:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-02-04 04:26:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-02-04 04:26:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-02-04 04:26:35,218 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 337 [2018-02-04 04:26:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:35,218 INFO L432 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-02-04 04:26:35,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:26:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-02-04 04:26:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 04:26:35,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:35,219 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:35,219 INFO L371 AbstractCegarLoop]: === Iteration 95 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1156168036, now seen corresponding path program 60 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:35,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:36,131 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 04:26:36,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:36,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 04:26:36,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:26:36,147 INFO L182 omatonBuilderFactory]: Interpolants [284804#(= main_~i~0 32), 284805#(= main_~i~0 33), 284806#(= main_~i~0 34), 284807#(= main_~i~0 35), 284800#(= main_~i~0 28), 284801#(= main_~i~0 29), 284802#(= main_~i~0 30), 284803#(= main_~i~0 31), 284812#(= main_~i~0 40), 284813#(= main_~i~0 41), 284814#(= main_~i~0 42), 284815#(= main_~i~0 43), 284808#(= main_~i~0 36), 284809#(= main_~i~0 37), 284810#(= main_~i~0 38), 284811#(= main_~i~0 39), 284820#(= main_~i~0 48), 284821#(= main_~i~0 49), 284822#(= main_~i~0 50), 284823#(= main_~i~0 51), 284816#(= main_~i~0 44), 284817#(= main_~i~0 45), 284818#(= main_~i~0 46), 284819#(= main_~i~0 47), 284828#(= main_~i~0 56), 284829#(= main_~i~0 57), 284830#(= main_~i~0 58), 284831#(= main_~i~0 59), 284824#(= main_~i~0 52), 284825#(= main_~i~0 53), 284826#(= main_~i~0 54), 284827#(= main_~i~0 55), 284832#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 284772#(= main_~i~0 0), 284773#(= main_~i~0 1), 284774#(= main_~i~0 2), 284775#(= main_~i~0 3), 284768#true, 284769#false, 284780#(= main_~i~0 8), 284781#(= main_~i~0 9), 284782#(= main_~i~0 10), 284783#(= main_~i~0 11), 284776#(= main_~i~0 4), 284777#(= main_~i~0 5), 284778#(= main_~i~0 6), 284779#(= main_~i~0 7), 284788#(= main_~i~0 16), 284789#(= main_~i~0 17), 284790#(= main_~i~0 18), 284791#(= main_~i~0 19), 284784#(= main_~i~0 12), 284785#(= main_~i~0 13), 284786#(= main_~i~0 14), 284787#(= main_~i~0 15), 284796#(= main_~i~0 24), 284797#(= main_~i~0 25), 284798#(= main_~i~0 26), 284799#(= main_~i~0 27), 284792#(= main_~i~0 20), 284793#(= main_~i~0 21), 284794#(= main_~i~0 22), 284795#(= main_~i~0 23)] [2018-02-04 04:26:36,147 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 04:26:36,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:26:36,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:26:36,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:26:36,148 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 63 states. [2018-02-04 04:26:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:40,964 INFO L93 Difference]: Finished difference Result 12497 states and 14536 transitions. [2018-02-04 04:26:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 04:26:40,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 307 [2018-02-04 04:26:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:40,974 INFO L225 Difference]: With dead ends: 12497 [2018-02-04 04:26:40,974 INFO L226 Difference]: Without dead ends: 12497 [2018-02-04 04:26:40,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:26:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2018-02-04 04:26:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 520. [2018-02-04 04:26:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-02-04 04:26:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 612 transitions. [2018-02-04 04:26:41,022 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 612 transitions. Word has length 307 [2018-02-04 04:26:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:41,022 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 612 transitions. [2018-02-04 04:26:41,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:26:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 612 transitions. [2018-02-04 04:26:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 04:26:41,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:41,023 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:41,023 INFO L371 AbstractCegarLoop]: === Iteration 96 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1119372887, now seen corresponding path program 61 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:41,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:41,974 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 04:26:41,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:41,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 04:26:41,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:41,990 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 04:26:41,991 INFO L182 omatonBuilderFactory]: Interpolants [297860#(= main_~i~0 6), 297861#(= main_~i~0 7), 297862#(= main_~i~0 8), 297863#(= main_~i~0 9), 297856#(= main_~i~0 2), 297857#(= main_~i~0 3), 297858#(= main_~i~0 4), 297859#(= main_~i~0 5), 297868#(= main_~i~0 14), 297869#(= main_~i~0 15), 297870#(= main_~i~0 16), 297871#(= main_~i~0 17), 297864#(= main_~i~0 10), 297865#(= main_~i~0 11), 297866#(= main_~i~0 12), 297867#(= main_~i~0 13), 297876#(= main_~i~0 22), 297877#(= main_~i~0 23), 297878#(= main_~i~0 24), 297879#(= main_~i~0 25), 297872#(= main_~i~0 18), 297873#(= main_~i~0 19), 297874#(= main_~i~0 20), 297875#(= main_~i~0 21), 297884#(= main_~i~0 30), 297885#(= main_~i~0 31), 297886#(= main_~i~0 32), 297887#(= main_~i~0 33), 297880#(= main_~i~0 26), 297881#(= main_~i~0 27), 297882#(= main_~i~0 28), 297883#(= main_~i~0 29), 297892#(= main_~i~0 38), 297893#(= main_~i~0 39), 297894#(= main_~i~0 40), 297895#(= main_~i~0 41), 297888#(= main_~i~0 34), 297889#(= main_~i~0 35), 297890#(= main_~i~0 36), 297891#(= main_~i~0 37), 297900#(= main_~i~0 46), 297901#(= main_~i~0 47), 297902#(= main_~i~0 48), 297903#(= main_~i~0 49), 297896#(= main_~i~0 42), 297897#(= main_~i~0 43), 297898#(= main_~i~0 44), 297899#(= main_~i~0 45), 297908#(= main_~i~0 54), 297909#(= main_~i~0 55), 297910#(= main_~i~0 56), 297911#(= main_~i~0 57), 297904#(= main_~i~0 50), 297905#(= main_~i~0 51), 297906#(= main_~i~0 52), 297907#(= main_~i~0 53), 297912#(= main_~i~0 58), 297913#(= main_~i~0 59), 297914#(= main_~i~0 60), 297915#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 297854#(= main_~i~0 0), 297855#(= main_~i~0 1), 297850#true, 297851#false] [2018-02-04 04:26:41,991 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 04:26:41,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 04:26:41,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 04:26:41,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:26:41,992 INFO L87 Difference]: Start difference. First operand 520 states and 612 transitions. Second operand 64 states. [2018-02-04 04:26:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:46,977 INFO L93 Difference]: Finished difference Result 12705 states and 14778 transitions. [2018-02-04 04:26:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 04:26:46,978 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 312 [2018-02-04 04:26:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:47,001 INFO L225 Difference]: With dead ends: 12705 [2018-02-04 04:26:47,001 INFO L226 Difference]: Without dead ends: 12705 [2018-02-04 04:26:47,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 04:26:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2018-02-04 04:26:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 525. [2018-02-04 04:26:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-02-04 04:26:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 618 transitions. [2018-02-04 04:26:47,042 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 618 transitions. Word has length 312 [2018-02-04 04:26:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:47,042 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 618 transitions. [2018-02-04 04:26:47,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 04:26:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 618 transitions. [2018-02-04 04:26:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-02-04 04:26:47,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:47,043 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:47,043 INFO L371 AbstractCegarLoop]: === Iteration 97 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1347150869, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:47,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5382 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-02-04 04:26:47,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:47,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 04:26:47,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-02-04 04:26:47,418 INFO L182 omatonBuilderFactory]: Interpolants [311300#(= main_~x~0 30), 311175#(= main_~x~0 5), 311170#(= main_~x~0 4), 311235#(= main_~x~0 17), 311180#(= main_~x~0 6), 311245#(= main_~x~0 19), 311310#(= main_~x~0 32), 311240#(= main_~x~0 18), 311305#(= main_~x~0 31), 311190#(= main_~x~0 8), 311255#(= main_~x~0 21), 311185#(= main_~x~0 7), 311250#(= main_~x~0 20), 311315#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 311260#(= main_~x~0 22), 311195#(= main_~x~0 9), 311205#(= main_~x~0 11), 311270#(= main_~x~0 24), 311200#(= main_~x~0 10), 311265#(= main_~x~0 23), 311150#(= 0 main_~x~0), 311215#(= main_~x~0 13), 311146#true, 311210#(= main_~x~0 12), 311147#false, 311275#(= main_~x~0 25), 311220#(= main_~x~0 14), 311285#(= main_~x~0 27), 311280#(= main_~x~0 26), 311155#(= 1 main_~x~0), 311165#(= main_~x~0 3), 311230#(= main_~x~0 16), 311295#(= main_~x~0 29), 311160#(= main_~x~0 2), 311225#(= main_~x~0 15), 311290#(= main_~x~0 28)] [2018-02-04 04:26:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5382 backedges. 0 proven. 3267 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-02-04 04:26:47,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 04:26:47,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 04:26:47,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:26:47,419 INFO L87 Difference]: Start difference. First operand 525 states and 618 transitions. Second operand 36 states. [2018-02-04 04:26:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:48,491 INFO L93 Difference]: Finished difference Result 531 states and 625 transitions. [2018-02-04 04:26:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:26:48,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-02-04 04:26:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:48,492 INFO L225 Difference]: With dead ends: 531 [2018-02-04 04:26:48,492 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 04:26:48,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:26:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 04:26:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-02-04 04:26:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-04 04:26:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 625 transitions. [2018-02-04 04:26:48,494 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 625 transitions. Word has length 347 [2018-02-04 04:26:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:48,495 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 625 transitions. [2018-02-04 04:26:48,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 04:26:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 625 transitions. [2018-02-04 04:26:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 04:26:48,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:48,496 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:48,496 INFO L371 AbstractCegarLoop]: === Iteration 98 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1164450948, now seen corresponding path program 62 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:48,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:49,597 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 04:26:49,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:49,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 04:26:49,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:49,612 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 04:26:49,612 INFO L182 omatonBuilderFactory]: Interpolants [312382#(= main_~i~0 0), 312383#(= main_~i~0 1), 312378#true, 312379#false, 312388#(= main_~i~0 6), 312389#(= main_~i~0 7), 312390#(= main_~i~0 8), 312391#(= main_~i~0 9), 312384#(= main_~i~0 2), 312385#(= main_~i~0 3), 312386#(= main_~i~0 4), 312387#(= main_~i~0 5), 312396#(= main_~i~0 14), 312397#(= main_~i~0 15), 312398#(= main_~i~0 16), 312399#(= main_~i~0 17), 312392#(= main_~i~0 10), 312393#(= main_~i~0 11), 312394#(= main_~i~0 12), 312395#(= main_~i~0 13), 312404#(= main_~i~0 22), 312405#(= main_~i~0 23), 312406#(= main_~i~0 24), 312407#(= main_~i~0 25), 312400#(= main_~i~0 18), 312401#(= main_~i~0 19), 312402#(= main_~i~0 20), 312403#(= main_~i~0 21), 312412#(= main_~i~0 30), 312413#(= main_~i~0 31), 312414#(= main_~i~0 32), 312415#(= main_~i~0 33), 312408#(= main_~i~0 26), 312409#(= main_~i~0 27), 312410#(= main_~i~0 28), 312411#(= main_~i~0 29), 312420#(= main_~i~0 38), 312421#(= main_~i~0 39), 312422#(= main_~i~0 40), 312423#(= main_~i~0 41), 312416#(= main_~i~0 34), 312417#(= main_~i~0 35), 312418#(= main_~i~0 36), 312419#(= main_~i~0 37), 312428#(= main_~i~0 46), 312429#(= main_~i~0 47), 312430#(= main_~i~0 48), 312431#(= main_~i~0 49), 312424#(= main_~i~0 42), 312425#(= main_~i~0 43), 312426#(= main_~i~0 44), 312427#(= main_~i~0 45), 312436#(= main_~i~0 54), 312437#(= main_~i~0 55), 312438#(= main_~i~0 56), 312439#(= main_~i~0 57), 312432#(= main_~i~0 50), 312433#(= main_~i~0 51), 312434#(= main_~i~0 52), 312435#(= main_~i~0 53), 312444#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 312440#(= main_~i~0 58), 312441#(= main_~i~0 59), 312442#(= main_~i~0 60), 312443#(= main_~i~0 61)] [2018-02-04 04:26:49,613 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 04:26:49,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 04:26:49,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 04:26:49,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:26:49,613 INFO L87 Difference]: Start difference. First operand 531 states and 625 transitions. Second operand 65 states. [2018-02-04 04:26:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:26:54,708 INFO L93 Difference]: Finished difference Result 13285 states and 15454 transitions. [2018-02-04 04:26:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:26:54,709 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 317 [2018-02-04 04:26:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:26:54,720 INFO L225 Difference]: With dead ends: 13285 [2018-02-04 04:26:54,720 INFO L226 Difference]: Without dead ends: 13285 [2018-02-04 04:26:54,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:26:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2018-02-04 04:26:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 536. [2018-02-04 04:26:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-04 04:26:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 631 transitions. [2018-02-04 04:26:54,788 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 631 transitions. Word has length 317 [2018-02-04 04:26:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:26:54,788 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 631 transitions. [2018-02-04 04:26:54,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 04:26:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 631 transitions. [2018-02-04 04:26:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 04:26:54,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:26:54,789 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 04:26:54,789 INFO L371 AbstractCegarLoop]: === Iteration 99 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:26:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2115351927, now seen corresponding path program 63 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:26:54,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:26:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:26:55,741 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 04:26:55,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:26:55,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 04:26:55,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:26:55,757 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 04:26:55,757 INFO L182 omatonBuilderFactory]: Interpolants [326276#(= main_~i~0 6), 326277#(= main_~i~0 7), 326278#(= main_~i~0 8), 326279#(= main_~i~0 9), 326272#(= main_~i~0 2), 326273#(= main_~i~0 3), 326274#(= main_~i~0 4), 326275#(= main_~i~0 5), 326284#(= main_~i~0 14), 326285#(= main_~i~0 15), 326286#(= main_~i~0 16), 326287#(= main_~i~0 17), 326280#(= main_~i~0 10), 326281#(= main_~i~0 11), 326282#(= main_~i~0 12), 326283#(= main_~i~0 13), 326292#(= main_~i~0 22), 326293#(= main_~i~0 23), 326294#(= main_~i~0 24), 326295#(= main_~i~0 25), 326288#(= main_~i~0 18), 326289#(= main_~i~0 19), 326290#(= main_~i~0 20), 326291#(= main_~i~0 21), 326300#(= main_~i~0 30), 326301#(= main_~i~0 31), 326302#(= main_~i~0 32), 326303#(= main_~i~0 33), 326296#(= main_~i~0 26), 326297#(= main_~i~0 27), 326298#(= main_~i~0 28), 326299#(= main_~i~0 29), 326308#(= main_~i~0 38), 326309#(= main_~i~0 39), 326310#(= main_~i~0 40), 326311#(= main_~i~0 41), 326304#(= main_~i~0 34), 326305#(= main_~i~0 35), 326306#(= main_~i~0 36), 326307#(= main_~i~0 37), 326316#(= main_~i~0 46), 326317#(= main_~i~0 47), 326318#(= main_~i~0 48), 326319#(= main_~i~0 49), 326312#(= main_~i~0 42), 326313#(= main_~i~0 43), 326314#(= main_~i~0 44), 326315#(= main_~i~0 45), 326324#(= main_~i~0 54), 326325#(= main_~i~0 55), 326326#(= main_~i~0 56), 326327#(= main_~i~0 57), 326320#(= main_~i~0 50), 326321#(= main_~i~0 51), 326322#(= main_~i~0 52), 326323#(= main_~i~0 53), 326332#(= main_~i~0 62), 326333#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 326328#(= main_~i~0 58), 326329#(= main_~i~0 59), 326330#(= main_~i~0 60), 326331#(= main_~i~0 61), 326270#(= main_~i~0 0), 326271#(= main_~i~0 1), 326266#true, 326267#false] [2018-02-04 04:26:55,758 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 04:26:55,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 04:26:55,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 04:26:55,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:26:55,758 INFO L87 Difference]: Start difference. First operand 536 states and 631 transitions. Second operand 66 states. [2018-02-04 04:27:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:01,022 INFO L93 Difference]: Finished difference Result 13499 states and 15703 transitions. [2018-02-04 04:27:01,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 04:27:01,022 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 322 [2018-02-04 04:27:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:01,033 INFO L225 Difference]: With dead ends: 13499 [2018-02-04 04:27:01,033 INFO L226 Difference]: Without dead ends: 13499 [2018-02-04 04:27:01,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:27:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13499 states. [2018-02-04 04:27:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13499 to 541. [2018-02-04 04:27:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-02-04 04:27:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 637 transitions. [2018-02-04 04:27:01,088 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 637 transitions. Word has length 322 [2018-02-04 04:27:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:01,088 INFO L432 AbstractCegarLoop]: Abstraction has 541 states and 637 transitions. [2018-02-04 04:27:01,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 04:27:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 637 transitions. [2018-02-04 04:27:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 04:27:01,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:01,089 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:01,089 INFO L371 AbstractCegarLoop]: === Iteration 100 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 930525903, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:01,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5715 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2018-02-04 04:27:01,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:01,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 04:27:01,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-02-04 04:27:01,486 INFO L182 omatonBuilderFactory]: Interpolants [340548#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 340423#(= main_~x~0 9), 340483#(= main_~x~0 21), 340418#(= main_~x~0 8), 340493#(= main_~x~0 23), 340428#(= main_~x~0 10), 340488#(= main_~x~0 22), 340375#false, 340503#(= main_~x~0 25), 340374#true, 340438#(= main_~x~0 12), 340433#(= main_~x~0 11), 340498#(= main_~x~0 24), 340508#(= main_~x~0 26), 340383#(= 1 main_~x~0), 340443#(= main_~x~0 13), 340378#(= 0 main_~x~0), 340453#(= main_~x~0 15), 340388#(= main_~x~0 2), 340518#(= main_~x~0 28), 340513#(= main_~x~0 27), 340448#(= main_~x~0 14), 340463#(= main_~x~0 17), 340398#(= main_~x~0 4), 340393#(= main_~x~0 3), 340523#(= main_~x~0 29), 340458#(= main_~x~0 16), 340533#(= main_~x~0 31), 340468#(= main_~x~0 18), 340528#(= main_~x~0 30), 340403#(= main_~x~0 5), 340413#(= main_~x~0 7), 340543#(= main_~x~0 33), 340478#(= main_~x~0 20), 340473#(= main_~x~0 19), 340408#(= main_~x~0 6), 340538#(= main_~x~0 32)] [2018-02-04 04:27:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5715 backedges. 0 proven. 3468 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2018-02-04 04:27:01,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:27:01,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:27:01,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:27:01,487 INFO L87 Difference]: Start difference. First operand 541 states and 637 transitions. Second operand 37 states. [2018-02-04 04:27:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:02,842 INFO L93 Difference]: Finished difference Result 547 states and 644 transitions. [2018-02-04 04:27:02,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:27:02,842 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 357 [2018-02-04 04:27:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:02,843 INFO L225 Difference]: With dead ends: 547 [2018-02-04 04:27:02,843 INFO L226 Difference]: Without dead ends: 547 [2018-02-04 04:27:02,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:27:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-04 04:27:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2018-02-04 04:27:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-02-04 04:27:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 644 transitions. [2018-02-04 04:27:02,845 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 644 transitions. Word has length 357 [2018-02-04 04:27:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:02,845 INFO L432 AbstractCegarLoop]: Abstraction has 547 states and 644 transitions. [2018-02-04 04:27:02,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:27:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 644 transitions. [2018-02-04 04:27:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 04:27:02,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:02,847 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:02,847 INFO L371 AbstractCegarLoop]: === Iteration 101 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1310529444, now seen corresponding path program 64 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:02,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:04,164 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 04:27:04,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:04,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 04:27:04,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:04,182 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 04:27:04,182 INFO L182 omatonBuilderFactory]: Interpolants [341644#false, 341647#(= main_~i~0 0), 341643#true, 341653#(= main_~i~0 6), 341652#(= main_~i~0 5), 341655#(= main_~i~0 8), 341654#(= main_~i~0 7), 341649#(= main_~i~0 2), 341648#(= main_~i~0 1), 341651#(= main_~i~0 4), 341650#(= main_~i~0 3), 341661#(= main_~i~0 14), 341660#(= main_~i~0 13), 341663#(= main_~i~0 16), 341662#(= main_~i~0 15), 341657#(= main_~i~0 10), 341656#(= main_~i~0 9), 341659#(= main_~i~0 12), 341658#(= main_~i~0 11), 341669#(= main_~i~0 22), 341668#(= main_~i~0 21), 341671#(= main_~i~0 24), 341670#(= main_~i~0 23), 341665#(= main_~i~0 18), 341664#(= main_~i~0 17), 341667#(= main_~i~0 20), 341666#(= main_~i~0 19), 341677#(= main_~i~0 30), 341676#(= main_~i~0 29), 341679#(= main_~i~0 32), 341678#(= main_~i~0 31), 341673#(= main_~i~0 26), 341672#(= main_~i~0 25), 341675#(= main_~i~0 28), 341674#(= main_~i~0 27), 341685#(= main_~i~0 38), 341684#(= main_~i~0 37), 341687#(= main_~i~0 40), 341686#(= main_~i~0 39), 341681#(= main_~i~0 34), 341680#(= main_~i~0 33), 341683#(= main_~i~0 36), 341682#(= main_~i~0 35), 341693#(= main_~i~0 46), 341692#(= main_~i~0 45), 341695#(= main_~i~0 48), 341694#(= main_~i~0 47), 341689#(= main_~i~0 42), 341688#(= main_~i~0 41), 341691#(= main_~i~0 44), 341690#(= main_~i~0 43), 341701#(= main_~i~0 54), 341700#(= main_~i~0 53), 341703#(= main_~i~0 56), 341702#(= main_~i~0 55), 341697#(= main_~i~0 50), 341696#(= main_~i~0 49), 341699#(= main_~i~0 52), 341698#(= main_~i~0 51), 341709#(= main_~i~0 62), 341708#(= main_~i~0 61), 341711#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 341710#(= main_~i~0 63), 341705#(= main_~i~0 58), 341704#(= main_~i~0 57), 341707#(= main_~i~0 60), 341706#(= main_~i~0 59)] [2018-02-04 04:27:04,182 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 04:27:04,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:27:04,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:27:04,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:27:04,183 INFO L87 Difference]: Start difference. First operand 547 states and 644 transitions. Second operand 67 states. [2018-02-04 04:27:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:10,010 INFO L93 Difference]: Finished difference Result 14097 states and 16400 transitions. [2018-02-04 04:27:10,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 04:27:10,010 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 04:27:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:10,022 INFO L225 Difference]: With dead ends: 14097 [2018-02-04 04:27:10,022 INFO L226 Difference]: Without dead ends: 14097 [2018-02-04 04:27:10,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:27:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2018-02-04 04:27:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 552. [2018-02-04 04:27:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-02-04 04:27:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 650 transitions. [2018-02-04 04:27:10,089 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 650 transitions. Word has length 327 [2018-02-04 04:27:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:10,090 INFO L432 AbstractCegarLoop]: Abstraction has 552 states and 650 transitions. [2018-02-04 04:27:10,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:27:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 650 transitions. [2018-02-04 04:27:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 04:27:10,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:10,091 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:10,091 INFO L371 AbstractCegarLoop]: === Iteration 102 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1354056553, now seen corresponding path program 65 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:10,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:11,140 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 04:27:11,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:11,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 04:27:11,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:11,156 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 04:27:11,156 INFO L182 omatonBuilderFactory]: Interpolants [356365#(= main_~i~0 0), 356367#(= main_~i~0 2), 356366#(= main_~i~0 1), 356361#true, 356362#false, 356373#(= main_~i~0 8), 356372#(= main_~i~0 7), 356375#(= main_~i~0 10), 356374#(= main_~i~0 9), 356369#(= main_~i~0 4), 356368#(= main_~i~0 3), 356371#(= main_~i~0 6), 356370#(= main_~i~0 5), 356381#(= main_~i~0 16), 356380#(= main_~i~0 15), 356383#(= main_~i~0 18), 356382#(= main_~i~0 17), 356377#(= main_~i~0 12), 356376#(= main_~i~0 11), 356379#(= main_~i~0 14), 356378#(= main_~i~0 13), 356389#(= main_~i~0 24), 356388#(= main_~i~0 23), 356391#(= main_~i~0 26), 356390#(= main_~i~0 25), 356385#(= main_~i~0 20), 356384#(= main_~i~0 19), 356387#(= main_~i~0 22), 356386#(= main_~i~0 21), 356397#(= main_~i~0 32), 356396#(= main_~i~0 31), 356399#(= main_~i~0 34), 356398#(= main_~i~0 33), 356393#(= main_~i~0 28), 356392#(= main_~i~0 27), 356395#(= main_~i~0 30), 356394#(= main_~i~0 29), 356405#(= main_~i~0 40), 356404#(= main_~i~0 39), 356407#(= main_~i~0 42), 356406#(= main_~i~0 41), 356401#(= main_~i~0 36), 356400#(= main_~i~0 35), 356403#(= main_~i~0 38), 356402#(= main_~i~0 37), 356413#(= main_~i~0 48), 356412#(= main_~i~0 47), 356415#(= main_~i~0 50), 356414#(= main_~i~0 49), 356409#(= main_~i~0 44), 356408#(= main_~i~0 43), 356411#(= main_~i~0 46), 356410#(= main_~i~0 45), 356421#(= main_~i~0 56), 356420#(= main_~i~0 55), 356423#(= main_~i~0 58), 356422#(= main_~i~0 57), 356417#(= main_~i~0 52), 356416#(= main_~i~0 51), 356419#(= main_~i~0 54), 356418#(= main_~i~0 53), 356429#(= main_~i~0 64), 356428#(= main_~i~0 63), 356430#(and (< main_~i~0 100000) (<= 0 main_~i~0)), 356425#(= main_~i~0 60), 356424#(= main_~i~0 59), 356427#(= main_~i~0 62), 356426#(= main_~i~0 61)] [2018-02-04 04:27:11,157 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 04:27:11,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 04:27:11,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 04:27:11,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:27:11,158 INFO L87 Difference]: Start difference. First operand 552 states and 650 transitions. Second operand 68 states. [2018-02-04 04:27:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:16,832 INFO L93 Difference]: Finished difference Result 14317 states and 16656 transitions. [2018-02-04 04:27:16,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:27:16,833 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 332 [2018-02-04 04:27:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:16,845 INFO L225 Difference]: With dead ends: 14317 [2018-02-04 04:27:16,845 INFO L226 Difference]: Without dead ends: 14317 [2018-02-04 04:27:16,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:27:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14317 states. [2018-02-04 04:27:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14317 to 557. [2018-02-04 04:27:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-02-04 04:27:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 656 transitions. [2018-02-04 04:27:16,904 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 656 transitions. Word has length 332 [2018-02-04 04:27:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:16,904 INFO L432 AbstractCegarLoop]: Abstraction has 557 states and 656 transitions. [2018-02-04 04:27:16,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 04:27:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 656 transitions. [2018-02-04 04:27:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-02-04 04:27:16,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:16,905 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:16,905 INFO L371 AbstractCegarLoop]: === Iteration 103 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash -400432887, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:16,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:27:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6058 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2018-02-04 04:27:17,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:27:17,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 04:27:17,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 04:27:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-02-04 04:27:17,315 INFO L182 omatonBuilderFactory]: Interpolants [371399#(= main_~x~0 18), 371334#(= main_~x~0 5), 371329#(= main_~x~0 4), 371459#(= main_~x~0 30), 371394#(= main_~x~0 17), 371469#(= main_~x~0 32), 371404#(= main_~x~0 19), 371464#(= main_~x~0 31), 371339#(= main_~x~0 6), 371349#(= main_~x~0 8), 371479#(= main_~x~0 34), 371414#(= main_~x~0 21), 371409#(= main_~x~0 20), 371344#(= main_~x~0 7), 371474#(= main_~x~0 33), 371484#(and (< main_~x~0 100000) (<= 0 main_~x~0)), 371359#(= main_~x~0 10), 371419#(= main_~x~0 22), 371354#(= main_~x~0 9), 371429#(= main_~x~0 24), 371364#(= main_~x~0 11), 371424#(= main_~x~0 23), 371309#(= 0 main_~x~0), 371439#(= main_~x~0 26), 371374#(= main_~x~0 13), 371305#true, 371369#(= main_~x~0 12), 371306#false, 371434#(= main_~x~0 25), 371444#(= main_~x~0 27), 371319#(= main_~x~0 2), 371379#(= main_~x~0 14), 371314#(= 1 main_~x~0), 371389#(= main_~x~0 16), 371324#(= main_~x~0 3), 371454#(= main_~x~0 29), 371449#(= main_~x~0 28), 371384#(= main_~x~0 15)] [2018-02-04 04:27:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6058 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2018-02-04 04:27:17,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:27:17,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:27:17,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:27:17,315 INFO L87 Difference]: Start difference. First operand 557 states and 656 transitions. Second operand 38 states. [2018-02-04 04:27:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:27:18,505 INFO L93 Difference]: Finished difference Result 563 states and 663 transitions. [2018-02-04 04:27:18,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:27:18,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 367 [2018-02-04 04:27:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:27:18,506 INFO L225 Difference]: With dead ends: 563 [2018-02-04 04:27:18,506 INFO L226 Difference]: Without dead ends: 563 [2018-02-04 04:27:18,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:27:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-02-04 04:27:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-02-04 04:27:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-02-04 04:27:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 663 transitions. [2018-02-04 04:27:18,509 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 663 transitions. Word has length 367 [2018-02-04 04:27:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:27:18,509 INFO L432 AbstractCegarLoop]: Abstraction has 563 states and 663 transitions. [2018-02-04 04:27:18,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:27:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 663 transitions. [2018-02-04 04:27:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 04:27:18,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:27:18,510 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 04:27:18,510 INFO L371 AbstractCegarLoop]: === Iteration 104 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:27:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash 576017724, now seen corresponding path program 66 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 04:27:18,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 04:27:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-02-04 04:27:18,876 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:27:18,879 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:27:18,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:27:18 BoogieIcfgContainer [2018-02-04 04:27:18,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:27:18,879 INFO L168 Benchmark]: Toolchain (without parser) took 181417.26 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 622.3 MB). Free memory was 353.8 MB in the beginning and 387.1 MB in the end (delta: -33.3 MB). Peak memory consumption was 589.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:27:18,880 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 398.5 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:27:18,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.50 ms. Allocated memory is still 398.5 MB. Free memory was 353.8 MB in the beginning and 345.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:27:18,880 INFO L168 Benchmark]: Boogie Preprocessor took 20.11 ms. Allocated memory is still 398.5 MB. Free memory was 345.8 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:27:18,880 INFO L168 Benchmark]: RCFGBuilder took 132.03 ms. Allocated memory is still 398.5 MB. Free memory was 344.4 MB in the beginning and 331.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:27:18,880 INFO L168 Benchmark]: TraceAbstraction took 181102.63 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 622.3 MB). Free memory was 331.2 MB in the beginning and 387.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 566.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:27:18,881 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.14 ms. Allocated memory is still 398.5 MB. Free memory is still 359.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.50 ms. Allocated memory is still 398.5 MB. Free memory was 353.8 MB in the beginning and 345.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.11 ms. Allocated memory is still 398.5 MB. Free memory was 345.8 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 132.03 ms. Allocated memory is still 398.5 MB. Free memory was 344.4 MB in the beginning and 331.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 181102.63 ms. Allocated memory was 398.5 MB in the beginning and 1.0 GB in the end (delta: 622.3 MB). Free memory was 331.2 MB in the beginning and 387.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 566.5 MB. 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 analyzing trace of length 338 with TraceHistMax 67, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 338 with TraceHistMax 67, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 338 with TraceHistMax 67, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 338 with TraceHistMax 67, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 338 with TraceHistMax 67, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 181.0s OverallTime, 104 OverallIterations, 67 TraceHistogramMax, 144.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22035 SDtfs, 28302 SDslu, 738880 SDs, 0 SdLazy, 728780 SolverSat, 3953 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4452 GetRequests, 1572 SyntacticMatches, 0 SemanticMatches, 2880 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 28668/306488 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 103 MinimizatonAttempts, 307030 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 18116 NumberOfCodeBlocks, 18116 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 18013 ConstructedInterpolants, 0 QuantifiedInterpolants, 11154315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 28668/306488 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_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-27-18-885.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_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-27-18-885.csv Completed graceful shutdown