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_partial_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-29 23:52:11,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:52:11,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:52:11,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:52:11,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:52:11,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:52:11,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:52:11,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:52:11,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:52:11,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:52:11,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:52:11,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:52:11,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:52:11,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:52:11,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:52:11,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:52:11,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:52:11,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:52:11,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:52:11,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:52:11,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:52:11,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:52:11,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:52:11,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:52:11,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:52:11,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:52:11,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:52:11,467 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:52:11,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:52:11,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:52:11,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:52:11,468 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:52:11,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:52:11,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:52:11,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:52:11,475 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:52:11,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:52:11,476 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:52:11,476 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:52:11,478 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-29 23:52:11,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-29 23:52:11,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:52:11,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:52:11,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:52:11,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:52:11,481 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:52:11,481 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:52:11,481 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:52:11,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:52:11,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:52:11,520 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:52:11,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:52:11,521 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:52:11,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-01-29 23:52:11,590 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:52:11,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:52:11,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:52:11,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:52:11,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:52:11,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1b5fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11, skipping insertion in model container [2018-01-29 23:52:11,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,609 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:52:11,620 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:52:11,701 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:52:11,710 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:52:11,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11 WrapperNode [2018-01-29 23:52:11,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:52:11,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:52:11,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:52:11,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:52:11,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (1/1) ... [2018-01-29 23:52:11,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:52:11,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:52:11,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:52:11,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:52:11,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (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:52:11,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:52:11,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:52:11,775 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-29 23:52:11,775 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:52:11,775 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:52:11,776 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-29 23:52:11,776 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:52:11,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:52:11,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:52:12,057 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:52:12,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:52:12 BoogieIcfgContainer [2018-01-29 23:52:12,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:52:12,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:52:12,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:52:12,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:52:12,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:52:11" (1/3) ... [2018-01-29 23:52:12,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc82916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:52:12, skipping insertion in model container [2018-01-29 23:52:12,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:52:11" (2/3) ... [2018-01-29 23:52:12,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc82916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:52:12, skipping insertion in model container [2018-01-29 23:52:12,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:52:12" (3/3) ... [2018-01-29 23:52:12,062 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_partial_init_true-unreach-call_ground.i [2018-01-29 23:52:12,067 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:52:12,071 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-29 23:52:12,095 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:52:12,095 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:52:12,095 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:52:12,095 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:52:12,095 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:52:12,095 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:52:12,095 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:52:12,095 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:52:12,096 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:52:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-29 23:52:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:52:12,111 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:12,111 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:52:12,111 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1891153894, now seen corresponding path program 1 times [2018-01-29 23:52:12,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:12,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:12,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:12,178 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:52:12,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:52:12,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:52:12,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:52:12,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:52:12,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:52:12,190 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-29 23:52:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:12,203 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-01-29 23:52:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:52:12,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-29 23:52:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:12,209 INFO L225 Difference]: With dead ends: 70 [2018-01-29 23:52:12,210 INFO L226 Difference]: Without dead ends: 39 [2018-01-29 23:52:12,211 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:52:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-29 23:52:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-29 23:52:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-29 23:52:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-29 23:52:12,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2018-01-29 23:52:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:12,234 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-29 23:52:12,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:52:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-29 23:52:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:52:12,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:12,235 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] [2018-01-29 23:52:12,236 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1514232014, now seen corresponding path program 1 times [2018-01-29 23:52:12,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:12,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:12,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:12,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:52:12,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:52:12,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:52:12,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:52:12,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:52:12,287 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-01-29 23:52:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:12,395 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-01-29 23:52:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:52:12,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-29 23:52:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:12,396 INFO L225 Difference]: With dead ends: 67 [2018-01-29 23:52:12,396 INFO L226 Difference]: Without dead ends: 46 [2018-01-29 23:52:12,397 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:52:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-29 23:52:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-01-29 23:52:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-29 23:52:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-29 23:52:12,400 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-29 23:52:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:12,400 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-29 23:52:12,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:52:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-29 23:52:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:52:12,401 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:12,401 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] [2018-01-29 23:52:12,401 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1837984106, now seen corresponding path program 1 times [2018-01-29 23:52:12,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:12,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:12,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:12,451 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:52:12,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:52:12,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:52:12,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:52:12,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:52:12,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:52:12,452 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-29 23:52:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:12,550 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-29 23:52:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:52:12,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-29 23:52:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:12,551 INFO L225 Difference]: With dead ends: 75 [2018-01-29 23:52:12,551 INFO L226 Difference]: Without dead ends: 49 [2018-01-29 23:52:12,551 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:52:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-29 23:52:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-01-29 23:52:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-29 23:52:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-01-29 23:52:12,554 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 26 [2018-01-29 23:52:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:12,555 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-01-29 23:52:12,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:52:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-01-29 23:52:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 23:52:12,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:12,555 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] [2018-01-29 23:52:12,555 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2047227513, now seen corresponding path program 1 times [2018-01-29 23:52:12,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:12,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:12,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,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:52:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:12,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:12,661 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:52:12,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:12,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:12,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:52:12,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:52:12,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:52:12,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:52:12,738 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-01-29 23:52:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:12,858 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-01-29 23:52:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:52:12,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-29 23:52:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:12,859 INFO L225 Difference]: With dead ends: 89 [2018-01-29 23:52:12,859 INFO L226 Difference]: Without dead ends: 68 [2018-01-29 23:52:12,859 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:52:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-29 23:52:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2018-01-29 23:52:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-29 23:52:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-29 23:52:12,863 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 28 [2018-01-29 23:52:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:12,863 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-29 23:52:12,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:52:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-29 23:52:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:52:12,864 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:12,864 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:52:12,864 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash -433633279, now seen corresponding path program 1 times [2018-01-29 23:52:12,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:12,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:12,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:12,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:12,953 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:52:12,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:12,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:12,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:12,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 23:52:13,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:52:13,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:52:13,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:52:13,000 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 7 states. [2018-01-29 23:52:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:13,172 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2018-01-29 23:52:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:52:13,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-29 23:52:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:13,173 INFO L225 Difference]: With dead ends: 103 [2018-01-29 23:52:13,173 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 23:52:13,174 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:52:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 23:52:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2018-01-29 23:52:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-29 23:52:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-01-29 23:52:13,187 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 34 [2018-01-29 23:52:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:13,187 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-01-29 23:52:13,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:52:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-01-29 23:52:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:52:13,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:13,188 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 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:52:13,188 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1506218889, now seen corresponding path program 2 times [2018-01-29 23:52:13,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:13,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:13,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:13,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:13,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:13,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:13,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:13,306 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:52:13,322 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:52:13,326 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:13,329 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:13,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:13,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:13,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:13,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-29 23:52:13,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:52:13,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:52:13,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:52:13,360 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 9 states. [2018-01-29 23:52:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:13,643 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2018-01-29 23:52:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:52:13,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-29 23:52:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:13,644 INFO L225 Difference]: With dead ends: 117 [2018-01-29 23:52:13,644 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 23:52:13,644 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:52:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 23:52:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-01-29 23:52:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 23:52:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-01-29 23:52:13,648 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 40 [2018-01-29 23:52:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:13,648 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-01-29 23:52:13,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:52:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-01-29 23:52:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:52:13,649 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:13,649 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 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:52:13,649 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash 91363601, now seen corresponding path program 3 times [2018-01-29 23:52:13,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:13,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:13,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:13,650 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:13,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:13,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:13,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:13,749 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:52:13,758 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:52:13,762 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:13,764 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:13,765 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:13,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:13,767 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:13,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:13,798 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 6 treesize of output 5 [2018-01-29 23:52:13,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:13,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:13,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 23:52:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-29 23:52:13,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:13,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-29 23:52:13,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:52:13,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:52:13,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:52:13,940 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 19 states. [2018-01-29 23:52:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:14,879 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2018-01-29 23:52:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 23:52:14,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-29 23:52:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:14,881 INFO L225 Difference]: With dead ends: 204 [2018-01-29 23:52:14,881 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 23:52:14,882 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=610, Invalid=2696, Unknown=0, NotChecked=0, Total=3306 [2018-01-29 23:52:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 23:52:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 137. [2018-01-29 23:52:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-29 23:52:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-01-29 23:52:14,890 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 46 [2018-01-29 23:52:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:14,891 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-01-29 23:52:14,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:52:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-01-29 23:52:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:52:14,891 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:14,892 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 3, 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:52:14,893 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2094196476, now seen corresponding path program 4 times [2018-01-29 23:52:14,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:14,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:14,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:14,894 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:14,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:14,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:15,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:15,032 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:52:15,037 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:52:15,053 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:15,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:15,146 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 6 treesize of output 5 [2018-01-29 23:52:15,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:15,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:15,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:52:15,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:15,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:15,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 23:52:15,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:15,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:15,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-29 23:52:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:15,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:15,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-01-29 23:52:15,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:52:15,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:52:15,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:52:15,449 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 31 states. [2018-01-29 23:52:17,678 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 18 DAG size of output 17 [2018-01-29 23:52:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:18,764 INFO L93 Difference]: Finished difference Result 420 states and 490 transitions. [2018-01-29 23:52:18,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-01-29 23:52:18,764 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-01-29 23:52:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:18,767 INFO L225 Difference]: With dead ends: 420 [2018-01-29 23:52:18,767 INFO L226 Difference]: Without dead ends: 390 [2018-01-29 23:52:18,771 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7212 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1803, Invalid=18219, Unknown=0, NotChecked=0, Total=20022 [2018-01-29 23:52:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-01-29 23:52:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 223. [2018-01-29 23:52:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-29 23:52:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 254 transitions. [2018-01-29 23:52:18,781 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 254 transitions. Word has length 54 [2018-01-29 23:52:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:18,781 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 254 transitions. [2018-01-29 23:52:18,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:52:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2018-01-29 23:52:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:52:18,782 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:18,782 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 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:52:18,783 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1159257404, now seen corresponding path program 5 times [2018-01-29 23:52:18,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:18,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:18,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:18,783 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:18,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:18,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:18,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:18,863 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:52:18,876 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:52:18,880 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,887 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,896 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,897 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,901 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,902 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,904 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:18,904 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:18,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:18,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:18,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-29 23:52:18,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:52:18,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:52:18,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:52:18,939 INFO L87 Difference]: Start difference. First operand 223 states and 254 transitions. Second operand 15 states. [2018-01-29 23:52:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:19,131 INFO L93 Difference]: Finished difference Result 331 states and 384 transitions. [2018-01-29 23:52:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:52:19,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-01-29 23:52:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:19,134 INFO L225 Difference]: With dead ends: 331 [2018-01-29 23:52:19,134 INFO L226 Difference]: Without dead ends: 301 [2018-01-29 23:52:19,134 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:52:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-29 23:52:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 253. [2018-01-29 23:52:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-29 23:52:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 288 transitions. [2018-01-29 23:52:19,149 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 288 transitions. Word has length 60 [2018-01-29 23:52:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:19,149 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 288 transitions. [2018-01-29 23:52:19,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:52:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 288 transitions. [2018-01-29 23:52:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:52:19,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:19,150 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 5, 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:52:19,150 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1860168628, now seen corresponding path program 6 times [2018-01-29 23:52:19,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:19,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:19,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:19,151 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:19,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:19,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:19,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:19,349 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:52:19,358 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:52:19,362 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,363 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,365 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,366 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,370 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,372 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:19,372 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:19,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:19,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:19,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-29 23:52:19,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:52:19,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:52:19,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:52:19,410 INFO L87 Difference]: Start difference. First operand 253 states and 288 transitions. Second operand 17 states. [2018-01-29 23:52:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:19,878 INFO L93 Difference]: Finished difference Result 361 states and 418 transitions. [2018-01-29 23:52:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:52:19,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-01-29 23:52:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:19,881 INFO L225 Difference]: With dead ends: 361 [2018-01-29 23:52:19,881 INFO L226 Difference]: Without dead ends: 331 [2018-01-29 23:52:19,882 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:52:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-29 23:52:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 283. [2018-01-29 23:52:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:52:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 322 transitions. [2018-01-29 23:52:19,888 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 322 transitions. Word has length 66 [2018-01-29 23:52:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:19,888 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 322 transitions. [2018-01-29 23:52:19,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:52:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 322 transitions. [2018-01-29 23:52:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 23:52:19,890 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:19,890 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 6, 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:52:19,890 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1250967596, now seen corresponding path program 7 times [2018-01-29 23:52:19,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:19,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:19,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:19,891 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:19,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:19,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:20,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:20,029 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:52:20,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:20,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:20,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:20,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-29 23:52:20,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:52:20,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:52:20,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:52:20,074 INFO L87 Difference]: Start difference. First operand 283 states and 322 transitions. Second operand 19 states. [2018-01-29 23:52:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:20,457 INFO L93 Difference]: Finished difference Result 391 states and 452 transitions. [2018-01-29 23:52:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:52:20,460 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-01-29 23:52:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:20,461 INFO L225 Difference]: With dead ends: 391 [2018-01-29 23:52:20,461 INFO L226 Difference]: Without dead ends: 361 [2018-01-29 23:52:20,461 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:52:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-01-29 23:52:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 313. [2018-01-29 23:52:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-29 23:52:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 356 transitions. [2018-01-29 23:52:20,468 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 356 transitions. Word has length 72 [2018-01-29 23:52:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:20,468 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 356 transitions. [2018-01-29 23:52:20,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:52:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 356 transitions. [2018-01-29 23:52:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-29 23:52:20,469 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:20,469 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 7, 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:52:20,470 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 107128156, now seen corresponding path program 8 times [2018-01-29 23:52:20,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:20,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:20,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:20,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:20,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:20,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:20,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:20,609 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:52:20,619 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:52:20,624 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:20,628 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:20,629 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:20,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:20,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:20,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-01-29 23:52:20,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:52:20,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:52:20,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:52:20,662 INFO L87 Difference]: Start difference. First operand 313 states and 356 transitions. Second operand 21 states. [2018-01-29 23:52:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:20,863 INFO L93 Difference]: Finished difference Result 421 states and 486 transitions. [2018-01-29 23:52:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:52:20,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-01-29 23:52:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:20,864 INFO L225 Difference]: With dead ends: 421 [2018-01-29 23:52:20,864 INFO L226 Difference]: Without dead ends: 391 [2018-01-29 23:52:20,864 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 79 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:52:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-29 23:52:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 343. [2018-01-29 23:52:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-01-29 23:52:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 390 transitions. [2018-01-29 23:52:20,871 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 390 transitions. Word has length 78 [2018-01-29 23:52:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:20,872 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 390 transitions. [2018-01-29 23:52:20,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:52:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 390 transitions. [2018-01-29 23:52:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:52:20,872 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:20,872 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 8, 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:52:20,873 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1730495716, now seen corresponding path program 9 times [2018-01-29 23:52:20,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:20,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:20,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:20,873 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:20,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:20,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:21,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:21,035 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:52:21,042 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:52:21,046 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:21,055 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:21,056 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:21,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:21,091 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:21,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:21,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:21,123 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 6 treesize of output 5 [2018-01-29 23:52:21,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:21,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:21,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 23:52:21,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:21,152 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 12 treesize of output 15 [2018-01-29 23:52:21,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:21,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:21,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:52:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-29 23:52:21,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:21,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 32 [2018-01-29 23:52:21,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:52:21,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:52:21,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:52:21,245 INFO L87 Difference]: Start difference. First operand 343 states and 390 transitions. Second operand 32 states. [2018-01-29 23:52:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:23,695 INFO L93 Difference]: Finished difference Result 720 states and 839 transitions. [2018-01-29 23:52:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-01-29 23:52:23,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 84 [2018-01-29 23:52:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:23,697 INFO L225 Difference]: With dead ends: 720 [2018-01-29 23:52:23,698 INFO L226 Difference]: Without dead ends: 690 [2018-01-29 23:52:23,701 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7062 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3736, Invalid=16570, Unknown=0, NotChecked=0, Total=20306 [2018-01-29 23:52:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-01-29 23:52:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 442. [2018-01-29 23:52:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-29 23:52:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 503 transitions. [2018-01-29 23:52:23,711 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 503 transitions. Word has length 84 [2018-01-29 23:52:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:23,711 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 503 transitions. [2018-01-29 23:52:23,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:52:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 503 transitions. [2018-01-29 23:52:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 23:52:23,712 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:23,712 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 9, 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:52:23,712 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -192658772, now seen corresponding path program 10 times [2018-01-29 23:52:23,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:23,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:23,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:23,713 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:23,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:23,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:24,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:24,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 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:52:24,014 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:52:24,024 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:24,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:24,045 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 6 treesize of output 5 [2018-01-29 23:52:24,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:24,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:24,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:52:24,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:24,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:24,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 23:52:24,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:24,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:24,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-29 23:52:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 134 proven. 217 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:52:24,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:24,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 53 [2018-01-29 23:52:24,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 23:52:24,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 23:52:24,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2472, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:52:24,618 INFO L87 Difference]: Start difference. First operand 442 states and 503 transitions. Second operand 53 states. [2018-01-29 23:52:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:33,154 INFO L93 Difference]: Finished difference Result 1320 states and 1547 transitions. [2018-01-29 23:52:33,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 351 states. [2018-01-29 23:52:33,154 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 90 [2018-01-29 23:52:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:33,157 INFO L225 Difference]: With dead ends: 1320 [2018-01-29 23:52:33,157 INFO L226 Difference]: Without dead ends: 1286 [2018-01-29 23:52:33,164 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57917 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13325, Invalid=126177, Unknown=0, NotChecked=0, Total=139502 [2018-01-29 23:52:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-01-29 23:52:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 710. [2018-01-29 23:52:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-01-29 23:52:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 815 transitions. [2018-01-29 23:52:33,181 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 815 transitions. Word has length 90 [2018-01-29 23:52:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:33,181 INFO L432 AbstractCegarLoop]: Abstraction has 710 states and 815 transitions. [2018-01-29 23:52:33,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 23:52:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 815 transitions. [2018-01-29 23:52:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-29 23:52:33,182 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:33,182 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 10, 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:52:33,182 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash -916628876, now seen corresponding path program 11 times [2018-01-29 23:52:33,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:33,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:33,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:33,183 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:33,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:33,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:33,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:33,361 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:52:33,366 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:52:33,369 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,380 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,386 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,397 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,398 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,399 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,400 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,401 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,403 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,404 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,420 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:33,421 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:33,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:33,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:33,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-01-29 23:52:33,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:52:33,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:52:33,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:52:33,449 INFO L87 Difference]: Start difference. First operand 710 states and 815 transitions. Second operand 27 states. [2018-01-29 23:52:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:33,923 INFO L93 Difference]: Finished difference Result 893 states and 1041 transitions. [2018-01-29 23:52:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-29 23:52:33,924 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-01-29 23:52:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:33,925 INFO L225 Difference]: With dead ends: 893 [2018-01-29 23:52:33,925 INFO L226 Difference]: Without dead ends: 859 [2018-01-29 23:52:33,926 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 23:52:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-01-29 23:52:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 746. [2018-01-29 23:52:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-01-29 23:52:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 856 transitions. [2018-01-29 23:52:33,939 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 856 transitions. Word has length 96 [2018-01-29 23:52:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:33,939 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 856 transitions. [2018-01-29 23:52:33,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:52:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 856 transitions. [2018-01-29 23:52:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 23:52:33,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:33,940 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 11, 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:52:33,940 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 111278076, now seen corresponding path program 12 times [2018-01-29 23:52:33,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:33,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:33,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:33,941 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:33,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:33,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:52:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:34,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:34,156 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:52:34,160 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:52:34,196 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,197 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,198 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,199 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,200 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,201 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,202 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,203 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,204 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,207 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:52:34,207 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:34,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:34,218 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 6 treesize of output 5 [2018-01-29 23:52:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:34,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:34,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:52:34,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:34,298 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 12 treesize of output 15 [2018-01-29 23:52:34,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:34,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:34,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:52:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 263 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-01-29 23:52:34,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:34,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2018-01-29 23:52:34,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:52:34,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:52:34,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:52:34,401 INFO L87 Difference]: Start difference. First operand 746 states and 856 transitions. Second operand 40 states. [2018-01-29 23:52:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:38,191 INFO L93 Difference]: Finished difference Result 1036 states and 1207 transitions. [2018-01-29 23:52:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-01-29 23:52:38,192 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 102 [2018-01-29 23:52:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:38,194 INFO L225 Difference]: With dead ends: 1036 [2018-01-29 23:52:38,194 INFO L226 Difference]: Without dead ends: 1002 [2018-01-29 23:52:38,197 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18862 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7791, Invalid=43511, Unknown=0, NotChecked=0, Total=51302 [2018-01-29 23:52:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-01-29 23:52:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 447. [2018-01-29 23:52:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-01-29 23:52:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 506 transitions. [2018-01-29 23:52:38,212 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 506 transitions. Word has length 102 [2018-01-29 23:52:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:38,213 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 506 transitions. [2018-01-29 23:52:38,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 23:52:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 506 transitions. [2018-01-29 23:52:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-29 23:52:38,214 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:38,214 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 11, 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:52:38,214 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1224190503, now seen corresponding path program 13 times [2018-01-29 23:52:38,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:38,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:38,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:38,215 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:38,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:38,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:38,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:38,520 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:52:38,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:38,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:38,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:38,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-29 23:52:38,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:52:38,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:52:38,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:52:38,565 INFO L87 Difference]: Start difference. First operand 447 states and 506 transitions. Second operand 31 states. [2018-01-29 23:52:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:38,913 INFO L93 Difference]: Finished difference Result 528 states and 601 transitions. [2018-01-29 23:52:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-29 23:52:38,914 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 110 [2018-01-29 23:52:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:38,915 INFO L225 Difference]: With dead ends: 528 [2018-01-29 23:52:38,915 INFO L226 Difference]: Without dead ends: 494 [2018-01-29 23:52:38,916 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:52:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-29 23:52:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 469. [2018-01-29 23:52:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-01-29 23:52:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 531 transitions. [2018-01-29 23:52:38,928 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 531 transitions. Word has length 110 [2018-01-29 23:52:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:38,928 INFO L432 AbstractCegarLoop]: Abstraction has 469 states and 531 transitions. [2018-01-29 23:52:38,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:52:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 531 transitions. [2018-01-29 23:52:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-29 23:52:38,929 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:38,929 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 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:52:38,929 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:38,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1342035082, now seen corresponding path program 1 times [2018-01-29 23:52:38,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:38,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:38,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:38,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:38,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:38,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-01-29 23:52:39,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:52:39,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:52:39,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:52:39,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:52:39,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:52:39,127 INFO L87 Difference]: Start difference. First operand 469 states and 531 transitions. Second operand 5 states. [2018-01-29 23:52:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:39,362 INFO L93 Difference]: Finished difference Result 486 states and 550 transitions. [2018-01-29 23:52:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:52:39,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-01-29 23:52:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:39,364 INFO L225 Difference]: With dead ends: 486 [2018-01-29 23:52:39,364 INFO L226 Difference]: Without dead ends: 473 [2018-01-29 23:52:39,364 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:52:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-01-29 23:52:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 462. [2018-01-29 23:52:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-01-29 23:52:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 522 transitions. [2018-01-29 23:52:39,375 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 522 transitions. Word has length 115 [2018-01-29 23:52:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:39,375 INFO L432 AbstractCegarLoop]: Abstraction has 462 states and 522 transitions. [2018-01-29 23:52:39,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:52:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 522 transitions. [2018-01-29 23:52:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-29 23:52:39,376 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:39,376 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 12, 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:52:39,376 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1567801647, now seen corresponding path program 14 times [2018-01-29 23:52:39,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:39,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:39,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:52:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:39,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:39,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:39,694 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:52:39,699 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:52:39,703 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:39,709 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:52:39,710 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:39,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:39,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:39,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-29 23:52:39,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:52:39,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:52:39,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:52:39,739 INFO L87 Difference]: Start difference. First operand 462 states and 522 transitions. Second operand 33 states. [2018-01-29 23:52:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:40,130 INFO L93 Difference]: Finished difference Result 547 states and 621 transitions. [2018-01-29 23:52:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 23:52:40,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 116 [2018-01-29 23:52:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:40,132 INFO L225 Difference]: With dead ends: 547 [2018-01-29 23:52:40,132 INFO L226 Difference]: Without dead ends: 515 [2018-01-29 23:52:40,132 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 23:52:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-01-29 23:52:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 492. [2018-01-29 23:52:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-01-29 23:52:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 556 transitions. [2018-01-29 23:52:40,145 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 556 transitions. Word has length 116 [2018-01-29 23:52:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:40,145 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 556 transitions. [2018-01-29 23:52:40,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:52:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 556 transitions. [2018-01-29 23:52:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-29 23:52:40,146 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:40,146 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 13, 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:52:40,146 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1077047863, now seen corresponding path program 15 times [2018-01-29 23:52:40,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:40,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:40,147 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:40,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:40,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:40,454 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:52:40,458 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:52:40,464 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,465 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,466 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:52:40,470 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:40,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:40,509 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 6 treesize of output 5 [2018-01-29 23:52:40,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 23:52:40,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:40,551 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 12 treesize of output 15 [2018-01-29 23:52:40,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:52:40,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:40,573 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 12 treesize of output 15 [2018-01-29 23:52:40,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:40,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:52:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-01-29 23:52:40,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:40,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 12] total 45 [2018-01-29 23:52:40,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 23:52:40,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 23:52:40,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:52:40,696 INFO L87 Difference]: Start difference. First operand 492 states and 556 transitions. Second operand 45 states. [2018-01-29 23:52:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:52:44,955 INFO L93 Difference]: Finished difference Result 1013 states and 1157 transitions. [2018-01-29 23:52:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-01-29 23:52:44,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 122 [2018-01-29 23:52:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:52:44,957 INFO L225 Difference]: With dead ends: 1013 [2018-01-29 23:52:44,957 INFO L226 Difference]: Without dead ends: 981 [2018-01-29 23:52:44,960 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27244 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=11768, Invalid=59254, Unknown=0, NotChecked=0, Total=71022 [2018-01-29 23:52:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-01-29 23:52:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 601. [2018-01-29 23:52:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-01-29 23:52:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 683 transitions. [2018-01-29 23:52:44,979 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 683 transitions. Word has length 122 [2018-01-29 23:52:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:52:44,979 INFO L432 AbstractCegarLoop]: Abstraction has 601 states and 683 transitions. [2018-01-29 23:52:44,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 23:52:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 683 transitions. [2018-01-29 23:52:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-29 23:52:44,980 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:52:44,980 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 14, 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:52:44,980 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:52:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash -735258113, now seen corresponding path program 16 times [2018-01-29 23:52:44,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:52:44,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:52:44,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:44,981 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:52:44,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:52:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:52:44,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:52:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:52:45,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:52:45,303 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:52:45,308 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:52:45,319 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:52:45,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:52:45,338 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 6 treesize of output 5 [2018-01-29 23:52:45,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:52:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 23:52:45,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-29 23:52:45,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:52:45,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 50 [2018-01-29 23:52:45,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:52:45,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-29 23:52:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 520 proven. 333 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:52:46,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:52:46,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 44] total 79 [2018-01-29 23:52:46,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-01-29 23:52:46,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-01-29 23:52:46,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=5518, Unknown=0, NotChecked=0, Total=6162 [2018-01-29 23:52:46,676 INFO L87 Difference]: Start difference. First operand 601 states and 683 transitions. Second operand 79 states. [2018-01-29 23:53:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:14,353 INFO L93 Difference]: Finished difference Result 3066 states and 3557 transitions. [2018-01-29 23:53:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 764 states. [2018-01-29 23:53:14,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 128 [2018-01-29 23:53:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:14,358 INFO L225 Difference]: With dead ends: 3066 [2018-01-29 23:53:14,358 INFO L226 Difference]: Without dead ends: 3034 [2018-01-29 23:53:14,372 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 799 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283316 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=47125, Invalid=593675, Unknown=0, NotChecked=0, Total=640800 [2018-01-29 23:53:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-01-29 23:53:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 1458. [2018-01-29 23:53:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-01-29 23:53:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1669 transitions. [2018-01-29 23:53:14,417 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1669 transitions. Word has length 128 [2018-01-29 23:53:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:14,417 INFO L432 AbstractCegarLoop]: Abstraction has 1458 states and 1669 transitions. [2018-01-29 23:53:14,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-01-29 23:53:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1669 transitions. [2018-01-29 23:53:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-29 23:53:14,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:14,419 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 15, 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:53:14,419 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:53:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28166023, now seen corresponding path program 17 times [2018-01-29 23:53:14,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:14,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:14,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:14,420 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:14,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:14,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:14,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:14,858 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:53:14,862 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:53:14,866 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,867 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,868 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,870 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,872 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,873 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,875 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,876 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,877 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,878 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,879 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,880 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,881 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,882 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,884 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:14,885 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:14,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:14,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:14,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-29 23:53:14,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 23:53:14,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 23:53:14,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:53:14,917 INFO L87 Difference]: Start difference. First operand 1458 states and 1669 transitions. Second operand 39 states. [2018-01-29 23:53:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:15,415 INFO L93 Difference]: Finished difference Result 1697 states and 1968 transitions. [2018-01-29 23:53:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 23:53:15,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 134 [2018-01-29 23:53:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:15,419 INFO L225 Difference]: With dead ends: 1697 [2018-01-29 23:53:15,419 INFO L226 Difference]: Without dead ends: 1665 [2018-01-29 23:53:15,419 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:53:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-01-29 23:53:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1510. [2018-01-29 23:53:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2018-01-29 23:53:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1728 transitions. [2018-01-29 23:53:15,458 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1728 transitions. Word has length 134 [2018-01-29 23:53:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:15,459 INFO L432 AbstractCegarLoop]: Abstraction has 1510 states and 1728 transitions. [2018-01-29 23:53:15,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 23:53:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1728 transitions. [2018-01-29 23:53:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-01-29 23:53:15,461 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:15,461 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 16, 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:53:15,461 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:53:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1533344463, now seen corresponding path program 18 times [2018-01-29 23:53:15,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:15,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:15,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:15,461 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:15,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:15,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 0 proven. 1070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:16,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:16,120 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:53:16,125 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:53:16,129 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,135 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,136 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,140 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,147 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,148 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,154 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,156 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,157 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,158 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,160 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,161 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:53:16,162 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:16,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:16,209 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 6 treesize of output 5 [2018-01-29 23:53:16,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 23:53:16,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:16,247 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 12 treesize of output 15 [2018-01-29 23:53:16,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:53:16,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:16,276 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 12 treesize of output 15 [2018-01-29 23:53:16,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:16,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:53:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-01-29 23:53:16,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:16,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 14] total 53 [2018-01-29 23:53:16,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 23:53:16,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 23:53:16,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:53:16,410 INFO L87 Difference]: Start difference. First operand 1510 states and 1728 transitions. Second operand 53 states. [2018-01-29 23:53:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:22,375 INFO L93 Difference]: Finished difference Result 2884 states and 3363 transitions. [2018-01-29 23:53:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2018-01-29 23:53:22,375 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 140 [2018-01-29 23:53:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:22,380 INFO L225 Difference]: With dead ends: 2884 [2018-01-29 23:53:22,380 INFO L226 Difference]: Without dead ends: 2852 [2018-01-29 23:53:22,385 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38478 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=16398, Invalid=82512, Unknown=0, NotChecked=0, Total=98910 [2018-01-29 23:53:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2018-01-29 23:53:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1548. [2018-01-29 23:53:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2018-01-29 23:53:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1771 transitions. [2018-01-29 23:53:22,458 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1771 transitions. Word has length 140 [2018-01-29 23:53:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:22,458 INFO L432 AbstractCegarLoop]: Abstraction has 1548 states and 1771 transitions. [2018-01-29 23:53:22,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 23:53:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1771 transitions. [2018-01-29 23:53:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-29 23:53:22,460 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:22,460 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 17, 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:53:22,460 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:53:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash -548405097, now seen corresponding path program 19 times [2018-01-29 23:53:22,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:22,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:22,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:22,461 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:22,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:22,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 1186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:22,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:22,924 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:53:22,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:22,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 0 proven. 1186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:22,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:22,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-01-29 23:53:22,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 23:53:22,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 23:53:22,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:53:22,980 INFO L87 Difference]: Start difference. First operand 1548 states and 1771 transitions. Second operand 43 states. [2018-01-29 23:53:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:23,608 INFO L93 Difference]: Finished difference Result 1787 states and 2070 transitions. [2018-01-29 23:53:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-29 23:53:23,609 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 146 [2018-01-29 23:53:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:23,612 INFO L225 Difference]: With dead ends: 1787 [2018-01-29 23:53:23,612 INFO L226 Difference]: Without dead ends: 1755 [2018-01-29 23:53:23,613 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-01-29 23:53:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-01-29 23:53:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1600. [2018-01-29 23:53:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-29 23:53:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1830 transitions. [2018-01-29 23:53:23,663 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1830 transitions. Word has length 146 [2018-01-29 23:53:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:23,663 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1830 transitions. [2018-01-29 23:53:23,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 23:53:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1830 transitions. [2018-01-29 23:53:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-01-29 23:53:23,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:23,665 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 18, 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:53:23,665 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:53:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1994643489, now seen corresponding path program 20 times [2018-01-29 23:53:23,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:23,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:23,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:23,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:53:23,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:23,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 0 proven. 1308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:24,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:24,161 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:53:24,165 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:53:24,177 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:24,184 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:53:24,186 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:24,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 0 proven. 1308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:24,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:24,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-01-29 23:53:24,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 23:53:24,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 23:53:24,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:53:24,226 INFO L87 Difference]: Start difference. First operand 1600 states and 1830 transitions. Second operand 45 states. [2018-01-29 23:53:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:53:24,914 INFO L93 Difference]: Finished difference Result 1839 states and 2129 transitions. [2018-01-29 23:53:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-29 23:53:24,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 152 [2018-01-29 23:53:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:53:24,917 INFO L225 Difference]: With dead ends: 1839 [2018-01-29 23:53:24,917 INFO L226 Difference]: Without dead ends: 1807 [2018-01-29 23:53:24,918 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-01-29 23:53:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2018-01-29 23:53:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1652. [2018-01-29 23:53:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-01-29 23:53:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1889 transitions. [2018-01-29 23:53:24,969 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1889 transitions. Word has length 152 [2018-01-29 23:53:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:53:24,969 INFO L432 AbstractCegarLoop]: Abstraction has 1652 states and 1889 transitions. [2018-01-29 23:53:24,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 23:53:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1889 transitions. [2018-01-29 23:53:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-29 23:53:24,977 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:53:24,977 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 19, 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:53:24,977 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:53:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1649428185, now seen corresponding path program 21 times [2018-01-29 23:53:24,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:53:24,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:53:24,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,978 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:53:24,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:53:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:53:24,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:53:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 1436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:53:25,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:53:25,643 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:53:25,648 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:53:25,652 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,653 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,655 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,655 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,656 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,657 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,659 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,660 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,660 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,661 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,662 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,663 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,664 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,665 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,667 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,668 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:53:25,669 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:53:25,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:53:25,729 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 6 treesize of output 5 [2018-01-29 23:53:25,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 23:53:25,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:25,765 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 12 treesize of output 15 [2018-01-29 23:53:25,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:53:25,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:53:25,814 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 12 treesize of output 15 [2018-01-29 23:53:25,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:53:25,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-01-29 23:53:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2018-01-29 23:53:25,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:53:25,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 16] total 61 [2018-01-29 23:53:25,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-29 23:53:25,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-29 23:53:25,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 23:53:25,965 INFO L87 Difference]: Start difference. First operand 1652 states and 1889 transitions. Second operand 61 states. Received shutdown request... [2018-01-29 23:53:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-29 23:53:26,836 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:53:26,839 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:53:26,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:53:26 BoogieIcfgContainer [2018-01-29 23:53:26,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:53:26,840 INFO L168 Benchmark]: Toolchain (without parser) took 75249.29 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 116.1 MB in the beginning and 344.1 MB in the end (delta: -228.0 MB). Peak memory consumption was 786.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:26,841 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:53:26,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.80 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 107.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:26,841 INFO L168 Benchmark]: Boogie Preprocessor took 16.84 ms. Allocated memory is still 151.0 MB. Free memory was 107.7 MB in the beginning and 106.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:26,841 INFO L168 Benchmark]: RCFGBuilder took 320.14 ms. Allocated memory is still 151.0 MB. Free memory was 106.1 MB in the beginning and 93.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:26,842 INFO L168 Benchmark]: TraceAbstraction took 74781.27 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.0 MB in the beginning and 344.1 MB in the end (delta: -251.1 MB). Peak memory consumption was 762.9 MB. Max. memory is 5.3 GB. [2018-01-29 23:53:26,842 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 128.80 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 107.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 16.84 ms. Allocated memory is still 151.0 MB. Free memory was 107.7 MB in the beginning and 106.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.14 ms. Allocated memory is still 151.0 MB. Free memory was 106.1 MB in the beginning and 93.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74781.27 ms. Allocated memory was 151.0 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.0 MB in the beginning and 344.1 MB in the end (delta: -251.1 MB). Peak memory consumption was 762.9 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 constructing difference of abstraction (1652states) and interpolant automaton (currently 70 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 14. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. TIMEOUT Result, 74.7s OverallTime, 26 OverallIterations, 23 TraceHistogramMax, 63.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1212 SDtfs, 8202 SDslu, 22816 SDs, 0 SdLazy, 20608 SolverSat, 3394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4931 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 2996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450319 ImplicationChecksByTransitivity, 58.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1652occurred in iteration=25, 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.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 5729 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 4292 NumberOfCodeBlocks, 4094 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 4244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2079375 SizeOfPredicates, 387 NumberOfNonLiveVariables, 2716 ConjunctsInSsa, 526 ConjunctsInUnsatCore, 48 InterpolantComputations, 4 PerfectInterpolantSequences, 3331/23070 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_partial_init_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-53-26-849.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_partial_init_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-53-26-849.csv Completed graceful shutdown