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/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-29 23:22:28,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:22:28,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:22:28,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:22:28,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:22:28,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:22:28,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:22:28,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:22:28,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:22:28,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:22:28,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:22:28,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:22:28,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:22:28,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:22:28,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:22:28,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:22:28,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:22:28,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:22:28,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:22:28,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:22:28,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:22:28,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:22:28,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:22:28,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:22:28,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:22:28,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:22:28,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:22:28,411 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:22:28,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:22:28,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:22:28,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:22:28,412 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:22:28,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:22:28,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:22:28,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:22:28,418 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:22:28,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:22:28,418 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:22:28,418 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:22:28,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-29 23:22:28,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-29 23:22:28,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:22:28,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:22:28,420 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:22:28,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:22:28,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:22:28,422 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:22:28,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:22:28,445 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:22:28,447 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:22:28,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:22:28,448 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:22:28,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-01-29 23:22:28,511 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:22:28,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:22:28,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:22:28,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:22:28,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:22:28,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395107c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28, skipping insertion in model container [2018-01-29 23:22:28,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,527 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:22:28,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:22:28,603 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:22:28,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:22:28,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28 WrapperNode [2018-01-29 23:22:28,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:22:28,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:22:28,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:22:28,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:22:28,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... [2018-01-29 23:22:28,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:22:28,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:22:28,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:22:28,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:22:28,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (1/1) ... No working directory specified, using /home/daniel/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-01-29 23:22:28,675 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:22:28,675 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:22:28,675 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-29 23:22:28,675 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:22:28,675 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:22:28,675 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-29 23:22:28,675 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:22:28,675 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:22:28,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:22:28,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:22:28,977 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:22:28,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:22:28 BoogieIcfgContainer [2018-01-29 23:22:28,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:22:28,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:22:28,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:22:28,980 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:22:28,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:22:28" (1/3) ... [2018-01-29 23:22:28,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fa3675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:22:28, skipping insertion in model container [2018-01-29 23:22:28,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:22:28" (2/3) ... [2018-01-29 23:22:28,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fa3675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:22:28, skipping insertion in model container [2018-01-29 23:22:28,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:22:28" (3/3) ... [2018-01-29 23:22:28,982 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_copy2_true-unreach-call_ground.i [2018-01-29 23:22:28,987 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:22:28,991 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-29 23:22:29,015 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:22:29,015 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:22:29,015 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:22:29,015 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:22:29,015 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:22:29,015 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:22:29,015 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:22:29,015 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:22:29,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:22:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-01-29 23:22:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:22:29,028 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:29,029 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:29,029 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1377008224, now seen corresponding path program 1 times [2018-01-29 23:22:29,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:29,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:29,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:22:29,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:22:29,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:22:29,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:22:29,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:22:29,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:22:29,107 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-01-29 23:22:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:29,121 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2018-01-29 23:22:29,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:22:29,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-29 23:22:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:29,127 INFO L225 Difference]: With dead ends: 85 [2018-01-29 23:22:29,127 INFO L226 Difference]: Without dead ends: 46 [2018-01-29 23:22:29,129 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:22:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-29 23:22:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-29 23:22:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-29 23:22:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-29 23:22:29,155 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2018-01-29 23:22:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:29,155 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-29 23:22:29,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:22:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-29 23:22:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:22:29,156 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:29,156 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:29,156 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1520387425, now seen corresponding path program 1 times [2018-01-29 23:22:29,157 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:29,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:22:29,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:22:29,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:22:29,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:22:29,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:22:29,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:22:29,232 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 3 states. [2018-01-29 23:22:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:29,326 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-01-29 23:22:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:22:29,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-29 23:22:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:29,327 INFO L225 Difference]: With dead ends: 82 [2018-01-29 23:22:29,327 INFO L226 Difference]: Without dead ends: 53 [2018-01-29 23:22:29,328 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:22:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-29 23:22:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-01-29 23:22:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-29 23:22:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-29 23:22:29,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2018-01-29 23:22:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:29,332 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-29 23:22:29,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:22:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-29 23:22:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:22:29,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:29,333 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:29,333 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:29,333 INFO L82 PathProgramCache]: Analyzing trace with hash -805085610, now seen corresponding path program 1 times [2018-01-29 23:22:29,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:29,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:29,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:22:29,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:22:29,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:22:29,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:22:29,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:22:29,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:22:29,383 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-01-29 23:22:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:29,546 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-29 23:22:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:22:29,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-29 23:22:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:29,548 INFO L225 Difference]: With dead ends: 79 [2018-01-29 23:22:29,548 INFO L226 Difference]: Without dead ends: 58 [2018-01-29 23:22:29,549 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:22:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-29 23:22:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-01-29 23:22:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-29 23:22:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-29 23:22:29,552 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 34 [2018-01-29 23:22:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:29,552 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-29 23:22:29,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:22:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-29 23:22:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:22:29,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:29,555 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:29,555 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1420279786, now seen corresponding path program 1 times [2018-01-29 23:22:29,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:29,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:29,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:22:29,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:29,671 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:29,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:22:29,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:29,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:22:29,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:22:29,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:22:29,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:22:29,735 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-01-29 23:22:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:29,932 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-01-29 23:22:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:22:29,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-29 23:22:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:29,933 INFO L225 Difference]: With dead ends: 98 [2018-01-29 23:22:29,933 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 23:22:29,933 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:22:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 23:22:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-29 23:22:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-29 23:22:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-29 23:22:29,937 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 46 [2018-01-29 23:22:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:29,938 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-29 23:22:29,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:22:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-29 23:22:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:22:29,938 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:29,938 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:29,939 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1767710131, now seen corresponding path program 2 times [2018-01-29 23:22:29,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:29,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:29,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:29,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:29,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-29 23:22:30,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:30,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:30,020 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:22:30,026 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:30,030 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:30,031 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:30,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:22:30,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:30,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-29 23:22:30,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:22:30,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:22:30,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:22:30,127 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-01-29 23:22:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:30,441 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-01-29 23:22:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:22:30,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-01-29 23:22:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:30,443 INFO L225 Difference]: With dead ends: 118 [2018-01-29 23:22:30,443 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 23:22:30,443 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:22:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 23:22:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2018-01-29 23:22:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-29 23:22:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-29 23:22:30,447 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 54 [2018-01-29 23:22:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:30,447 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-29 23:22:30,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:22:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-29 23:22:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 23:22:30,449 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:30,449 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:30,449 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1700575684, now seen corresponding path program 3 times [2018-01-29 23:22:30,449 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:30,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:30,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:30,451 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:30,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:30,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-29 23:22:30,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:30,506 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:30,510 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:22:30,516 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:30,519 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:30,519 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:30,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-29 23:22:30,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:30,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:22:30,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:22:30,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:22:30,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:22:30,542 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 5 states. [2018-01-29 23:22:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:30,620 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-29 23:22:30,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:22:30,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-29 23:22:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:30,621 INFO L225 Difference]: With dead ends: 97 [2018-01-29 23:22:30,621 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 23:22:30,621 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:22:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 23:22:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-01-29 23:22:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 23:22:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-29 23:22:30,625 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 68 [2018-01-29 23:22:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:30,625 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-29 23:22:30,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:22:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-29 23:22:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 23:22:30,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:30,626 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:30,626 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 831727172, now seen corresponding path program 4 times [2018-01-29 23:22:30,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:30,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:30,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:30,627 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:30,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:30,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:22:30,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:30,737 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:30,743 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:22:30,766 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:30,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:30,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:22:30,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:22:30,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-29 23:22:30,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:30,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:30,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-29 23:22:31,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:22:31,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:31,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2018-01-29 23:22:31,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:22:31,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:22:31,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-01-29 23:22:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 23:22:31,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:31,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-01-29 23:22:31,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:22:31,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:22:31,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:22:31,180 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 20 states. [2018-01-29 23:22:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:31,902 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-01-29 23:22:31,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:22:31,903 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-01-29 23:22:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:31,903 INFO L225 Difference]: With dead ends: 150 [2018-01-29 23:22:31,903 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 23:22:31,904 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:22:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 23:22:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-01-29 23:22:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 23:22:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-01-29 23:22:31,908 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 74 [2018-01-29 23:22:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:31,909 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-01-29 23:22:31,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:22:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-01-29 23:22:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-29 23:22:31,909 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:31,909 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:31,910 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1479495076, now seen corresponding path program 1 times [2018-01-29 23:22:31,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:31,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:31,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:31,911 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:31,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:31,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-01-29 23:22:31,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:31,987 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:31,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:32,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-29 23:22:32,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:32,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-01-29 23:22:32,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:22:32,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:22:32,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:22:32,185 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 16 states. [2018-01-29 23:22:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:32,373 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-01-29 23:22:32,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:22:32,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2018-01-29 23:22:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:32,375 INFO L225 Difference]: With dead ends: 169 [2018-01-29 23:22:32,375 INFO L226 Difference]: Without dead ends: 117 [2018-01-29 23:22:32,376 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:22:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-29 23:22:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2018-01-29 23:22:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 23:22:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-01-29 23:22:32,384 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 92 [2018-01-29 23:22:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:32,384 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-01-29 23:22:32,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:22:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-01-29 23:22:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-29 23:22:32,385 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:32,385 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:32,385 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1568034677, now seen corresponding path program 2 times [2018-01-29 23:22:32,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:32,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:32,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:32,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:32,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:32,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-01-29 23:22:32,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:32,478 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:32,483 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:22:32,491 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:32,501 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:32,502 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:32,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 23:22:32,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:32,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-01-29 23:22:32,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:22:32,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:22:32,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:22:32,608 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 18 states. [2018-01-29 23:22:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:32,847 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-29 23:22:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:22:32,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-01-29 23:22:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:32,848 INFO L225 Difference]: With dead ends: 189 [2018-01-29 23:22:32,848 INFO L226 Difference]: Without dead ends: 131 [2018-01-29 23:22:32,848 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:22:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-29 23:22:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-29 23:22:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-29 23:22:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-01-29 23:22:32,853 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 106 [2018-01-29 23:22:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:32,853 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-01-29 23:22:32,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:22:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-01-29 23:22:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-29 23:22:32,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:32,854 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:32,854 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 506840202, now seen corresponding path program 3 times [2018-01-29 23:22:32,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:32,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:32,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:32,855 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:32,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:32,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 2 proven. 132 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-01-29 23:22:33,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:33,088 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:33,094 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:22:33,099 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:33,115 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:33,127 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:33,141 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:33,153 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:33,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-29 23:22:33,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:33,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-01-29 23:22:33,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:22:33,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:22:33,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:22:33,446 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 22 states. [2018-01-29 23:22:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:33,674 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2018-01-29 23:22:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:22:33,674 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2018-01-29 23:22:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:33,675 INFO L225 Difference]: With dead ends: 209 [2018-01-29 23:22:33,675 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 23:22:33,675 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:22:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 23:22:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2018-01-29 23:22:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-29 23:22:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-01-29 23:22:33,680 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 120 [2018-01-29 23:22:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:33,680 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-01-29 23:22:33,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:22:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-01-29 23:22:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-29 23:22:33,681 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:33,681 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:33,681 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1054311495, now seen corresponding path program 4 times [2018-01-29 23:22:33,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:33,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:33,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:33,682 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:33,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:33,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-01-29 23:22:33,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:33,765 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:33,769 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:22:33,782 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:33,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:33,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:33,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:22:33,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:33,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:33,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:22:33,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-29 23:22:33,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-29 23:22:33,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:33,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:33,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:22:34,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:22:34,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:34,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-29 23:22:34,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:34,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:34,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-01-29 23:22:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-01-29 23:22:34,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:34,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 36 [2018-01-29 23:22:34,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:22:34,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:22:34,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:22:34,557 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 36 states. [2018-01-29 23:22:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:35,445 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2018-01-29 23:22:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 23:22:35,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 134 [2018-01-29 23:22:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:35,446 INFO L225 Difference]: With dead ends: 205 [2018-01-29 23:22:35,446 INFO L226 Difference]: Without dead ends: 163 [2018-01-29 23:22:35,447 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=362, Invalid=3060, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:22:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-29 23:22:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2018-01-29 23:22:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-29 23:22:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-01-29 23:22:35,451 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 134 [2018-01-29 23:22:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:35,452 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-01-29 23:22:35,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:22:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-01-29 23:22:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-01-29 23:22:35,453 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:35,453 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:35,453 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 418131538, now seen corresponding path program 5 times [2018-01-29 23:22:35,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:35,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:35,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:35,454 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:35,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:35,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-01-29 23:22:35,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:35,516 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:35,520 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:22:35,525 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,526 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,528 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,529 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,531 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,534 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,538 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,543 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:35,544 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:35,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-01-29 23:22:35,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:35,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2018-01-29 23:22:35,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:22:35,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:22:35,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:22:35,605 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 16 states. [2018-01-29 23:22:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:35,790 INFO L93 Difference]: Finished difference Result 223 states and 231 transitions. [2018-01-29 23:22:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:22:35,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 150 [2018-01-29 23:22:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:35,791 INFO L225 Difference]: With dead ends: 223 [2018-01-29 23:22:35,791 INFO L226 Difference]: Without dead ends: 171 [2018-01-29 23:22:35,792 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:22:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-29 23:22:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2018-01-29 23:22:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-29 23:22:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-01-29 23:22:35,795 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 150 [2018-01-29 23:22:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:35,796 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-01-29 23:22:35,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:22:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-01-29 23:22:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-29 23:22:35,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:35,797 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:35,797 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1176517906, now seen corresponding path program 6 times [2018-01-29 23:22:35,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:35,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:35,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:35,798 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:35,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:35,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-01-29 23:22:35,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:35,912 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:35,917 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:22:35,923 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,924 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,926 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,928 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,931 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,933 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,935 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,938 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:35,953 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:35,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-01-29 23:22:36,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:36,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2018-01-29 23:22:36,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:22:36,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:22:36,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:22:36,117 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 26 states. [2018-01-29 23:22:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:36,487 INFO L93 Difference]: Finished difference Result 285 states and 294 transitions. [2018-01-29 23:22:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:22:36,487 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 162 [2018-01-29 23:22:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:36,488 INFO L225 Difference]: With dead ends: 285 [2018-01-29 23:22:36,488 INFO L226 Difference]: Without dead ends: 187 [2018-01-29 23:22:36,488 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=440, Invalid=1816, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:22:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-29 23:22:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 179. [2018-01-29 23:22:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-29 23:22:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2018-01-29 23:22:36,492 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 162 [2018-01-29 23:22:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:36,492 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2018-01-29 23:22:36,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:22:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2018-01-29 23:22:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-01-29 23:22:36,493 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:36,493 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:36,493 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1148191121, now seen corresponding path program 7 times [2018-01-29 23:22:36,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:36,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:36,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:36,494 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:36,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:36,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 4 proven. 240 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-01-29 23:22:36,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:36,884 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:36,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:36,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-29 23:22:36,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:36,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-29 23:22:36,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:22:36,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:22:36,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:22:36,961 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 19 states. [2018-01-29 23:22:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:37,165 INFO L93 Difference]: Finished difference Result 296 states and 304 transitions. [2018-01-29 23:22:37,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:22:37,165 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 176 [2018-01-29 23:22:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:37,166 INFO L225 Difference]: With dead ends: 296 [2018-01-29 23:22:37,166 INFO L226 Difference]: Without dead ends: 192 [2018-01-29 23:22:37,166 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:22:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-29 23:22:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2018-01-29 23:22:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-29 23:22:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2018-01-29 23:22:37,170 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 176 [2018-01-29 23:22:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:37,170 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2018-01-29 23:22:37,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:22:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2018-01-29 23:22:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-29 23:22:37,171 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:37,171 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:37,171 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash -967015928, now seen corresponding path program 8 times [2018-01-29 23:22:37,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:37,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:37,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:37,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:37,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:37,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-29 23:22:37,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:37,291 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:37,295 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:22:37,301 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:37,311 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:37,312 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:37,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-29 23:22:37,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:37,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-01-29 23:22:37,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:22:37,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:22:37,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:22:37,516 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 34 states. [2018-01-29 23:22:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:38,088 INFO L93 Difference]: Finished difference Result 313 states and 322 transitions. [2018-01-29 23:22:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:22:38,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 184 [2018-01-29 23:22:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:38,097 INFO L225 Difference]: With dead ends: 313 [2018-01-29 23:22:38,097 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 23:22:38,098 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=740, Invalid=3292, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 23:22:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 23:22:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2018-01-29 23:22:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-29 23:22:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2018-01-29 23:22:38,101 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 184 [2018-01-29 23:22:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:38,101 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2018-01-29 23:22:38,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:22:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2018-01-29 23:22:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-29 23:22:38,102 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:38,102 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:38,102 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1861318281, now seen corresponding path program 9 times [2018-01-29 23:22:38,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:38,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:38,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:38,103 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:38,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:38,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 4 proven. 140 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-01-29 23:22:38,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:38,257 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:38,262 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:22:38,268 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,270 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,273 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,276 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,278 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,281 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:38,281 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:38,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-01-29 23:22:38,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:38,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 22 [2018-01-29 23:22:38,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:22:38,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:22:38,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:22:38,355 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 22 states. [2018-01-29 23:22:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:39,123 INFO L93 Difference]: Finished difference Result 283 states and 291 transitions. [2018-01-29 23:22:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:22:39,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 198 [2018-01-29 23:22:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:39,124 INFO L225 Difference]: With dead ends: 283 [2018-01-29 23:22:39,124 INFO L226 Difference]: Without dead ends: 219 [2018-01-29 23:22:39,125 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=488, Invalid=1582, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:22:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-29 23:22:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2018-01-29 23:22:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-29 23:22:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-01-29 23:22:39,129 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 198 [2018-01-29 23:22:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:39,129 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-01-29 23:22:39,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:22:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-01-29 23:22:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-01-29 23:22:39,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:39,130 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:39,130 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1975549769, now seen corresponding path program 10 times [2018-01-29 23:22:39,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:39,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:39,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:39,131 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:39,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:39,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 4 proven. 380 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-29 23:22:39,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:39,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:39,358 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:22:39,379 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:39,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:39,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:39,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:22:39,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:39,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:22:39,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:22:39,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:22:39,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:22:39,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:22:39,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:39,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-29 23:22:39,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:39,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-29 23:22:40,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-01-29 23:22:40,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:43 [2018-01-29 23:22:40,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:40,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-29 23:22:40,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:40,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:40,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-29 23:22:40,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:40,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:40,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:22:40,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-29 23:22:40,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-01-29 23:22:40,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2018-01-29 23:22:40,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:40,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:29 [2018-01-29 23:22:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 3 proven. 679 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:22:41,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:41,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 66] total 87 [2018-01-29 23:22:41,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-01-29 23:22:41,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-01-29 23:22:41,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=7048, Unknown=0, NotChecked=0, Total=7482 [2018-01-29 23:22:41,492 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 87 states. [2018-01-29 23:22:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:45,263 INFO L93 Difference]: Finished difference Result 368 states and 378 transitions. [2018-01-29 23:22:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-01-29 23:22:45,263 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 210 [2018-01-29 23:22:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:45,264 INFO L225 Difference]: With dead ends: 368 [2018-01-29 23:22:45,264 INFO L226 Difference]: Without dead ends: 246 [2018-01-29 23:22:45,267 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6501 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=995, Invalid=19597, Unknown=0, NotChecked=0, Total=20592 [2018-01-29 23:22:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-29 23:22:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 231. [2018-01-29 23:22:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-29 23:22:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2018-01-29 23:22:45,274 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 210 [2018-01-29 23:22:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:45,274 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2018-01-29 23:22:45,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-01-29 23:22:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2018-01-29 23:22:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-29 23:22:45,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:45,275 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:45,275 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash 92373519, now seen corresponding path program 11 times [2018-01-29 23:22:45,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:45,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:45,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:45,276 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:45,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:45,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2018-01-29 23:22:45,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:45,845 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:45,850 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:22:45,855 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,861 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,862 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,864 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,865 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,867 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,869 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,872 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,875 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,879 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,884 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,891 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:45,892 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:45,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-01-29 23:22:46,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:46,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 25 [2018-01-29 23:22:46,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:22:46,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:22:46,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:22:46,004 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand 25 states. [2018-01-29 23:22:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:46,925 INFO L93 Difference]: Finished difference Result 329 states and 337 transitions. [2018-01-29 23:22:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-29 23:22:46,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 228 [2018-01-29 23:22:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:46,927 INFO L225 Difference]: With dead ends: 329 [2018-01-29 23:22:46,927 INFO L226 Difference]: Without dead ends: 249 [2018-01-29 23:22:46,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:22:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-29 23:22:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2018-01-29 23:22:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-29 23:22:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-01-29 23:22:46,934 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 228 [2018-01-29 23:22:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:46,934 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-01-29 23:22:46,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:22:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-01-29 23:22:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-29 23:22:46,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:46,935 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:46,935 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -3962161, now seen corresponding path program 12 times [2018-01-29 23:22:46,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:46,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:46,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:46,935 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:46,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:46,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 6 proven. 234 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-01-29 23:22:47,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:47,221 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:47,225 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:22:47,232 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,235 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,237 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,239 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,242 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,245 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,248 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,251 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,254 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,259 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,263 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:22:47,263 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:47,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2018-01-29 23:22:47,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:47,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-01-29 23:22:47,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:22:47,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:22:47,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:22:47,302 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand 21 states. [2018-01-29 23:22:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:47,489 INFO L93 Difference]: Finished difference Result 338 states and 345 transitions. [2018-01-29 23:22:47,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:22:47,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 240 [2018-01-29 23:22:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:47,490 INFO L225 Difference]: With dead ends: 338 [2018-01-29 23:22:47,490 INFO L226 Difference]: Without dead ends: 252 [2018-01-29 23:22:47,491 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:22:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-29 23:22:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2018-01-29 23:22:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-29 23:22:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 253 transitions. [2018-01-29 23:22:47,495 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 253 transitions. Word has length 240 [2018-01-29 23:22:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:47,495 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 253 transitions. [2018-01-29 23:22:47,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:22:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 253 transitions. [2018-01-29 23:22:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-29 23:22:47,496 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:47,496 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:47,496 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1471703943, now seen corresponding path program 13 times [2018-01-29 23:22:47,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:47,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:47,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:47,497 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:47,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:47,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 6 proven. 462 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-01-29 23:22:49,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:49,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:49,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:49,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-01-29 23:22:49,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:49,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-29 23:22:49,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:22:49,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:22:49,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:22:49,389 INFO L87 Difference]: Start difference. First operand 249 states and 253 transitions. Second operand 25 states. [2018-01-29 23:22:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:49,951 INFO L93 Difference]: Finished difference Result 412 states and 420 transitions. [2018-01-29 23:22:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:22:49,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 246 [2018-01-29 23:22:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:49,952 INFO L225 Difference]: With dead ends: 412 [2018-01-29 23:22:49,952 INFO L226 Difference]: Without dead ends: 262 [2018-01-29 23:22:49,952 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:22:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-29 23:22:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2018-01-29 23:22:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-01-29 23:22:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 261 transitions. [2018-01-29 23:22:49,957 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 261 transitions. Word has length 246 [2018-01-29 23:22:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:49,957 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 261 transitions. [2018-01-29 23:22:49,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:22:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 261 transitions. [2018-01-29 23:22:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-29 23:22:49,958 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:49,958 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:49,958 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -879411522, now seen corresponding path program 14 times [2018-01-29 23:22:49,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:49,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:49,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:49,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:22:49,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:49,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 6 proven. 552 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-01-29 23:22:50,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:50,798 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:50,802 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:22:50,809 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:50,825 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:22:50,827 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:50,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-01-29 23:22:50,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:50,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-01-29 23:22:50,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:22:50,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:22:50,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:22:50,875 INFO L87 Difference]: Start difference. First operand 257 states and 261 transitions. Second operand 27 states. [2018-01-29 23:22:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:51,131 INFO L93 Difference]: Finished difference Result 420 states and 428 transitions. [2018-01-29 23:22:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-29 23:22:51,136 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 254 [2018-01-29 23:22:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:51,137 INFO L225 Difference]: With dead ends: 420 [2018-01-29 23:22:51,137 INFO L226 Difference]: Without dead ends: 270 [2018-01-29 23:22:51,138 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 23:22:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-29 23:22:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2018-01-29 23:22:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-29 23:22:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 269 transitions. [2018-01-29 23:22:51,142 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 269 transitions. Word has length 254 [2018-01-29 23:22:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:51,142 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 269 transitions. [2018-01-29 23:22:51,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:22:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 269 transitions. [2018-01-29 23:22:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-01-29 23:22:51,143 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:51,143 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:51,143 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash -442307851, now seen corresponding path program 15 times [2018-01-29 23:22:51,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:51,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:51,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:51,144 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:51,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:51,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 6 proven. 650 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-01-29 23:22:51,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:51,486 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:51,492 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:22:51,499 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,511 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,514 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,518 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,520 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,523 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,526 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:22:51,531 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:51,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 56 proven. 140 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2018-01-29 23:22:51,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:51,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 47 [2018-01-29 23:22:51,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 23:22:51,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 23:22:51,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1836, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:22:51,772 INFO L87 Difference]: Start difference. First operand 265 states and 269 transitions. Second operand 47 states. [2018-01-29 23:22:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:22:52,431 INFO L93 Difference]: Finished difference Result 437 states and 446 transitions. [2018-01-29 23:22:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-29 23:22:52,434 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 262 [2018-01-29 23:22:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:22:52,434 INFO L225 Difference]: With dead ends: 437 [2018-01-29 23:22:52,435 INFO L226 Difference]: Without dead ends: 287 [2018-01-29 23:22:52,435 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1371, Invalid=6639, Unknown=0, NotChecked=0, Total=8010 [2018-01-29 23:22:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-29 23:22:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-01-29 23:22:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-29 23:22:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 283 transitions. [2018-01-29 23:22:52,440 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 283 transitions. Word has length 262 [2018-01-29 23:22:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:22:52,440 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 283 transitions. [2018-01-29 23:22:52,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 23:22:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 283 transitions. [2018-01-29 23:22:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-01-29 23:22:52,441 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:22:52,441 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:22:52,441 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:22:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash 610985076, now seen corresponding path program 16 times [2018-01-29 23:22:52,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:22:52,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:22:52,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:52,442 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:22:52,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:22:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:22:52,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:22:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 6 proven. 756 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-01-29 23:22:52,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:22:52,825 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:22:52,830 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:22:52,862 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:22:52,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:22:53,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:53,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:22:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:53,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:22:53,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:22:53,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:22:53,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:22:53,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:22:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-29 23:22:53,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-29 23:22:53,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:53,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-29 23:22:53,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-29 23:22:53,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-01-29 23:22:53,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:53,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2018-01-29 23:22:54,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:22:54,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-29 23:22:54,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:54,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:22:54,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-29 23:22:54,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:54,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:54,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:22:54,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:54,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-29 23:22:55,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:55,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:55,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:22:55,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:22:55,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:55,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2018-01-29 23:22:55,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-01-29 23:22:55,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:55,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 36 [2018-01-29 23:22:55,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:22:55,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:22:55,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:36 [2018-01-29 23:22:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 5 proven. 1261 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-29 23:22:56,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:22:56,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 86] total 115 [2018-01-29 23:22:56,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-01-29 23:22:56,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-01-29 23:22:56,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=12406, Unknown=0, NotChecked=0, Total=13110 [2018-01-29 23:22:56,191 INFO L87 Difference]: Start difference. First operand 279 states and 283 transitions. Second operand 115 states. [2018-01-29 23:23:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:02,387 INFO L93 Difference]: Finished difference Result 468 states and 478 transitions. [2018-01-29 23:23:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-01-29 23:23:02,387 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 276 [2018-01-29 23:23:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:02,388 INFO L225 Difference]: With dead ends: 468 [2018-01-29 23:23:02,388 INFO L226 Difference]: Without dead ends: 312 [2018-01-29 23:23:02,390 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11801 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1583, Invalid=34707, Unknown=0, NotChecked=0, Total=36290 [2018-01-29 23:23:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-29 23:23:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 297. [2018-01-29 23:23:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-29 23:23:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2018-01-29 23:23:02,406 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 276 [2018-01-29 23:23:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:02,406 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2018-01-29 23:23:02,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-01-29 23:23:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2018-01-29 23:23:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-01-29 23:23:02,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:02,407 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:02,407 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1816837172, now seen corresponding path program 17 times [2018-01-29 23:23:02,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:02,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:02,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:02,408 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:02,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:02,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 8 proven. 290 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-01-29 23:23:02,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:02,729 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:02,733 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:23:02,740 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,777 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,787 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,796 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,798 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,801 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,807 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,811 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,816 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,828 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,844 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:02,844 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:02,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-01-29 23:23:03,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:03,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 31 [2018-01-29 23:23:03,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:23:03,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:23:03,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:23:03,620 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 31 states. [2018-01-29 23:23:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:04,025 INFO L93 Difference]: Finished difference Result 417 states and 425 transitions. [2018-01-29 23:23:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:23:04,025 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 294 [2018-01-29 23:23:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:04,026 INFO L225 Difference]: With dead ends: 417 [2018-01-29 23:23:04,026 INFO L226 Difference]: Without dead ends: 315 [2018-01-29 23:23:04,026 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=983, Invalid=3439, Unknown=0, NotChecked=0, Total=4422 [2018-01-29 23:23:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-29 23:23:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2018-01-29 23:23:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-29 23:23:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 313 transitions. [2018-01-29 23:23:04,031 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 313 transitions. Word has length 294 [2018-01-29 23:23:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:04,032 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 313 transitions. [2018-01-29 23:23:04,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:23:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 313 transitions. [2018-01-29 23:23:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-29 23:23:04,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:04,033 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:04,033 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:04,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1416025460, now seen corresponding path program 18 times [2018-01-29 23:23:04,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:04,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:04,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:04,034 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:04,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:04,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 8 proven. 352 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-01-29 23:23:04,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:04,466 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:04,470 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:23:04,478 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,490 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,498 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,510 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,518 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,533 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,542 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,551 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,561 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,571 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,581 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,590 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,600 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,610 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,620 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,630 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:04,638 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:04,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2018-01-29 23:23:04,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:04,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-29 23:23:04,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:23:04,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:23:04,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:23:04,690 INFO L87 Difference]: Start difference. First operand 309 states and 313 transitions. Second operand 25 states. [2018-01-29 23:23:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:05,313 INFO L93 Difference]: Finished difference Result 426 states and 433 transitions. [2018-01-29 23:23:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:23:05,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 306 [2018-01-29 23:23:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:05,315 INFO L225 Difference]: With dead ends: 426 [2018-01-29 23:23:05,315 INFO L226 Difference]: Without dead ends: 318 [2018-01-29 23:23:05,316 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:23:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-29 23:23:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2018-01-29 23:23:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-01-29 23:23:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 319 transitions. [2018-01-29 23:23:05,321 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 319 transitions. Word has length 306 [2018-01-29 23:23:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:05,321 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 319 transitions. [2018-01-29 23:23:05,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:23:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 319 transitions. [2018-01-29 23:23:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-29 23:23:05,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:05,322 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 13, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:05,322 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash 413845572, now seen corresponding path program 19 times [2018-01-29 23:23:05,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:05,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:05,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:05,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:05,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:05,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2018-01-29 23:23:06,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:06,405 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:06,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:23:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:06,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2018-01-29 23:23:06,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:06,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 33] total 52 [2018-01-29 23:23:06,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:23:06,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:23:06,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:23:06,804 INFO L87 Difference]: Start difference. First operand 315 states and 319 transitions. Second operand 52 states. [2018-01-29 23:23:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:07,565 INFO L93 Difference]: Finished difference Result 521 states and 530 transitions. [2018-01-29 23:23:07,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-01-29 23:23:07,565 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 312 [2018-01-29 23:23:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:07,566 INFO L225 Difference]: With dead ends: 521 [2018-01-29 23:23:07,566 INFO L226 Difference]: Without dead ends: 337 [2018-01-29 23:23:07,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1775, Invalid=8125, Unknown=0, NotChecked=0, Total=9900 [2018-01-29 23:23:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-29 23:23:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-01-29 23:23:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-29 23:23:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 333 transitions. [2018-01-29 23:23:07,573 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 333 transitions. Word has length 312 [2018-01-29 23:23:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:07,573 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 333 transitions. [2018-01-29 23:23:07,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:23:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 333 transitions. [2018-01-29 23:23:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-01-29 23:23:07,574 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:07,575 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 13, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:07,575 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1726980483, now seen corresponding path program 20 times [2018-01-29 23:23:07,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:07,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:07,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:07,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:23:07,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:07,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 8 proven. 290 refuted. 0 times theorem prover too weak. 1484 trivial. 0 not checked. [2018-01-29 23:23:07,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:07,882 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:07,887 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:23:07,896 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:07,913 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:07,916 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:07,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2018-01-29 23:23:08,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:08,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 35] total 56 [2018-01-29 23:23:08,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-29 23:23:08,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-29 23:23:08,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2615, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:23:08,327 INFO L87 Difference]: Start difference. First operand 329 states and 333 transitions. Second operand 56 states. [2018-01-29 23:23:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:09,154 INFO L93 Difference]: Finished difference Result 541 states and 550 transitions. [2018-01-29 23:23:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-01-29 23:23:09,154 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 326 [2018-01-29 23:23:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:09,155 INFO L225 Difference]: With dead ends: 541 [2018-01-29 23:23:09,155 INFO L226 Difference]: Without dead ends: 351 [2018-01-29 23:23:09,155 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2045, Invalid=9511, Unknown=0, NotChecked=0, Total=11556 [2018-01-29 23:23:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-01-29 23:23:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2018-01-29 23:23:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-01-29 23:23:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 347 transitions. [2018-01-29 23:23:09,161 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 347 transitions. Word has length 326 [2018-01-29 23:23:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:09,162 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 347 transitions. [2018-01-29 23:23:09,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-29 23:23:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 347 transitions. [2018-01-29 23:23:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-29 23:23:09,163 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:09,163 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:09,163 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1386273982, now seen corresponding path program 21 times [2018-01-29 23:23:09,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:09,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:09,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:09,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:09,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:09,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 8 proven. 352 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-01-29 23:23:09,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:09,526 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:09,531 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:23:09,539 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,550 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,553 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,557 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,560 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,564 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,569 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,574 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,597 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:09,598 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:09,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2018-01-29 23:23:09,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:09,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-29 23:23:09,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:23:09,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:23:09,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:23:09,654 INFO L87 Difference]: Start difference. First operand 343 states and 347 transitions. Second operand 25 states. [2018-01-29 23:23:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:09,925 INFO L93 Difference]: Finished difference Result 403 states and 409 transitions. [2018-01-29 23:23:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:23:09,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 340 [2018-01-29 23:23:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:09,927 INFO L225 Difference]: With dead ends: 403 [2018-01-29 23:23:09,927 INFO L226 Difference]: Without dead ends: 352 [2018-01-29 23:23:09,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:23:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-01-29 23:23:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2018-01-29 23:23:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-29 23:23:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 353 transitions. [2018-01-29 23:23:09,933 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 353 transitions. Word has length 340 [2018-01-29 23:23:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:09,934 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 353 transitions. [2018-01-29 23:23:09,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:23:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 353 transitions. [2018-01-29 23:23:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-29 23:23:09,935 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:09,935 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:09,935 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2028547638, now seen corresponding path program 22 times [2018-01-29 23:23:09,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:09,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:09,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:09,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:09,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:09,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 8 proven. 420 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-01-29 23:23:10,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:10,649 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:10,654 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:23:10,688 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:10,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:10,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:23:10,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:10,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:10,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:23:10,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:10,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:23:10,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:10,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:10,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:23:10,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:10,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:10,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:23:10,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:23:11,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:23:11,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:23:11,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-29 23:23:11,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-29 23:23:11,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-29 23:23:11,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-29 23:23:11,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:11,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 74 [2018-01-29 23:23:11,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-29 23:23:11,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-01-29 23:23:11,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:57 [2018-01-29 23:23:11,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:23:11,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:11,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-29 23:23:12,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:23:12,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-29 23:23:12,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:23:12,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2018-01-29 23:23:12,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:23:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:88 [2018-01-29 23:23:12,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:12,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-29 23:23:12,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:12,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:95 [2018-01-29 23:23:13,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-29 23:23:13,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:102 [2018-01-29 23:23:13,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:13,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 74 [2018-01-29 23:23:13,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:109 [2018-01-29 23:23:13,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-01-29 23:23:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 57 [2018-01-29 23:23:13,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:13,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:57 [2018-01-29 23:23:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 7 proven. 898 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2018-01-29 23:23:14,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:14,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 78] total 103 [2018-01-29 23:23:14,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-01-29 23:23:14,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-01-29 23:23:14,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=9729, Unknown=0, NotChecked=0, Total=10506 [2018-01-29 23:23:14,917 INFO L87 Difference]: Start difference. First operand 349 states and 353 transitions. Second operand 103 states. [2018-01-29 23:23:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:19,638 INFO L93 Difference]: Finished difference Result 426 states and 434 transitions. [2018-01-29 23:23:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-01-29 23:23:19,638 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 346 [2018-01-29 23:23:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:19,640 INFO L225 Difference]: With dead ends: 426 [2018-01-29 23:23:19,640 INFO L226 Difference]: Without dead ends: 375 [2018-01-29 23:23:19,640 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9504 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1675, Invalid=26717, Unknown=0, NotChecked=0, Total=28392 [2018-01-29 23:23:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-29 23:23:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 365. [2018-01-29 23:23:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-01-29 23:23:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 369 transitions. [2018-01-29 23:23:19,648 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 369 transitions. Word has length 346 [2018-01-29 23:23:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:19,648 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 369 transitions. [2018-01-29 23:23:19,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-01-29 23:23:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 369 transitions. [2018-01-29 23:23:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-01-29 23:23:19,649 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:19,649 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:19,650 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -736916493, now seen corresponding path program 23 times [2018-01-29 23:23:19,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:19,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:19,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:19,650 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:19,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:19,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 10 proven. 494 refuted. 0 times theorem prover too weak. 1657 trivial. 0 not checked. [2018-01-29 23:23:20,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:20,400 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:20,405 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:23:20,412 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,414 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,415 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,424 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,427 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,430 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,434 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,438 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,443 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,449 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,456 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,465 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,480 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,506 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:20,516 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:20,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-01-29 23:23:21,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:21,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 37] total 64 [2018-01-29 23:23:21,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-01-29 23:23:21,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-01-29 23:23:21,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=3449, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 23:23:21,517 INFO L87 Difference]: Start difference. First operand 365 states and 369 transitions. Second operand 64 states. [2018-01-29 23:23:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:22,606 INFO L93 Difference]: Finished difference Result 605 states and 614 transitions. [2018-01-29 23:23:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-01-29 23:23:22,606 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 362 [2018-01-29 23:23:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:22,607 INFO L225 Difference]: With dead ends: 605 [2018-01-29 23:23:22,607 INFO L226 Difference]: Without dead ends: 387 [2018-01-29 23:23:22,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2595, Invalid=12657, Unknown=0, NotChecked=0, Total=15252 [2018-01-29 23:23:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-29 23:23:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2018-01-29 23:23:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-01-29 23:23:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 383 transitions. [2018-01-29 23:23:22,614 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 383 transitions. Word has length 362 [2018-01-29 23:23:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:22,615 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 383 transitions. [2018-01-29 23:23:22,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-01-29 23:23:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 383 transitions. [2018-01-29 23:23:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-01-29 23:23:22,616 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:22,616 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 15, 14, 14, 14, 14, 14, 13, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:22,616 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1581055218, now seen corresponding path program 24 times [2018-01-29 23:23:22,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:22,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:22,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:22,617 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:22,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:22,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 10 proven. 574 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-01-29 23:23:23,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:23,501 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:23,506 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:23:23,515 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,516 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,518 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,520 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,522 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,524 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,527 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,529 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,532 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,535 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,539 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,544 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,548 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,553 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,558 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,565 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,572 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,580 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,590 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:23:23,591 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:23,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2018-01-29 23:23:23,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:23,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-29 23:23:23,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:23:23,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:23:23,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:23:23,671 INFO L87 Difference]: Start difference. First operand 379 states and 383 transitions. Second operand 31 states. [2018-01-29 23:23:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:24,003 INFO L93 Difference]: Finished difference Result 449 states and 455 transitions. [2018-01-29 23:23:24,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-29 23:23:24,004 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 376 [2018-01-29 23:23:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:24,004 INFO L225 Difference]: With dead ends: 449 [2018-01-29 23:23:24,004 INFO L226 Difference]: Without dead ends: 388 [2018-01-29 23:23:24,005 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:23:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-29 23:23:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2018-01-29 23:23:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-01-29 23:23:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 389 transitions. [2018-01-29 23:23:24,011 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 389 transitions. Word has length 376 [2018-01-29 23:23:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:24,011 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 389 transitions. [2018-01-29 23:23:24,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:23:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 389 transitions. [2018-01-29 23:23:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-29 23:23:24,012 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:24,012 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 16, 15, 15, 15, 15, 15, 13, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:24,012 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1917281734, now seen corresponding path program 25 times [2018-01-29 23:23:24,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:24,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:24,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:24,013 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:24,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:24,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2465 backedges. 10 proven. 660 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-01-29 23:23:24,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:24,607 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:24,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:23:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:24,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2465 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2018-01-29 23:23:25,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:25,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 70 [2018-01-29 23:23:25,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-01-29 23:23:25,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-01-29 23:23:25,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=4144, Unknown=0, NotChecked=0, Total=4830 [2018-01-29 23:23:25,355 INFO L87 Difference]: Start difference. First operand 385 states and 389 transitions. Second operand 70 states. [2018-01-29 23:23:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:26,645 INFO L93 Difference]: Finished difference Result 637 states and 646 transitions. [2018-01-29 23:23:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-01-29 23:23:26,647 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 382 [2018-01-29 23:23:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:26,647 INFO L225 Difference]: With dead ends: 637 [2018-01-29 23:23:26,647 INFO L226 Difference]: Without dead ends: 407 [2018-01-29 23:23:26,648 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3080, Invalid=15280, Unknown=0, NotChecked=0, Total=18360 [2018-01-29 23:23:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-01-29 23:23:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-01-29 23:23:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-01-29 23:23:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 403 transitions. [2018-01-29 23:23:26,654 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 403 transitions. Word has length 382 [2018-01-29 23:23:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:26,654 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 403 transitions. [2018-01-29 23:23:26,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-01-29 23:23:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 403 transitions. [2018-01-29 23:23:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-01-29 23:23:26,656 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:26,656 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 17, 16, 16, 16, 16, 16, 13, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:26,656 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1383602297, now seen corresponding path program 26 times [2018-01-29 23:23:26,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:26,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:26,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:26,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:23:26,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:26,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 10 proven. 752 refuted. 0 times theorem prover too weak. 1941 trivial. 0 not checked. [2018-01-29 23:23:27,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:27,472 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:27,477 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:23:27,486 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:27,505 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:23:27,509 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:27,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1297 trivial. 0 not checked. [2018-01-29 23:23:28,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:28,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 41] total 74 [2018-01-29 23:23:28,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-01-29 23:23:28,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-01-29 23:23:28,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=4640, Unknown=0, NotChecked=0, Total=5402 [2018-01-29 23:23:28,280 INFO L87 Difference]: Start difference. First operand 399 states and 403 transitions. Second operand 74 states. [2018-01-29 23:23:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:30,196 INFO L93 Difference]: Finished difference Result 657 states and 666 transitions. [2018-01-29 23:23:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-01-29 23:23:30,197 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 396 [2018-01-29 23:23:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:30,198 INFO L225 Difference]: With dead ends: 657 [2018-01-29 23:23:30,198 INFO L226 Difference]: Without dead ends: 421 [2018-01-29 23:23:30,199 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4206 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3440, Invalid=17152, Unknown=0, NotChecked=0, Total=20592 [2018-01-29 23:23:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-01-29 23:23:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 413. [2018-01-29 23:23:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-01-29 23:23:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 417 transitions. [2018-01-29 23:23:30,206 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 417 transitions. Word has length 396 [2018-01-29 23:23:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:30,206 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 417 transitions. [2018-01-29 23:23:30,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-01-29 23:23:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 417 transitions. [2018-01-29 23:23:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-01-29 23:23:30,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:30,208 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 18, 17, 17, 17, 17, 17, 13, 12, 12, 12, 12, 12, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:30,208 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2140581688, now seen corresponding path program 27 times [2018-01-29 23:23:30,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:30,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:30,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:30,208 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:30,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:30,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 10 proven. 850 refuted. 0 times theorem prover too weak. 2095 trivial. 0 not checked. [2018-01-29 23:23:30,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:30,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:30,895 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:23:30,905 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,907 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,910 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,913 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,917 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,920 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,929 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,934 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,940 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,955 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,964 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:23:30,965 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:30,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2018-01-29 23:23:31,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:23:31,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27] total 49 [2018-01-29 23:23:31,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 23:23:31,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 23:23:31,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1902, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:23:31,181 INFO L87 Difference]: Start difference. First operand 413 states and 417 transitions. Second operand 49 states. [2018-01-29 23:23:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:23:32,011 INFO L93 Difference]: Finished difference Result 597 states and 605 transitions. [2018-01-29 23:23:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-29 23:23:32,012 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 410 [2018-01-29 23:23:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:23:32,013 INFO L225 Difference]: With dead ends: 597 [2018-01-29 23:23:32,013 INFO L226 Difference]: Without dead ends: 431 [2018-01-29 23:23:32,014 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2476, Invalid=8866, Unknown=0, NotChecked=0, Total=11342 [2018-01-29 23:23:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-01-29 23:23:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2018-01-29 23:23:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-01-29 23:23:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 429 transitions. [2018-01-29 23:23:32,025 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 429 transitions. Word has length 410 [2018-01-29 23:23:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:23:32,025 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 429 transitions. [2018-01-29 23:23:32,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 23:23:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 429 transitions. [2018-01-29 23:23:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-01-29 23:23:32,027 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:23:32,027 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 18, 18, 18, 18, 18, 14, 13, 13, 13, 13, 13, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:23:32,027 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:23:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash -887215752, now seen corresponding path program 28 times [2018-01-29 23:23:32,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:23:32,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:23:32,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:32,028 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:23:32,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:23:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:23:32,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:23:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3133 backedges. 10 proven. 954 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2018-01-29 23:23:32,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:23:32,866 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:23:32,871 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:23:32,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:23:32,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:23:33,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:23:33,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:23:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:23:33,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-29 23:23:33,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:23:33,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:23:33,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-29 23:23:33,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-29 23:23:33,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-29 23:23:33,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-29 23:23:33,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-29 23:23:33,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-29 23:23:33,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:33,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 74 [2018-01-29 23:23:33,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-29 23:23:33,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-01-29 23:23:33,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:33,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:57 [2018-01-29 23:23:34,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:23:34,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-29 23:23:34,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:34,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:23:34,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-29 23:23:34,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:34,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:23:34,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-29 23:23:34,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:23:34,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 Received shutdown request... [2018-01-29 23:23:34,775 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:23:34,775 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:23:34,778 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:23:34,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:23:34 BoogieIcfgContainer [2018-01-29 23:23:34,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:23:34,779 INFO L168 Benchmark]: Toolchain (without parser) took 66267.75 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 910.7 MB). Free memory was 114.6 MB in the beginning and 851.5 MB in the end (delta: -736.9 MB). Peak memory consumption was 173.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:23:34,781 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 119.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:23:34,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 101.69 ms. Allocated memory is still 149.4 MB. Free memory was 114.4 MB in the beginning and 106.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:23:34,781 INFO L168 Benchmark]: Boogie Preprocessor took 17.55 ms. Allocated memory is still 149.4 MB. Free memory was 106.5 MB in the beginning and 104.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:23:34,782 INFO L168 Benchmark]: RCFGBuilder took 345.62 ms. Allocated memory is still 149.4 MB. Free memory was 104.7 MB in the beginning and 91.4 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-29 23:23:34,782 INFO L168 Benchmark]: TraceAbstraction took 65800.61 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 910.7 MB). Free memory was 91.2 MB in the beginning and 851.5 MB in the end (delta: -760.3 MB). Peak memory consumption was 150.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:23:34,783 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.09 ms. Allocated memory is still 149.4 MB. Free memory is still 119.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 101.69 ms. Allocated memory is still 149.4 MB. Free memory was 114.4 MB in the beginning and 106.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.55 ms. Allocated memory is still 149.4 MB. Free memory was 106.5 MB in the beginning and 104.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 345.62 ms. Allocated memory is still 149.4 MB. Free memory was 104.7 MB in the beginning and 91.4 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65800.61 ms. Allocated memory was 149.4 MB in the beginning and 1.1 GB in the end (delta: 910.7 MB). Free memory was 91.2 MB in the beginning and 851.5 MB in the end (delta: -760.3 MB). Peak memory consumption was 150.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 423 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 91 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. TIMEOUT Result, 65.7s OverallTime, 35 OverallIterations, 21 TraceHistogramMax, 30.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1643 SDtfs, 3059 SDslu, 37571 SDs, 0 SdLazy, 31505 SolverSat, 1075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8715 GetRequests, 6606 SyntacticMatches, 0 SemanticMatches, 2109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54420 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 235 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 14343 NumberOfCodeBlocks, 13832 NumberOfCodeBlocksAsserted, 211 NumberOfCheckSat, 14278 ConstructedInterpolants, 0 QuantifiedInterpolants, 11569293 SizeOfPredicates, 713 NumberOfNonLiveVariables, 9362 ConjunctsInSsa, 1023 ConjunctsInUnsatCore, 65 InterpolantComputations, 3 PerfectInterpolantSequences, 43122/65396 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/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy2_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-23-34-790.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy2_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-23-34-790.csv Completed graceful shutdown