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/sorting_selectionsort_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-29 23:17:25,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:17:25,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:17:25,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:17:25,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:17:25,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:17:25,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:17:25,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:17:25,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:17:25,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:17:25,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:17:25,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:17:25,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:17:25,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:17:25,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:17:25,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:17:25,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:17:25,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:17:25,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:17:25,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:17:25,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:17:25,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:17:25,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:17:25,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:17:25,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:17:25,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:17:25,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:17:25,607 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:17:25,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:17:25,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:17:25,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:17:25,608 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:17:25,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:17:25,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:17:25,613 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:17:25,613 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:17:25,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:17:25,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:17:25,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:17:25,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-29 23:17:25,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:17:25,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:17:25,615 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:17:25,616 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:17:25,616 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:17:25,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:17:25,640 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:17:25,642 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:17:25,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:17:25,643 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:17:25,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-01-29 23:17:25,710 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:17:25,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:17:25,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:17:25,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:17:25,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:17:25,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ff2267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25, skipping insertion in model container [2018-01-29 23:17:25,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,727 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:17:25,736 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:17:25,807 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:17:25,816 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:17:25,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25 WrapperNode [2018-01-29 23:17:25,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:17:25,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:17:25,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:17:25,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:17:25,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (1/1) ... [2018-01-29 23:17:25,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:17:25,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:17:25,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:17:25,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:17:25,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (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:17:25,878 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:17:25,878 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:17:25,878 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-29 23:17:25,878 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:17:25,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:17:25,878 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-29 23:17:25,878 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:17:25,878 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:17:25,878 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:17:26,154 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:17:26,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:17:26 BoogieIcfgContainer [2018-01-29 23:17:26,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:17:26,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:17:26,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:17:26,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:17:26,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:17:25" (1/3) ... [2018-01-29 23:17:26,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3714f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:17:26, skipping insertion in model container [2018-01-29 23:17:26,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:17:25" (2/3) ... [2018-01-29 23:17:26,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3714f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:17:26, skipping insertion in model container [2018-01-29 23:17:26,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:17:26" (3/3) ... [2018-01-29 23:17:26,159 INFO L107 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_true-unreach-call_ground.i [2018-01-29 23:17:26,164 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:17:26,168 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-29 23:17:26,192 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:17:26,192 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:17:26,192 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:17:26,192 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:17:26,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:17:26,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:17:26,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:17:26,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:17:26,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:17:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-29 23:17:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:17:26,205 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:26,206 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:17:26,206 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1489825750, now seen corresponding path program 1 times [2018-01-29 23:17:26,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:26,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:26,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:26,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:26,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:26,273 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:17:26,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:17:26,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:17:26,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:17:26,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:17:26,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:17:26,285 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-29 23:17:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:26,300 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2018-01-29 23:17:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:17:26,301 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-29 23:17:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:26,307 INFO L225 Difference]: With dead ends: 124 [2018-01-29 23:17:26,307 INFO L226 Difference]: Without dead ends: 61 [2018-01-29 23:17:26,309 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:17:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-29 23:17:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-29 23:17:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-29 23:17:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-01-29 23:17:26,333 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 19 [2018-01-29 23:17:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:26,342 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-01-29 23:17:26,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:17:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-01-29 23:17:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:17:26,343 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:26,343 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:17:26,343 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 193688136, now seen corresponding path program 1 times [2018-01-29 23:17:26,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:26,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:26,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:26,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:26,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:26,408 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:17:26,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:17:26,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:17:26,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:17:26,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:17:26,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:17:26,410 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 3 states. [2018-01-29 23:17:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:26,571 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2018-01-29 23:17:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:17:26,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-29 23:17:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:26,573 INFO L225 Difference]: With dead ends: 114 [2018-01-29 23:17:26,573 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 23:17:26,628 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:17:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 23:17:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2018-01-29 23:17:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-29 23:17:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-01-29 23:17:26,634 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 20 [2018-01-29 23:17:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:26,634 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-01-29 23:17:26,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:17:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-01-29 23:17:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:17:26,635 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:26,635 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:26,636 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash -967137457, now seen corresponding path program 1 times [2018-01-29 23:17:26,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:26,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:26,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:26,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:26,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:26,699 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:17:26,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:17:26,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:17:26,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:17:26,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:17:26,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:17:26,700 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 4 states. [2018-01-29 23:17:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:26,907 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2018-01-29 23:17:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:17:26,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 23:17:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:26,908 INFO L225 Difference]: With dead ends: 153 [2018-01-29 23:17:26,908 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 23:17:26,909 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:17:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 23:17:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 67. [2018-01-29 23:17:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 23:17:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-29 23:17:26,913 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 25 [2018-01-29 23:17:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:26,914 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-29 23:17:26,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:17:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-29 23:17:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 23:17:26,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:26,914 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:26,914 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1547407481, now seen corresponding path program 1 times [2018-01-29 23:17:26,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:26,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:26,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:26,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:26,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:26,959 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:17:26,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:26,960 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:17:26,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:26,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:26,996 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:17:27,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:27,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-29 23:17:27,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:17:27,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:17:27,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:17:27,014 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 5 states. [2018-01-29 23:17:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:27,153 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2018-01-29 23:17:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:17:27,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-29 23:17:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:27,154 INFO L225 Difference]: With dead ends: 158 [2018-01-29 23:17:27,154 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 23:17:27,154 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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:17:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 23:17:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-01-29 23:17:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 23:17:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-29 23:17:27,163 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 29 [2018-01-29 23:17:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:27,163 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-29 23:17:27,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:17:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-29 23:17:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 23:17:27,164 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:27,164 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:27,164 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785473, now seen corresponding path program 2 times [2018-01-29 23:17:27,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:27,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:27,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:27,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:27,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:27,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:17:27,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:27,252 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:17:27,264 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:17:27,270 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:27,272 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:27,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:17:27,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:17:27,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-29 23:17:27,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:17:27,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:17:27,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:17:27,321 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 10 states. [2018-01-29 23:17:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:27,708 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2018-01-29 23:17:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:17:27,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-29 23:17:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:27,714 INFO L225 Difference]: With dead ends: 162 [2018-01-29 23:17:27,714 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 23:17:27,714 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:17:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 23:17:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-01-29 23:17:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 23:17:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-29 23:17:27,720 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 33 [2018-01-29 23:17:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:27,721 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-29 23:17:27,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:17:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-29 23:17:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:17:27,721 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:27,721 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:27,721 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1897902674, now seen corresponding path program 1 times [2018-01-29 23:17:27,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:27,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:27,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:27,722 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:27,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:27,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:27,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:27,836 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:17:27,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:27,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:27,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:27,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-29 23:17:27,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:17:27,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:17:27,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:17:27,874 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 7 states. [2018-01-29 23:17:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:28,097 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-01-29 23:17:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:17:28,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-01-29 23:17:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:28,099 INFO L225 Difference]: With dead ends: 180 [2018-01-29 23:17:28,099 INFO L226 Difference]: Without dead ends: 112 [2018-01-29 23:17:28,100 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:17:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-29 23:17:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-29 23:17:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 23:17:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2018-01-29 23:17:28,104 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 47 [2018-01-29 23:17:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:28,104 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2018-01-29 23:17:28,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:17:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2018-01-29 23:17:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:17:28,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:28,105 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:28,105 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2111988762, now seen corresponding path program 2 times [2018-01-29 23:17:28,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:28,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:28,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:28,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:28,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:28,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:28,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:28,184 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) [2018-01-29 23:17:28,199 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:17:28,203 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:28,211 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:28,216 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:28,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:28,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:28,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:17:28,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:17:28,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:17:28,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:17:28,243 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2018-01-29 23:17:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:28,517 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2018-01-29 23:17:28,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:17:28,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-29 23:17:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:28,518 INFO L225 Difference]: With dead ends: 185 [2018-01-29 23:17:28,518 INFO L226 Difference]: Without dead ends: 117 [2018-01-29 23:17:28,518 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:17:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-29 23:17:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2018-01-29 23:17:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-29 23:17:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-01-29 23:17:28,531 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 51 [2018-01-29 23:17:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:28,531 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-01-29 23:17:28,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:17:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-01-29 23:17:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 23:17:28,540 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:28,540 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:28,540 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash -585560546, now seen corresponding path program 3 times [2018-01-29 23:17:28,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:28,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:28,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:28,541 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:28,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:28,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:28,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:28,687 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:17:28,692 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:17:28,696 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:28,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:28,699 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:28,699 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:28,700 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:28,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-29 23:17:28,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:28,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-01-29 23:17:28,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:17:28,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:17:28,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:17:28,977 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 20 states. [2018-01-29 23:17:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:29,588 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2018-01-29 23:17:29,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:17:29,589 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-01-29 23:17:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:29,590 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:17:29,590 INFO L226 Difference]: Without dead ends: 189 [2018-01-29 23:17:29,591 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:17:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-29 23:17:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-01-29 23:17:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-29 23:17:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2018-01-29 23:17:29,597 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 55 [2018-01-29 23:17:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:29,597 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2018-01-29 23:17:29,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:17:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2018-01-29 23:17:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:17:29,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:29,598 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:29,598 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1089984412, now seen corresponding path program 1 times [2018-01-29 23:17:29,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:29,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:29,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:29,599 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:29,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:29,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-29 23:17:29,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:29,662 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:17:29,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:29,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:29,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:29,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-01-29 23:17:29,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:17:29,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:17:29,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:17:29,787 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 13 states. [2018-01-29 23:17:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:30,217 INFO L93 Difference]: Finished difference Result 386 states and 466 transitions. [2018-01-29 23:17:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:17:30,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-01-29 23:17:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:30,219 INFO L225 Difference]: With dead ends: 386 [2018-01-29 23:17:30,219 INFO L226 Difference]: Without dead ends: 303 [2018-01-29 23:17:30,220 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:17:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-29 23:17:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 198. [2018-01-29 23:17:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-29 23:17:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2018-01-29 23:17:30,227 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 60 [2018-01-29 23:17:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:30,227 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2018-01-29 23:17:30,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:17:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2018-01-29 23:17:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 23:17:30,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:30,228 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:30,229 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1880323618, now seen corresponding path program 2 times [2018-01-29 23:17:30,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:30,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:30,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:30,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:30,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:30,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:30,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:30,413 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:17:30,418 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:17:30,428 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:30,433 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:30,436 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:30,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:17:30,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:30,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-01-29 23:17:30,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:17:30,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:17:30,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:17:30,479 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 15 states. [2018-01-29 23:17:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:31,216 INFO L93 Difference]: Finished difference Result 497 states and 595 transitions. [2018-01-29 23:17:31,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:17:31,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-01-29 23:17:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:31,217 INFO L225 Difference]: With dead ends: 497 [2018-01-29 23:17:31,217 INFO L226 Difference]: Without dead ends: 410 [2018-01-29 23:17:31,218 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:17:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-01-29 23:17:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 164. [2018-01-29 23:17:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-29 23:17:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2018-01-29 23:17:31,225 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 65 [2018-01-29 23:17:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:31,225 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2018-01-29 23:17:31,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:17:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2018-01-29 23:17:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:17:31,226 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:31,227 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:31,227 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1244979588, now seen corresponding path program 1 times [2018-01-29 23:17:31,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:31,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:31,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,227 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:31,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:31,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-01-29 23:17:31,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:17:31,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:17:31,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:17:31,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:17:31,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:17:31,279 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand 3 states. [2018-01-29 23:17:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:31,321 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2018-01-29 23:17:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:17:31,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-01-29 23:17:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:31,322 INFO L225 Difference]: With dead ends: 267 [2018-01-29 23:17:31,322 INFO L226 Difference]: Without dead ends: 195 [2018-01-29 23:17:31,322 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:17:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-29 23:17:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 164. [2018-01-29 23:17:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-29 23:17:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-29 23:17:31,328 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 66 [2018-01-29 23:17:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:31,328 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-29 23:17:31,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:17:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-29 23:17:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 23:17:31,329 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:31,329 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:31,329 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1971876178, now seen corresponding path program 1 times [2018-01-29 23:17:31,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:31,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:31,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:31,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:31,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:31,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:31,413 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:17:31,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:31,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:31,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:31,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-29 23:17:31,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:17:31,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:17:31,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:17:31,449 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 11 states. [2018-01-29 23:17:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:31,619 INFO L93 Difference]: Finished difference Result 273 states and 320 transitions. [2018-01-29 23:17:31,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:17:31,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-01-29 23:17:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:31,621 INFO L225 Difference]: With dead ends: 273 [2018-01-29 23:17:31,621 INFO L226 Difference]: Without dead ends: 185 [2018-01-29 23:17:31,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:17:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-29 23:17:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2018-01-29 23:17:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-29 23:17:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2018-01-29 23:17:31,627 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 67 [2018-01-29 23:17:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:31,627 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2018-01-29 23:17:31,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:17:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2018-01-29 23:17:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-29 23:17:31,628 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:31,628 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:31,628 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:31,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1109721994, now seen corresponding path program 2 times [2018-01-29 23:17:31,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:31,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:31,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:31,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:31,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:31,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:31,740 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:17:31,745 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:17:31,749 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:31,758 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:31,766 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:31,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:31,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:31,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-29 23:17:31,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:17:31,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:17:31,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:17:31,800 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand 12 states. [2018-01-29 23:17:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:32,170 INFO L93 Difference]: Finished difference Result 282 states and 331 transitions. [2018-01-29 23:17:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:17:32,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-01-29 23:17:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:32,171 INFO L225 Difference]: With dead ends: 282 [2018-01-29 23:17:32,171 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 23:17:32,172 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:17:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 23:17:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2018-01-29 23:17:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-29 23:17:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2018-01-29 23:17:32,177 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 71 [2018-01-29 23:17:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:32,177 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2018-01-29 23:17:32,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:17:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-01-29 23:17:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:17:32,178 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:32,178 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:32,178 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1832761794, now seen corresponding path program 3 times [2018-01-29 23:17:32,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:32,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:32,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:32,180 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:32,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:32,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:32,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:32,356 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:17:32,362 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:17:32,367 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:32,377 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:32,378 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:32,385 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:32,396 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:32,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:32,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:32,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:32,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-01-29 23:17:32,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:32,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:17:32,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:20 [2018-01-29 23:17:32,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:32,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:32,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-29 23:17:32,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:32,569 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:17:32,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-01-29 23:17:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-29 23:17:32,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:32,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-01-29 23:17:32,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:17:32,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:17:32,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:17:32,792 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 26 states. [2018-01-29 23:17:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:33,442 INFO L93 Difference]: Finished difference Result 372 states and 439 transitions. [2018-01-29 23:17:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:17:33,442 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-01-29 23:17:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:33,443 INFO L225 Difference]: With dead ends: 372 [2018-01-29 23:17:33,443 INFO L226 Difference]: Without dead ends: 284 [2018-01-29 23:17:33,444 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=545, Invalid=1807, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:17:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-01-29 23:17:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 230. [2018-01-29 23:17:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-29 23:17:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2018-01-29 23:17:33,451 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 75 [2018-01-29 23:17:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:33,451 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2018-01-29 23:17:33,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:17:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-01-29 23:17:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:17:33,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:33,452 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:33,452 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash -644312970, now seen corresponding path program 4 times [2018-01-29 23:17:33,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:33,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:33,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:33,453 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:33,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:33,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:33,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:33,692 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:17:33,697 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:17:33,706 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:33,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:33,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 67 [2018-01-29 23:17:33,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:33,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:33,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-01-29 23:17:33,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:33,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:34,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 80 [2018-01-29 23:17:34,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-01-29 23:17:34,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:17:34,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:55 [2018-01-29 23:17:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-01-29 23:17:34,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:34,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-01-29 23:17:34,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:17:34,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:17:34,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:17:34,348 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand 30 states. [2018-01-29 23:17:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:36,209 INFO L93 Difference]: Finished difference Result 432 states and 517 transitions. [2018-01-29 23:17:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 23:17:36,209 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-01-29 23:17:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:36,210 INFO L225 Difference]: With dead ends: 432 [2018-01-29 23:17:36,210 INFO L226 Difference]: Without dead ends: 340 [2018-01-29 23:17:36,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=593, Invalid=2269, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 23:17:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-29 23:17:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 239. [2018-01-29 23:17:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-29 23:17:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2018-01-29 23:17:36,220 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 79 [2018-01-29 23:17:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:36,220 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2018-01-29 23:17:36,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:17:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2018-01-29 23:17:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-29 23:17:36,221 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:36,221 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:36,221 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash -615579986, now seen corresponding path program 5 times [2018-01-29 23:17:36,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:36,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:36,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:36,222 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:36,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:36,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:36,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:36,682 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:17:36,687 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:17:36,690 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,691 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,691 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,692 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,693 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,694 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,695 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,695 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,696 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,697 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,700 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:36,700 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:36,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:36,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:36,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-29 23:17:36,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:17:36,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:17:36,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:17:36,744 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand 15 states. [2018-01-29 23:17:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:37,008 INFO L93 Difference]: Finished difference Result 358 states and 425 transitions. [2018-01-29 23:17:37,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:17:37,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-01-29 23:17:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:37,009 INFO L225 Difference]: With dead ends: 358 [2018-01-29 23:17:37,009 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:17:37,010 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:17:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:17:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 252. [2018-01-29 23:17:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-29 23:17:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 299 transitions. [2018-01-29 23:17:37,018 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 299 transitions. Word has length 83 [2018-01-29 23:17:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:37,018 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 299 transitions. [2018-01-29 23:17:37,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:17:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 299 transitions. [2018-01-29 23:17:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:17:37,019 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:37,019 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:37,019 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -176526218, now seen corresponding path program 6 times [2018-01-29 23:17:37,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:37,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:37,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:37,020 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:37,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:37,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:37,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:37,248 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:17:37,267 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:17:37,272 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,275 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,277 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,279 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,280 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,281 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,282 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:37,283 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:37,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:37,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-01-29 23:17:37,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:37,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:37,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:37 [2018-01-29 23:17:37,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:37,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-29 23:17:37,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:37,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:37,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-01-29 23:17:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 116 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-01-29 23:17:37,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:37,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-01-29 23:17:37,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:17:37,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:17:37,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:17:37,585 INFO L87 Difference]: Start difference. First operand 252 states and 299 transitions. Second operand 30 states. [2018-01-29 23:17:40,014 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 19 DAG size of output 18 [2018-01-29 23:17:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:40,501 INFO L93 Difference]: Finished difference Result 576 states and 683 transitions. [2018-01-29 23:17:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-29 23:17:40,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-01-29 23:17:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:40,502 INFO L225 Difference]: With dead ends: 576 [2018-01-29 23:17:40,502 INFO L226 Difference]: Without dead ends: 484 [2018-01-29 23:17:40,504 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2969 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1770, Invalid=7160, Unknown=0, NotChecked=0, Total=8930 [2018-01-29 23:17:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-01-29 23:17:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 403. [2018-01-29 23:17:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-01-29 23:17:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 477 transitions. [2018-01-29 23:17:40,524 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 477 transitions. Word has length 87 [2018-01-29 23:17:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:40,524 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 477 transitions. [2018-01-29 23:17:40,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:17:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 477 transitions. [2018-01-29 23:17:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-29 23:17:40,525 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:40,525 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:40,525 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 47022668, now seen corresponding path program 7 times [2018-01-29 23:17:40,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:40,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:40,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:40,526 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:40,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:40,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 339 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:40,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:40,860 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:17:40,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:40,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 339 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:40,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:40,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-29 23:17:40,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:17:40,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:17:40,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:17:40,906 INFO L87 Difference]: Start difference. First operand 403 states and 477 transitions. Second operand 17 states. [2018-01-29 23:17:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:41,153 INFO L93 Difference]: Finished difference Result 572 states and 676 transitions. [2018-01-29 23:17:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:17:41,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2018-01-29 23:17:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:41,155 INFO L225 Difference]: With dead ends: 572 [2018-01-29 23:17:41,155 INFO L226 Difference]: Without dead ends: 444 [2018-01-29 23:17:41,155 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:17:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-01-29 23:17:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 425. [2018-01-29 23:17:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-01-29 23:17:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 504 transitions. [2018-01-29 23:17:41,170 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 504 transitions. Word has length 92 [2018-01-29 23:17:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:41,170 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 504 transitions. [2018-01-29 23:17:41,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:17:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 504 transitions. [2018-01-29 23:17:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-29 23:17:41,170 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:41,171 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:41,171 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1823600916, now seen corresponding path program 8 times [2018-01-29 23:17:41,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:41,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:41,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:41,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:41,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:41,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 2 proven. 393 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:41,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:41,297 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:17:41,302 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:17:41,306 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:41,312 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:41,313 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:41,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 0 proven. 393 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:17:41,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:41,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-29 23:17:41,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:17:41,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:17:41,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:17:41,338 INFO L87 Difference]: Start difference. First operand 425 states and 504 transitions. Second operand 18 states. [2018-01-29 23:17:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:42,315 INFO L93 Difference]: Finished difference Result 594 states and 703 transitions. [2018-01-29 23:17:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:17:42,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-01-29 23:17:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:42,316 INFO L225 Difference]: With dead ends: 594 [2018-01-29 23:17:42,316 INFO L226 Difference]: Without dead ends: 466 [2018-01-29 23:17:42,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:17:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-29 23:17:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 447. [2018-01-29 23:17:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-01-29 23:17:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 531 transitions. [2018-01-29 23:17:42,332 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 531 transitions. Word has length 96 [2018-01-29 23:17:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:42,332 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 531 transitions. [2018-01-29 23:17:42,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:17:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 531 transitions. [2018-01-29 23:17:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-29 23:17:42,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:42,333 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:42,333 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1571929052, now seen corresponding path program 9 times [2018-01-29 23:17:42,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:42,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:42,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:42,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:42,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:42,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 451 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:17:42,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:42,568 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:17:42,573 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:17:42,576 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:42,578 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:42,579 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:42,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:42,582 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:42,582 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:42,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:42,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-29 23:17:42,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:42,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:42,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-01-29 23:17:42,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:42,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-29 23:17:42,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:42,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:42,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-29 23:17:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 150 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-01-29 23:17:42,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:42,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-01-29 23:17:42,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:17:42,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:17:42,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:17:42,954 INFO L87 Difference]: Start difference. First operand 447 states and 531 transitions. Second operand 34 states. [2018-01-29 23:17:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:44,745 INFO L93 Difference]: Finished difference Result 753 states and 890 transitions. [2018-01-29 23:17:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-01-29 23:17:44,746 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 100 [2018-01-29 23:17:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:44,747 INFO L225 Difference]: With dead ends: 753 [2018-01-29 23:17:44,747 INFO L226 Difference]: Without dead ends: 625 [2018-01-29 23:17:44,749 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2645, Invalid=10465, Unknown=0, NotChecked=0, Total=13110 [2018-01-29 23:17:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-01-29 23:17:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2018-01-29 23:17:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-29 23:17:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 466 transitions. [2018-01-29 23:17:44,775 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 466 transitions. Word has length 100 [2018-01-29 23:17:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:44,775 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 466 transitions. [2018-01-29 23:17:44,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:17:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 466 transitions. [2018-01-29 23:17:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-29 23:17:44,777 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:44,777 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:44,777 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -728204931, now seen corresponding path program 4 times [2018-01-29 23:17:44,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:44,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:44,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:44,777 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:44,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:44,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 4 proven. 512 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:45,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:45,141 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:17:45,146 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:17:45,166 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:45,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 3 proven. 122 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-01-29 23:17:45,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:45,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-01-29 23:17:45,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:17:45,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:17:45,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:17:45,381 INFO L87 Difference]: Start difference. First operand 391 states and 466 transitions. Second operand 34 states. [2018-01-29 23:17:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:46,219 INFO L93 Difference]: Finished difference Result 664 states and 793 transitions. [2018-01-29 23:17:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-29 23:17:46,219 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 109 [2018-01-29 23:17:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:46,220 INFO L225 Difference]: With dead ends: 664 [2018-01-29 23:17:46,220 INFO L226 Difference]: Without dead ends: 544 [2018-01-29 23:17:46,221 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3955, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 23:17:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-29 23:17:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 435. [2018-01-29 23:17:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-29 23:17:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 515 transitions. [2018-01-29 23:17:46,244 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 515 transitions. Word has length 109 [2018-01-29 23:17:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:46,244 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 515 transitions. [2018-01-29 23:17:46,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:17:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 515 transitions. [2018-01-29 23:17:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-29 23:17:46,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:46,245 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:46,245 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:46,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1938118283, now seen corresponding path program 10 times [2018-01-29 23:17:46,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:46,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:46,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:46,246 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:46,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:46,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 4 proven. 578 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:46,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:46,391 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:17:46,395 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:17:46,405 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:46,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:46,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-01-29 23:17:46,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:46,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:17:46,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:20 [2018-01-29 23:17:46,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:46,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 40 [2018-01-29 23:17:46,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:46,608 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:17:46,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-01-29 23:17:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 4 proven. 125 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-01-29 23:17:46,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:46,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-01-29 23:17:46,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:17:46,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:17:46,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:17:46,759 INFO L87 Difference]: Start difference. First operand 435 states and 515 transitions. Second operand 36 states. [2018-01-29 23:17:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:47,537 INFO L93 Difference]: Finished difference Result 658 states and 772 transitions. [2018-01-29 23:17:47,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-29 23:17:47,537 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 117 [2018-01-29 23:17:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:47,539 INFO L225 Difference]: With dead ends: 658 [2018-01-29 23:17:47,539 INFO L226 Difference]: Without dead ends: 511 [2018-01-29 23:17:47,540 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1275, Invalid=4275, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:17:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-01-29 23:17:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 441. [2018-01-29 23:17:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-01-29 23:17:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 525 transitions. [2018-01-29 23:17:47,561 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 525 transitions. Word has length 117 [2018-01-29 23:17:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:47,561 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 525 transitions. [2018-01-29 23:17:47,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:17:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 525 transitions. [2018-01-29 23:17:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-29 23:17:47,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:47,562 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:47,562 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -131813971, now seen corresponding path program 11 times [2018-01-29 23:17:47,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:47,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:47,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:47,562 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:47,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:47,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 4 proven. 648 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:47,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:47,792 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:17:47,796 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:17:47,799 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,799 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,800 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,801 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,801 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,802 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,804 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,805 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,805 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,806 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,807 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,808 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,808 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,809 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,811 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,812 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,815 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:47,815 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:47,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:17:47,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:47,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-29 23:17:47,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:17:47,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:17:47,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:17:47,843 INFO L87 Difference]: Start difference. First operand 441 states and 525 transitions. Second operand 22 states. [2018-01-29 23:17:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:48,083 INFO L93 Difference]: Finished difference Result 610 states and 722 transitions. [2018-01-29 23:17:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:17:48,084 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-01-29 23:17:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:48,085 INFO L225 Difference]: With dead ends: 610 [2018-01-29 23:17:48,085 INFO L226 Difference]: Without dead ends: 474 [2018-01-29 23:17:48,086 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:17:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-01-29 23:17:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 458. [2018-01-29 23:17:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-29 23:17:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 546 transitions. [2018-01-29 23:17:48,106 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 546 transitions. Word has length 121 [2018-01-29 23:17:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:48,106 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 546 transitions. [2018-01-29 23:17:48,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:17:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 546 transitions. [2018-01-29 23:17:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-29 23:17:48,107 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:48,107 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:48,107 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1133854069, now seen corresponding path program 12 times [2018-01-29 23:17:48,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:48,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:48,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:48,108 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:48,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:48,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 4 proven. 722 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:48,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:48,622 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:17:48,627 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:17:48,631 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,632 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,634 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,635 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,637 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,641 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,643 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,647 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,650 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,654 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,657 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,660 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,662 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,665 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:48,665 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:48,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:48,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:48,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:48,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-01-29 23:17:48,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:48,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:17:48,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:20 [2018-01-29 23:17:48,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:48,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:48,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-29 23:17:48,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:48,808 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:17:48,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-01-29 23:17:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 4 proven. 139 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-01-29 23:17:48,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:48,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2018-01-29 23:17:48,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 23:17:48,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 23:17:48,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1105, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:17:48,969 INFO L87 Difference]: Start difference. First operand 458 states and 546 transitions. Second operand 39 states. [2018-01-29 23:17:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:49,852 INFO L93 Difference]: Finished difference Result 764 states and 907 transitions. [2018-01-29 23:17:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-29 23:17:49,852 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 125 [2018-01-29 23:17:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:49,854 INFO L225 Difference]: With dead ends: 764 [2018-01-29 23:17:49,854 INFO L226 Difference]: Without dead ends: 628 [2018-01-29 23:17:49,855 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1613, Invalid=5193, Unknown=0, NotChecked=0, Total=6806 [2018-01-29 23:17:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-01-29 23:17:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 572. [2018-01-29 23:17:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-01-29 23:17:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 684 transitions. [2018-01-29 23:17:49,882 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 684 transitions. Word has length 125 [2018-01-29 23:17:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:49,882 INFO L432 AbstractCegarLoop]: Abstraction has 572 states and 684 transitions. [2018-01-29 23:17:49,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 23:17:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 684 transitions. [2018-01-29 23:17:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-29 23:17:49,883 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:49,883 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:49,883 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash -437024339, now seen corresponding path program 13 times [2018-01-29 23:17:49,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:49,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:49,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:49,884 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:49,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:49,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 4 proven. 800 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:50,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:50,314 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:17:50,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:50,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:17:50,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:50,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-01-29 23:17:50,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 23:17:50,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 23:17:50,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:17:50,358 INFO L87 Difference]: Start difference. First operand 572 states and 684 transitions. Second operand 24 states. [2018-01-29 23:17:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:50,636 INFO L93 Difference]: Finished difference Result 768 states and 912 transitions. [2018-01-29 23:17:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:17:50,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 129 [2018-01-29 23:17:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:50,637 INFO L225 Difference]: With dead ends: 768 [2018-01-29 23:17:50,637 INFO L226 Difference]: Without dead ends: 611 [2018-01-29 23:17:50,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:17:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-01-29 23:17:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 593. [2018-01-29 23:17:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-29 23:17:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 710 transitions. [2018-01-29 23:17:50,665 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 710 transitions. Word has length 129 [2018-01-29 23:17:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:50,665 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 710 transitions. [2018-01-29 23:17:50,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 23:17:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 710 transitions. [2018-01-29 23:17:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-29 23:17:50,666 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:50,666 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:50,666 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1231677067, now seen corresponding path program 14 times [2018-01-29 23:17:50,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:50,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:50,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:50,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:17:50,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:50,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:17:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 4 proven. 882 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:51,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:51,173 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:17:51,177 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:17:51,182 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:51,188 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:51,190 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:51,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:17:51,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:51,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-29 23:17:51,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:17:51,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:17:51,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:17:51,220 INFO L87 Difference]: Start difference. First operand 593 states and 710 transitions. Second operand 25 states. [2018-01-29 23:17:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:51,578 INFO L93 Difference]: Finished difference Result 789 states and 938 transitions. [2018-01-29 23:17:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:17:51,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-01-29 23:17:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:51,579 INFO L225 Difference]: With dead ends: 789 [2018-01-29 23:17:51,579 INFO L226 Difference]: Without dead ends: 632 [2018-01-29 23:17:51,580 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:17:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-01-29 23:17:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2018-01-29 23:17:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-01-29 23:17:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 736 transitions. [2018-01-29 23:17:51,607 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 736 transitions. Word has length 133 [2018-01-29 23:17:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:51,607 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 736 transitions. [2018-01-29 23:17:51,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:17:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 736 transitions. [2018-01-29 23:17:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-29 23:17:51,608 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:51,608 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:51,608 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1348175165, now seen corresponding path program 15 times [2018-01-29 23:17:51,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:51,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:51,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:51,609 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:51,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:51,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 4 proven. 968 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:51,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:51,857 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:17:51,862 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:17:51,867 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,868 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,872 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,873 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,875 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,876 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,878 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,879 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,881 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,882 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,884 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:17:51,884 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:51,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:52,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-01-29 23:17:52,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:52,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:17:52,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:29 [2018-01-29 23:17:52,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:52,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2018-01-29 23:17:52,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:52,083 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:17:52,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2018-01-29 23:17:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 4 proven. 239 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-01-29 23:17:52,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:52,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 44 [2018-01-29 23:17:52,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-29 23:17:52,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-29 23:17:52,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=1383, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:17:52,325 INFO L87 Difference]: Start difference. First operand 614 states and 736 transitions. Second operand 44 states. [2018-01-29 23:17:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:53,676 INFO L93 Difference]: Finished difference Result 957 states and 1140 transitions. [2018-01-29 23:17:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-01-29 23:17:53,676 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 137 [2018-01-29 23:17:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:53,678 INFO L225 Difference]: With dead ends: 957 [2018-01-29 23:17:53,678 INFO L226 Difference]: Without dead ends: 800 [2018-01-29 23:17:53,679 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2069, Invalid=6487, Unknown=0, NotChecked=0, Total=8556 [2018-01-29 23:17:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-01-29 23:17:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 636. [2018-01-29 23:17:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-01-29 23:17:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 763 transitions. [2018-01-29 23:17:53,710 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 763 transitions. Word has length 137 [2018-01-29 23:17:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:53,710 INFO L432 AbstractCegarLoop]: Abstraction has 636 states and 763 transitions. [2018-01-29 23:17:53,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-29 23:17:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 763 transitions. [2018-01-29 23:17:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 23:17:53,711 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:53,711 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:53,711 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1750154613, now seen corresponding path program 16 times [2018-01-29 23:17:53,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:53,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:53,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:53,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:53,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:53,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 4 proven. 1058 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:54,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:54,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:17:54,082 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:17:54,096 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:54,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:54,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,934 INFO L303 Elim1Store]: Index analysis took 273 ms [2018-01-29 23:17:54,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 67 [2018-01-29 23:17:54,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:54,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:54,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-01-29 23:17:54,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:54,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 80 [2018-01-29 23:17:54,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-01-29 23:17:55,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:17:55,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:55 [2018-01-29 23:17:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 3 proven. 333 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2018-01-29 23:17:55,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:55,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-01-29 23:17:55,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 23:17:55,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 23:17:55,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1622, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:17:55,380 INFO L87 Difference]: Start difference. First operand 636 states and 763 transitions. Second operand 47 states. [2018-01-29 23:17:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:57,070 INFO L93 Difference]: Finished difference Result 986 states and 1179 transitions. [2018-01-29 23:17:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-29 23:17:57,070 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 141 [2018-01-29 23:17:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:57,073 INFO L225 Difference]: With dead ends: 986 [2018-01-29 23:17:57,073 INFO L226 Difference]: Without dead ends: 829 [2018-01-29 23:17:57,074 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2109, Invalid=7203, Unknown=0, NotChecked=0, Total=9312 [2018-01-29 23:17:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-01-29 23:17:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 662. [2018-01-29 23:17:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-01-29 23:17:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2018-01-29 23:17:57,146 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 141 [2018-01-29 23:17:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:57,147 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2018-01-29 23:17:57,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 23:17:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2018-01-29 23:17:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-29 23:17:57,148 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:57,148 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:57,148 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1581246035, now seen corresponding path program 17 times [2018-01-29 23:17:57,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:57,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:57,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:57,148 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:57,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:57,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 4 proven. 1152 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:57,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:57,534 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:17:57,539 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:17:57,542 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,542 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,543 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,544 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,544 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,545 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,546 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,546 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,547 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,548 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,548 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,549 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,550 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,551 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,551 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,552 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,553 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,554 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,555 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,555 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,556 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,557 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,562 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,564 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,567 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:17:57,568 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:57,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1172 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:17:57,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:57,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-01-29 23:17:57,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:17:57,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:17:57,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:17:57,598 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand 28 states. [2018-01-29 23:17:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:17:57,981 INFO L93 Difference]: Finished difference Result 858 states and 1023 transitions. [2018-01-29 23:17:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:17:57,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 145 [2018-01-29 23:17:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:17:57,984 INFO L225 Difference]: With dead ends: 858 [2018-01-29 23:17:57,984 INFO L226 Difference]: Without dead ends: 701 [2018-01-29 23:17:57,985 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:17:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-01-29 23:17:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 683. [2018-01-29 23:17:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-01-29 23:17:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 821 transitions. [2018-01-29 23:17:58,019 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 821 transitions. Word has length 145 [2018-01-29 23:17:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:17:58,019 INFO L432 AbstractCegarLoop]: Abstraction has 683 states and 821 transitions. [2018-01-29 23:17:58,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:17:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 821 transitions. [2018-01-29 23:17:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-29 23:17:58,020 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:17:58,020 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:17:58,020 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:17:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1717917323, now seen corresponding path program 18 times [2018-01-29 23:17:58,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:17:58,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:17:58,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:58,021 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:17:58,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:17:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:17:58,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:17:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 4 proven. 1250 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:17:58,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:17:58,713 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:17:58,726 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:17:58,730 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,732 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,733 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,734 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,736 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,738 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,739 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,741 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,742 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,744 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,746 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,748 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,750 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,752 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:17:58,754 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:17:58,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:17:59,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-01-29 23:17:59,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:17:59,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:59,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:37 [2018-01-29 23:17:59,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:17:59,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-29 23:17:59,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:17:59,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:17:59,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-01-29 23:17:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 4 proven. 858 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-01-29 23:17:59,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:17:59,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 53 [2018-01-29 23:17:59,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 23:17:59,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 23:17:59,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=2193, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:17:59,435 INFO L87 Difference]: Start difference. First operand 683 states and 821 transitions. Second operand 53 states. [2018-01-29 23:18:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:10,921 INFO L93 Difference]: Finished difference Result 1867 states and 2234 transitions. [2018-01-29 23:18:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 419 states. [2018-01-29 23:18:10,921 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 149 [2018-01-29 23:18:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:10,924 INFO L225 Difference]: With dead ends: 1867 [2018-01-29 23:18:10,924 INFO L226 Difference]: Without dead ends: 1710 [2018-01-29 23:18:10,931 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90156 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=21512, Invalid=180538, Unknown=0, NotChecked=0, Total=202050 [2018-01-29 23:18:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-01-29 23:18:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 818. [2018-01-29 23:18:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-01-29 23:18:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 984 transitions. [2018-01-29 23:18:10,977 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 984 transitions. Word has length 149 [2018-01-29 23:18:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:10,977 INFO L432 AbstractCegarLoop]: Abstraction has 818 states and 984 transitions. [2018-01-29 23:18:10,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 23:18:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 984 transitions. [2018-01-29 23:18:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-29 23:18:10,978 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:10,978 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 24, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:10,978 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash 638141307, now seen corresponding path program 19 times [2018-01-29 23:18:10,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:10,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:10,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:10,979 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:10,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:10,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 4 proven. 1353 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:11,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:11,430 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:11,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:18:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:11,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1353 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:18:11,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:11,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-01-29 23:18:11,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 23:18:11,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 23:18:11,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:18:11,494 INFO L87 Difference]: Start difference. First operand 818 states and 984 transitions. Second operand 30 states. [2018-01-29 23:18:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:12,101 INFO L93 Difference]: Finished difference Result 1022 states and 1223 transitions. [2018-01-29 23:18:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:18:12,102 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 154 [2018-01-29 23:18:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:12,103 INFO L225 Difference]: With dead ends: 1022 [2018-01-29 23:18:12,103 INFO L226 Difference]: Without dead ends: 865 [2018-01-29 23:18:12,104 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2018-01-29 23:18:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-01-29 23:18:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 844. [2018-01-29 23:18:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-01-29 23:18:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1016 transitions. [2018-01-29 23:18:12,148 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1016 transitions. Word has length 154 [2018-01-29 23:18:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:12,148 INFO L432 AbstractCegarLoop]: Abstraction has 844 states and 1016 transitions. [2018-01-29 23:18:12,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 23:18:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1016 transitions. [2018-01-29 23:18:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-29 23:18:12,149 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:12,149 INFO L350 BasicCegarLoop]: trace histogram [28, 27, 27, 25, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:12,149 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 511589443, now seen corresponding path program 20 times [2018-01-29 23:18:12,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:12,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:12,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:12,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:18:12,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:12,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 4 proven. 1459 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:12,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:12,467 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:12,472 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:18:12,480 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:12,489 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:12,490 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:12,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 0 proven. 1459 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:18:12,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:12,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-29 23:18:12,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:18:12,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:18:12,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:18:12,523 INFO L87 Difference]: Start difference. First operand 844 states and 1016 transitions. Second operand 31 states. [2018-01-29 23:18:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:12,986 INFO L93 Difference]: Finished difference Result 1048 states and 1255 transitions. [2018-01-29 23:18:12,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:18:12,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 158 [2018-01-29 23:18:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:12,988 INFO L225 Difference]: With dead ends: 1048 [2018-01-29 23:18:12,988 INFO L226 Difference]: Without dead ends: 891 [2018-01-29 23:18:12,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 23:18:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-01-29 23:18:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 870. [2018-01-29 23:18:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-01-29 23:18:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1048 transitions. [2018-01-29 23:18:13,033 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1048 transitions. Word has length 158 [2018-01-29 23:18:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:13,033 INFO L432 AbstractCegarLoop]: Abstraction has 870 states and 1048 transitions. [2018-01-29 23:18:13,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:18:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1048 transitions. [2018-01-29 23:18:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-29 23:18:13,034 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:13,035 INFO L350 BasicCegarLoop]: trace histogram [29, 28, 28, 26, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:13,035 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1857655051, now seen corresponding path program 21 times [2018-01-29 23:18:13,035 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:13,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:13,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:13,035 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:13,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:13,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 4 proven. 1569 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:13,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:13,463 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:13,468 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:18:13,472 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:13,474 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:13,476 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:13,478 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:13,479 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:13,480 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:13,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:13,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 49 [2018-01-29 23:18:13,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:13,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:18:13,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-29 23:18:13,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:13,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 48 [2018-01-29 23:18:13,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:13,572 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:18:13,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-01-29 23:18:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 6 proven. 204 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2018-01-29 23:18:13,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:13,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 50 [2018-01-29 23:18:13,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-29 23:18:13,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-29 23:18:13,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=1794, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:18:13,876 INFO L87 Difference]: Start difference. First operand 870 states and 1048 transitions. Second operand 50 states. [2018-01-29 23:18:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:15,588 INFO L93 Difference]: Finished difference Result 1123 states and 1345 transitions. [2018-01-29 23:18:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-29 23:18:15,588 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 162 [2018-01-29 23:18:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:15,590 INFO L225 Difference]: With dead ends: 1123 [2018-01-29 23:18:15,590 INFO L226 Difference]: Without dead ends: 966 [2018-01-29 23:18:15,591 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3869 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3106, Invalid=9776, Unknown=0, NotChecked=0, Total=12882 [2018-01-29 23:18:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-01-29 23:18:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 763. [2018-01-29 23:18:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-01-29 23:18:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 918 transitions. [2018-01-29 23:18:15,632 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 918 transitions. Word has length 162 [2018-01-29 23:18:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:15,632 INFO L432 AbstractCegarLoop]: Abstraction has 763 states and 918 transitions. [2018-01-29 23:18:15,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-29 23:18:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 918 transitions. [2018-01-29 23:18:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-29 23:18:15,633 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:15,633 INFO L350 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:15,633 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -831215037, now seen corresponding path program 22 times [2018-01-29 23:18:15,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:15,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:15,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:15,634 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:15,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:15,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 4 proven. 1683 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:16,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:16,088 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:16,094 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:18:16,111 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:16,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:16,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 55 [2018-01-29 23:18:16,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:16,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:18:16,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-29 23:18:16,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:16,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-01-29 23:18:16,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:16,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:18:16,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:15 [2018-01-29 23:18:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 6 proven. 318 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2018-01-29 23:18:16,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:16,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 52 [2018-01-29 23:18:16,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:18:16,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:18:16,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=1956, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:18:16,538 INFO L87 Difference]: Start difference. First operand 763 states and 918 transitions. Second operand 52 states. [2018-01-29 23:18:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:19,365 INFO L93 Difference]: Finished difference Result 1405 states and 1690 transitions. [2018-01-29 23:18:19,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-01-29 23:18:19,365 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 166 [2018-01-29 23:18:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:19,368 INFO L225 Difference]: With dead ends: 1405 [2018-01-29 23:18:19,368 INFO L226 Difference]: Without dead ends: 1269 [2018-01-29 23:18:19,369 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7391 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5123, Invalid=17227, Unknown=0, NotChecked=0, Total=22350 [2018-01-29 23:18:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-01-29 23:18:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 781. [2018-01-29 23:18:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-01-29 23:18:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 940 transitions. [2018-01-29 23:18:19,413 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 940 transitions. Word has length 166 [2018-01-29 23:18:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:19,413 INFO L432 AbstractCegarLoop]: Abstraction has 781 states and 940 transitions. [2018-01-29 23:18:19,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:18:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 940 transitions. [2018-01-29 23:18:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-29 23:18:19,414 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:19,414 INFO L350 BasicCegarLoop]: trace histogram [31, 30, 30, 28, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:19,414 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:19,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1653074789, now seen corresponding path program 23 times [2018-01-29 23:18:19,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:19,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:19,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:19,415 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:19,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:19,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 4 proven. 1801 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:20,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:20,218 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:20,222 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:18:20,225 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,226 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,227 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,228 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,229 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,231 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,232 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,232 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,233 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,234 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,234 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,235 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,236 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,237 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,237 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,238 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,239 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,240 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,241 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,242 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,243 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,244 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,245 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,246 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,247 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,248 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,250 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,253 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:20,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:20,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 0 proven. 1801 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:18:20,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:20,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-01-29 23:18:20,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:18:20,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:18:20,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:18:20,291 INFO L87 Difference]: Start difference. First operand 781 states and 940 transitions. Second operand 34 states. [2018-01-29 23:18:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:20,851 INFO L93 Difference]: Finished difference Result 958 states and 1148 transitions. [2018-01-29 23:18:20,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:18:20,851 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 170 [2018-01-29 23:18:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:20,852 INFO L225 Difference]: With dead ends: 958 [2018-01-29 23:18:20,853 INFO L226 Difference]: Without dead ends: 822 [2018-01-29 23:18:20,853 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2018-01-29 23:18:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-01-29 23:18:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 803. [2018-01-29 23:18:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-01-29 23:18:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 967 transitions. [2018-01-29 23:18:20,897 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 967 transitions. Word has length 170 [2018-01-29 23:18:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:20,897 INFO L432 AbstractCegarLoop]: Abstraction has 803 states and 967 transitions. [2018-01-29 23:18:20,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:18:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 967 transitions. [2018-01-29 23:18:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-29 23:18:20,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:20,898 INFO L350 BasicCegarLoop]: trace histogram [32, 31, 31, 29, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:20,898 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1310753437, now seen corresponding path program 24 times [2018-01-29 23:18:20,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:20,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:20,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:20,899 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:20,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:20,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 4 proven. 1923 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:21,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:21,680 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:21,684 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:18:21,688 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,690 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,691 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,692 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,695 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,697 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,699 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,704 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,705 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,708 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,712 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,716 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,719 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,722 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,723 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,726 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:18:21,727 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:21,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:22,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 48 [2018-01-29 23:18:22,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:22,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:18:22,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2018-01-29 23:18:22,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:22,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 50 [2018-01-29 23:18:22,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:22,525 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:18:22,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-01-29 23:18:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 4 proven. 339 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2018-01-29 23:18:22,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:22,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19] total 52 [2018-01-29 23:18:22,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 23:18:22,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 23:18:22,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1865, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:18:22,761 INFO L87 Difference]: Start difference. First operand 803 states and 967 transitions. Second operand 52 states. [2018-01-29 23:18:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:24,361 INFO L93 Difference]: Finished difference Result 1166 states and 1398 transitions. [2018-01-29 23:18:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-01-29 23:18:24,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 174 [2018-01-29 23:18:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:24,364 INFO L225 Difference]: With dead ends: 1166 [2018-01-29 23:18:24,364 INFO L226 Difference]: Without dead ends: 1030 [2018-01-29 23:18:24,365 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4075 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3571, Invalid=10235, Unknown=0, NotChecked=0, Total=13806 [2018-01-29 23:18:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-01-29 23:18:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 825. [2018-01-29 23:18:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-01-29 23:18:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 994 transitions. [2018-01-29 23:18:24,429 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 994 transitions. Word has length 174 [2018-01-29 23:18:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:24,429 INFO L432 AbstractCegarLoop]: Abstraction has 825 states and 994 transitions. [2018-01-29 23:18:24,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 23:18:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 994 transitions. [2018-01-29 23:18:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-29 23:18:24,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:24,430 INFO L350 BasicCegarLoop]: trace histogram [33, 32, 32, 30, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:24,430 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1406997749, now seen corresponding path program 25 times [2018-01-29 23:18:24,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:24,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:24,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:24,431 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:24,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:24,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 4 proven. 2049 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:25,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:25,136 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:25,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:18:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:25,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 0 proven. 2049 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:18:25,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:25,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-01-29 23:18:25,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:18:25,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:18:25,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:18:25,194 INFO L87 Difference]: Start difference. First operand 825 states and 994 transitions. Second operand 36 states. [2018-01-29 23:18:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:25,805 INFO L93 Difference]: Finished difference Result 1002 states and 1202 transitions. [2018-01-29 23:18:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:18:25,805 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 178 [2018-01-29 23:18:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:25,806 INFO L225 Difference]: With dead ends: 1002 [2018-01-29 23:18:25,806 INFO L226 Difference]: Without dead ends: 866 [2018-01-29 23:18:25,807 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 23:18:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-01-29 23:18:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 847. [2018-01-29 23:18:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-01-29 23:18:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1021 transitions. [2018-01-29 23:18:25,852 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1021 transitions. Word has length 178 [2018-01-29 23:18:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:25,853 INFO L432 AbstractCegarLoop]: Abstraction has 847 states and 1021 transitions. [2018-01-29 23:18:25,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:18:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1021 transitions. [2018-01-29 23:18:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-01-29 23:18:25,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:25,854 INFO L350 BasicCegarLoop]: trace histogram [34, 33, 33, 31, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:25,854 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash 693738451, now seen corresponding path program 26 times [2018-01-29 23:18:25,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:25,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:25,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:25,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:18:25,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:25,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2199 backedges. 4 proven. 2179 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:26,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:26,328 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:26,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:18:26,337 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:26,346 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:18:26,348 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:26,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2199 backedges. 0 proven. 2179 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-29 23:18:26,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:26,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-29 23:18:26,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 23:18:26,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 23:18:26,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 23:18:26,405 INFO L87 Difference]: Start difference. First operand 847 states and 1021 transitions. Second operand 37 states. [2018-01-29 23:18:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:26,944 INFO L93 Difference]: Finished difference Result 1024 states and 1229 transitions. [2018-01-29 23:18:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:18:26,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 182 [2018-01-29 23:18:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:26,946 INFO L225 Difference]: With dead ends: 1024 [2018-01-29 23:18:26,947 INFO L226 Difference]: Without dead ends: 888 [2018-01-29 23:18:26,947 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-01-29 23:18:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-01-29 23:18:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 869. [2018-01-29 23:18:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-01-29 23:18:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1048 transitions. [2018-01-29 23:18:26,994 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1048 transitions. Word has length 182 [2018-01-29 23:18:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:26,994 INFO L432 AbstractCegarLoop]: Abstraction has 869 states and 1048 transitions. [2018-01-29 23:18:26,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 23:18:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1048 transitions. [2018-01-29 23:18:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-29 23:18:26,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:26,996 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 32, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:26,996 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -692410213, now seen corresponding path program 27 times [2018-01-29 23:18:26,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:26,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:26,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:26,996 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:26,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:27,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:18:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 4 proven. 2313 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-29 23:18:27,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:18:27,662 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:18:27,668 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:18:27,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,675 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,677 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,678 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,679 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,681 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,685 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:18:27,687 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:18:27,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:18:27,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-29 23:18:27,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 23:18:27,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:18:27,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-01-29 23:18:27,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:18:27,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2018-01-29 23:18:27,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:18:27,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:18:27,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-01-29 23:18:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 4 proven. 602 refuted. 0 times theorem prover too weak. 1727 trivial. 0 not checked. [2018-01-29 23:18:28,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:18:28,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 20] total 56 [2018-01-29 23:18:28,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-29 23:18:28,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-29 23:18:28,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=2200, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:18:28,297 INFO L87 Difference]: Start difference. First operand 869 states and 1048 transitions. Second operand 56 states. [2018-01-29 23:18:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:18:33,096 INFO L93 Difference]: Finished difference Result 1620 states and 1942 transitions. [2018-01-29 23:18:33,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-01-29 23:18:33,097 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 186 [2018-01-29 23:18:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:18:33,100 INFO L225 Difference]: With dead ends: 1620 [2018-01-29 23:18:33,100 INFO L226 Difference]: Without dead ends: 1484 [2018-01-29 23:18:33,103 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20545 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10943, Invalid=41727, Unknown=0, NotChecked=0, Total=52670 [2018-01-29 23:18:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-01-29 23:18:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1027. [2018-01-29 23:18:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2018-01-29 23:18:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1245 transitions. [2018-01-29 23:18:33,189 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1245 transitions. Word has length 186 [2018-01-29 23:18:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:18:33,189 INFO L432 AbstractCegarLoop]: Abstraction has 1027 states and 1245 transitions. [2018-01-29 23:18:33,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-29 23:18:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1245 transitions. [2018-01-29 23:18:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-01-29 23:18:33,190 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:18:33,191 INFO L350 BasicCegarLoop]: trace histogram [36, 35, 35, 32, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:18:33,191 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-29 23:18:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1211320981, now seen corresponding path program 28 times [2018-01-29 23:18:33,191 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:18:33,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:18:33,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:33,191 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:18:33,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:18:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:18:33,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-29 23:18:33,717 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:18:33,720 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:18:33,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:18:33 BoogieIcfgContainer [2018-01-29 23:18:33,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:18:33,721 INFO L168 Benchmark]: Toolchain (without parser) took 68011.00 ms. Allocated memory was 147.3 MB in the beginning and 776.5 MB in the end (delta: 629.1 MB). Free memory was 112.4 MB in the beginning and 466.8 MB in the end (delta: -354.4 MB). Peak memory consumption was 274.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:18:33,722 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 147.3 MB. Free memory is still 117.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:18:33,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 107.90 ms. Allocated memory is still 147.3 MB. Free memory was 112.2 MB in the beginning and 103.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:18:33,722 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 ms. Allocated memory is still 147.3 MB. Free memory was 103.8 MB in the beginning and 102.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:18:33,722 INFO L168 Benchmark]: RCFGBuilder took 311.75 ms. Allocated memory is still 147.3 MB. Free memory was 102.2 MB in the beginning and 86.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:18:33,722 INFO L168 Benchmark]: TraceAbstraction took 67565.57 ms. Allocated memory was 147.3 MB in the beginning and 776.5 MB in the end (delta: 629.1 MB). Free memory was 86.2 MB in the beginning and 466.8 MB in the end (delta: -380.6 MB). Peak memory consumption was 248.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:18:33,723 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 147.3 MB. Free memory is still 117.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 107.90 ms. Allocated memory is still 147.3 MB. Free memory was 112.2 MB in the beginning and 103.8 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.51 ms. Allocated memory is still 147.3 MB. Free memory was 103.8 MB in the beginning and 102.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 311.75 ms. Allocated memory is still 147.3 MB. Free memory was 102.2 MB in the beginning and 86.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67565.57 ms. Allocated memory was 147.3 MB in the beginning and 776.5 MB in the end (delta: 629.1 MB). Free memory was 86.2 MB in the beginning and 466.8 MB in the end (delta: -380.6 MB). Peak memory consumption was 248.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 192 with TraceHistMax 36, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 1 error locations. TIMEOUT Result, 67.5s OverallTime, 40 OverallIterations, 36 TraceHistogramMax, 44.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2568 SDtfs, 9841 SDslu, 42076 SDs, 0 SdLazy, 28518 SolverSat, 1702 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6213 GetRequests, 3701 SyntacticMatches, 6 SemanticMatches, 2506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149688 ImplicationChecksByTransitivity, 43.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=39, 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.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 4072 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 7982 NumberOfCodeBlocks, 7403 NumberOfCodeBlocksAsserted, 246 NumberOfCheckSat, 7908 ConstructedInterpolants, 225 QuantifiedInterpolants, 6282818 SizeOfPredicates, 188 NumberOfNonLiveVariables, 4783 ConjunctsInSsa, 847 ConjunctsInUnsatCore, 74 InterpolantComputations, 5 PerfectInterpolantSequences, 11187/55965 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/sorting_selectionsort_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-18-33-727.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sorting_selectionsort_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-18-33-727.csv Completed graceful shutdown