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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-programs/copysome2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:14:27,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:14:27,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:14:27,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:14:27,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:14:27,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:14:27,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:14:27,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:14:27,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:14:27,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:14:27,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:14:27,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:14:27,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:14:27,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:14:27,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:14:27,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:14:27,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:14:27,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:14:27,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:14:27,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:14:27,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:14:27,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:14:27,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:14:27,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:14:27,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:14:27,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:14:27,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:14:27,653 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:14:27,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:14:27,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:14:27,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:14:27,656 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-30 05:14:27,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:14:27,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:14:27,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:14:27,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:14:27,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:14:27,664 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:14:27,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:14:27,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:14:27,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:14:27,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:14:27,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:14:27,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:14:27,667 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:14:27,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:14:27,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:14:27,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:14:27,667 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:14:27,668 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:14:27,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:14:27,697 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:14:27,699 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:14:27,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:14:27,700 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:14:27,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome2_true-unreach-call.i [2018-01-30 05:14:27,764 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:14:27,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:14:27,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:14:27,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:14:27,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:14:27,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670c8cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27, skipping insertion in model container [2018-01-30 05:14:27,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,780 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:14:27,788 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:14:27,856 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:14:27,865 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:14:27,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27 WrapperNode [2018-01-30 05:14:27,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:14:27,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:14:27,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:14:27,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:14:27,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (1/1) ... [2018-01-30 05:14:27,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:14:27,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:14:27,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:14:27,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:14:27,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (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-30 05:14:27,926 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:14:27,926 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:14:27,926 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 05:14:27,926 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:14:27,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:14:27,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 05:14:27,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:14:27,926 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:14:27,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:14:27,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:14:28,279 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:14:28,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:14:28 BoogieIcfgContainer [2018-01-30 05:14:28,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:14:28,280 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:14:28,280 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:14:28,281 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:14:28,283 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:14:28" (1/1) ... [2018-01-30 05:14:28,286 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:14:28,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:14:28 BasicIcfg [2018-01-30 05:14:28,293 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:14:28,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:14:28,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:14:28,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:14:28,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:14:27" (1/4) ... [2018-01-30 05:14:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:14:28, skipping insertion in model container [2018-01-30 05:14:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:14:27" (2/4) ... [2018-01-30 05:14:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:14:28, skipping insertion in model container [2018-01-30 05:14:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:14:28" (3/4) ... [2018-01-30 05:14:28,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:14:28, skipping insertion in model container [2018-01-30 05:14:28,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:14:28" (4/4) ... [2018-01-30 05:14:28,298 INFO L107 eAbstractionObserver]: Analyzing ICFG copysome2_true-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 05:14:28,303 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:14:28,309 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:14:28,333 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:14:28,333 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:14:28,333 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:14:28,334 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:14:28,334 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:14:28,334 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:14:28,334 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:14:28,334 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:14:28,334 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:14:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 05:14:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 05:14:28,348 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:28,348 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] [2018-01-30 05:14:28,348 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1593372224, now seen corresponding path program 1 times [2018-01-30 05:14:28,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:28,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:28,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:28,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:28,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:28,421 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-30 05:14:28,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:14:28,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 05:14:28,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 05:14:28,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 05:14:28,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 05:14:28,433 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-01-30 05:14:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:28,447 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-01-30 05:14:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 05:14:28,448 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 05:14:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:28,454 INFO L225 Difference]: With dead ends: 97 [2018-01-30 05:14:28,454 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 05:14:28,456 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-30 05:14:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 05:14:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 05:14:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 05:14:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-30 05:14:28,488 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24 [2018-01-30 05:14:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:28,488 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-30 05:14:28,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 05:14:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-30 05:14:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 05:14:28,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:28,489 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:28,489 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash -58111803, now seen corresponding path program 1 times [2018-01-30 05:14:28,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:28,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:28,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:28,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:28,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:28,593 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-30 05:14:28,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:14:28,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:14:28,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:14:28,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:14:28,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:14:28,595 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2018-01-30 05:14:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:28,705 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-01-30 05:14:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:14:28,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-30 05:14:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:28,706 INFO L225 Difference]: With dead ends: 113 [2018-01-30 05:14:28,706 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 05:14:28,707 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-30 05:14:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 05:14:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2018-01-30 05:14:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 05:14:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 05:14:28,711 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2018-01-30 05:14:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:28,711 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 05:14:28,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:14:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 05:14:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 05:14:28,712 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:28,712 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:28,712 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1271294242, now seen corresponding path program 1 times [2018-01-30 05:14:28,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:28,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:28,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:28,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:28,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:14:28,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:14:28,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:14:28,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:14:28,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:14:28,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:14:28,822 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-30 05:14:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:29,003 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-30 05:14:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:14:29,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-30 05:14:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:29,004 INFO L225 Difference]: With dead ends: 113 [2018-01-30 05:14:29,004 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 05:14:29,004 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:14:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 05:14:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2018-01-30 05:14:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 05:14:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-30 05:14:29,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 54 [2018-01-30 05:14:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:29,008 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-30 05:14:29,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:14:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-30 05:14:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 05:14:29,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:29,009 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:29,009 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash -779202658, now seen corresponding path program 1 times [2018-01-30 05:14:29,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:29,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:29,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:29,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:29,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:14:29,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:29,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 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-30 05:14:29,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:29,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:14:29,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:29,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:14:29,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:14:29,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:14:29,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:14:29,153 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 5 states. [2018-01-30 05:14:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:29,318 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-01-30 05:14:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:14:29,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-01-30 05:14:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:29,319 INFO L225 Difference]: With dead ends: 132 [2018-01-30 05:14:29,320 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 05:14:29,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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-30 05:14:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 05:14:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-01-30 05:14:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 05:14:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-30 05:14:29,326 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 55 [2018-01-30 05:14:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:29,326 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-30 05:14:29,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:14:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-30 05:14:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 05:14:29,327 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:29,327 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:29,327 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1220485988, now seen corresponding path program 2 times [2018-01-30 05:14:29,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:29,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:29,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:29,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:29,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 05:14:29,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:29,444 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) [2018-01-30 05:14:29,458 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:14:29,464 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:29,469 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:29,470 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:29,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 05:14:29,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:29,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-30 05:14:29,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:14:29,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:14:29,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:14:29,682 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 8 states. [2018-01-30 05:14:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:29,858 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-30 05:14:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:14:29,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-01-30 05:14:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:29,859 INFO L225 Difference]: With dead ends: 153 [2018-01-30 05:14:29,859 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 05:14:29,859 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:14:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 05:14:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-01-30 05:14:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 05:14:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-30 05:14:29,864 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 69 [2018-01-30 05:14:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:29,864 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-30 05:14:29,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:14:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-30 05:14:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-30 05:14:29,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:29,866 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:29,866 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -117616120, now seen corresponding path program 1 times [2018-01-30 05:14:29,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:29,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:29,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,867 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:29,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:29,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:14:30,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:30,169 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-30 05:14:30,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:30,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:14:30,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:30,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-30 05:14:30,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 05:14:30,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 05:14:30,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:14:30,306 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 13 states. [2018-01-30 05:14:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:30,617 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-01-30 05:14:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 05:14:30,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-01-30 05:14:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:30,619 INFO L225 Difference]: With dead ends: 180 [2018-01-30 05:14:30,619 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 05:14:30,619 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-01-30 05:14:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 05:14:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-30 05:14:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 05:14:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-30 05:14:30,624 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 89 [2018-01-30 05:14:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:30,625 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-30 05:14:30,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 05:14:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-30 05:14:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 05:14:30,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:30,626 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:30,626 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -506436166, now seen corresponding path program 3 times [2018-01-30 05:14:30,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:30,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:30,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:30,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:30,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:30,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:14:30,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:30,701 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:14:30,708 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:14:30,714 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:30,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:30,736 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:30,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:14:30,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:30,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:14:30,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:14:30,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:14:30,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:14:30,762 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 5 states. [2018-01-30 05:14:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:30,822 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-30 05:14:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:14:30,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-01-30 05:14:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:30,823 INFO L225 Difference]: With dead ends: 139 [2018-01-30 05:14:30,823 INFO L226 Difference]: Without dead ends: 125 [2018-01-30 05:14:30,823 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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-30 05:14:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-30 05:14:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-01-30 05:14:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 05:14:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-30 05:14:30,828 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 104 [2018-01-30 05:14:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:30,828 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-30 05:14:30,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:14:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-30 05:14:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 05:14:30,829 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:30,829 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:30,829 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash 736660701, now seen corresponding path program 4 times [2018-01-30 05:14:30,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:30,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:30,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:30,830 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:30,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:30,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 05:14:30,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:30,941 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-30 05:14:30,949 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:14:30,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:30,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:31,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:31,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:14:31,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:14:31,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 05:14:31,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:31,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-30 05:14:31,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:14:31,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:31,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2018-01-30 05:14:31,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 05:14:31,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 05:14:31,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-01-30 05:14:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 05:14:31,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:31,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-01-30 05:14:31,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 05:14:31,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 05:14:31,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-01-30 05:14:31,293 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 18 states. [2018-01-30 05:14:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:31,754 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-01-30 05:14:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 05:14:31,754 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-01-30 05:14:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:31,756 INFO L225 Difference]: With dead ends: 226 [2018-01-30 05:14:31,756 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 05:14:31,757 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:14:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 05:14:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-01-30 05:14:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 05:14:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-01-30 05:14:31,766 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 111 [2018-01-30 05:14:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:31,766 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-01-30 05:14:31,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 05:14:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-01-30 05:14:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-30 05:14:31,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:31,767 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1] [2018-01-30 05:14:31,767 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash -845563189, now seen corresponding path program 2 times [2018-01-30 05:14:31,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:31,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:31,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:31,768 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:31,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:31,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 05:14:31,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:31,834 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-30 05:14:31,838 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:14:31,843 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:31,850 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:31,857 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:31,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 05:14:31,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:31,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-30 05:14:31,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 05:14:31,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 05:14:31,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:14:31,968 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 15 states. [2018-01-30 05:14:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:32,202 INFO L93 Difference]: Finished difference Result 254 states and 272 transitions. [2018-01-30 05:14:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 05:14:32,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-01-30 05:14:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:32,208 INFO L225 Difference]: With dead ends: 254 [2018-01-30 05:14:32,208 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 05:14:32,209 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2018-01-30 05:14:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 05:14:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2018-01-30 05:14:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-30 05:14:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-01-30 05:14:32,214 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 117 [2018-01-30 05:14:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:32,214 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-01-30 05:14:32,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 05:14:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-01-30 05:14:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 05:14:32,215 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:32,215 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:32,215 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash 507215270, now seen corresponding path program 1 times [2018-01-30 05:14:32,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:32,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:32,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:32,216 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:32,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:32,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 05:14:32,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14: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 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-30 05:14:32,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:32,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-30 05:14:32,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:32,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 15 [2018-01-30 05:14:32,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 05:14:32,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 05:14:32,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:14:32,735 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 15 states. [2018-01-30 05:14:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:32,933 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-01-30 05:14:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 05:14:32,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-01-30 05:14:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:32,935 INFO L225 Difference]: With dead ends: 247 [2018-01-30 05:14:32,935 INFO L226 Difference]: Without dead ends: 184 [2018-01-30 05:14:32,935 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:14:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-30 05:14:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-01-30 05:14:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-30 05:14:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2018-01-30 05:14:32,940 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 142 [2018-01-30 05:14:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:32,940 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2018-01-30 05:14:32,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 05:14:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2018-01-30 05:14:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-30 05:14:32,941 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:32,942 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:32,942 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1904002585, now seen corresponding path program 2 times [2018-01-30 05:14:32,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:32,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:32,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:32,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:32,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:32,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 2 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-30 05:14:33,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:33,125 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-30 05:14:33,131 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:14:33,139 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:33,154 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:33,162 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:33,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-01-30 05:14:33,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:33,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 05:14:33,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 05:14:33,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 05:14:33,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:14:33,196 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 15 states. [2018-01-30 05:14:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:33,474 INFO L93 Difference]: Finished difference Result 264 states and 278 transitions. [2018-01-30 05:14:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 05:14:33,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2018-01-30 05:14:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:33,485 INFO L225 Difference]: With dead ends: 264 [2018-01-30 05:14:33,485 INFO L226 Difference]: Without dead ends: 193 [2018-01-30 05:14:33,485 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-01-30 05:14:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-30 05:14:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2018-01-30 05:14:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 05:14:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2018-01-30 05:14:33,489 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 163 [2018-01-30 05:14:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:33,491 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2018-01-30 05:14:33,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 05:14:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2018-01-30 05:14:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-01-30 05:14:33,492 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:33,492 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:33,492 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2119130647, now seen corresponding path program 3 times [2018-01-30 05:14:33,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:33,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:33,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:33,493 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:33,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:33,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-30 05:14:33,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:33,626 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-30 05:14:33,631 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:14:33,637 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:33,644 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:33,647 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:33,650 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:33,650 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:33,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-01-30 05:14:33,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:33,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 05:14:33,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:14:33,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:14:33,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:14:33,698 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand 9 states. [2018-01-30 05:14:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:33,851 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2018-01-30 05:14:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 05:14:33,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2018-01-30 05:14:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:33,854 INFO L225 Difference]: With dead ends: 216 [2018-01-30 05:14:33,854 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 05:14:33,854 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:14:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 05:14:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2018-01-30 05:14:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-30 05:14:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 198 transitions. [2018-01-30 05:14:33,858 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 198 transitions. Word has length 177 [2018-01-30 05:14:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:33,858 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 198 transitions. [2018-01-30 05:14:33,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:14:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2018-01-30 05:14:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 05:14:33,860 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:33,860 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:33,860 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 346581002, now seen corresponding path program 4 times [2018-01-30 05:14:33,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:33,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:33,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:33,861 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:33,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:33,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-30 05:14:34,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:34,224 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-30 05:14:34,230 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:14:34,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:34,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:34,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:34,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:14:34,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 05:14:34,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 05:14:34,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:34,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 05:14:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:34,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:14:34,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:14:34,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:34,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:34,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-30 05:14:34,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 05:14:34,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:34,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:34,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-01-30 05:14:34,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:34,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:15 [2018-01-30 05:14:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-01-30 05:14:34,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:34,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 36 [2018-01-30 05:14:34,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 05:14:34,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 05:14:34,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 05:14:34,777 INFO L87 Difference]: Start difference. First operand 190 states and 198 transitions. Second operand 36 states. [2018-01-30 05:14:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:35,938 INFO L93 Difference]: Finished difference Result 319 states and 346 transitions. [2018-01-30 05:14:35,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 05:14:35,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 184 [2018-01-30 05:14:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:35,939 INFO L225 Difference]: With dead ends: 319 [2018-01-30 05:14:35,939 INFO L226 Difference]: Without dead ends: 298 [2018-01-30 05:14:35,940 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=513, Invalid=4043, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 05:14:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-30 05:14:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2018-01-30 05:14:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-30 05:14:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2018-01-30 05:14:35,945 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 184 [2018-01-30 05:14:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:35,946 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2018-01-30 05:14:35,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 05:14:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2018-01-30 05:14:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-30 05:14:35,947 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:35,947 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1] [2018-01-30 05:14:35,947 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash 326441225, now seen corresponding path program 1 times [2018-01-30 05:14:35,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:35,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:35,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:35,948 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:35,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:35,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-01-30 05:14:36,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:36,383 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-30 05:14:36,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:36,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-30 05:14:36,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:36,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 23 [2018-01-30 05:14:36,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 05:14:36,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 05:14:36,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-01-30 05:14:36,549 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 23 states. [2018-01-30 05:14:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:36,911 INFO L93 Difference]: Finished difference Result 498 states and 540 transitions. [2018-01-30 05:14:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 05:14:36,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 197 [2018-01-30 05:14:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:36,913 INFO L225 Difference]: With dead ends: 498 [2018-01-30 05:14:36,913 INFO L226 Difference]: Without dead ends: 336 [2018-01-30 05:14:36,914 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=744, Invalid=2012, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 05:14:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-30 05:14:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2018-01-30 05:14:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 05:14:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-01-30 05:14:36,920 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 197 [2018-01-30 05:14:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:36,920 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-01-30 05:14:36,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 05:14:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-01-30 05:14:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-01-30 05:14:36,921 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:36,921 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:36,921 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 683360538, now seen corresponding path program 5 times [2018-01-30 05:14:36,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:36,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:36,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:36,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:36,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:36,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2018-01-30 05:14:37,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:37,023 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-30 05:14:37,029 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:14:37,035 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,041 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,043 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,045 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,047 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,055 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,065 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:37,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-01-30 05:14:37,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:37,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 05:14:37,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:14:37,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:14:37,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:14:37,104 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 9 states. [2018-01-30 05:14:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:37,197 INFO L93 Difference]: Finished difference Result 397 states and 426 transitions. [2018-01-30 05:14:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 05:14:37,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 215 [2018-01-30 05:14:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:37,199 INFO L225 Difference]: With dead ends: 397 [2018-01-30 05:14:37,199 INFO L226 Difference]: Without dead ends: 324 [2018-01-30 05:14:37,199 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:14:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-30 05:14:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2018-01-30 05:14:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 05:14:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-01-30 05:14:37,205 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 215 [2018-01-30 05:14:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:37,206 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-01-30 05:14:37,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:14:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-01-30 05:14:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-01-30 05:14:37,206 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:37,206 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-01-30 05:14:37,206 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 609547349, now seen corresponding path program 2 times [2018-01-30 05:14:37,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:37,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:37,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:37,207 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:37,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:37,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-01-30 05:14:37,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:37,316 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-30 05:14:37,320 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:14:37,329 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,339 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:37,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:37,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 05:14:37,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:37,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2018-01-30 05:14:37,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 05:14:37,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 05:14:37,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-01-30 05:14:37,533 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 25 states. [2018-01-30 05:14:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:38,340 INFO L93 Difference]: Finished difference Result 439 states and 470 transitions. [2018-01-30 05:14:38,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 05:14:38,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2018-01-30 05:14:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:38,358 INFO L225 Difference]: With dead ends: 439 [2018-01-30 05:14:38,358 INFO L226 Difference]: Without dead ends: 263 [2018-01-30 05:14:38,359 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=718, Invalid=2362, Unknown=0, NotChecked=0, Total=3080 [2018-01-30 05:14:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-30 05:14:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2018-01-30 05:14:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-30 05:14:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 259 transitions. [2018-01-30 05:14:38,363 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 259 transitions. Word has length 218 [2018-01-30 05:14:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:38,364 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 259 transitions. [2018-01-30 05:14:38,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 05:14:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 259 transitions. [2018-01-30 05:14:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-30 05:14:38,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:38,364 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:38,364 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1332001138, now seen corresponding path program 6 times [2018-01-30 05:14:38,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:38,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:38,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:38,365 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:38,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:38,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-01-30 05:14:39,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:39,312 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-30 05:14:39,325 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:14:39,332 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,348 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,357 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,368 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,377 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,388 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,402 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,418 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,426 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:39,437 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:39,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-01-30 05:14:39,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:39,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 05:14:39,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 05:14:39,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 05:14:39,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:14:39,476 INFO L87 Difference]: Start difference. First operand 249 states and 259 transitions. Second operand 11 states. [2018-01-30 05:14:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:40,179 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-01-30 05:14:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 05:14:40,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2018-01-30 05:14:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:40,180 INFO L225 Difference]: With dead ends: 350 [2018-01-30 05:14:40,180 INFO L226 Difference]: Without dead ends: 277 [2018-01-30 05:14:40,181 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:14:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-30 05:14:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2018-01-30 05:14:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-30 05:14:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 260 transitions. [2018-01-30 05:14:40,185 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 260 transitions. Word has length 236 [2018-01-30 05:14:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:40,186 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 260 transitions. [2018-01-30 05:14:40,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 05:14:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 260 transitions. [2018-01-30 05:14:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-01-30 05:14:40,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:40,187 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:40,187 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2013452968, now seen corresponding path program 7 times [2018-01-30 05:14:40,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:40,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:40,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:40,188 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:40,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:40,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-01-30 05:14:40,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:40,642 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-30 05:14:40,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:40,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 522 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 05:14:40,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:40,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 26 [2018-01-30 05:14:40,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 05:14:40,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 05:14:40,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-01-30 05:14:40,814 INFO L87 Difference]: Start difference. First operand 250 states and 260 transitions. Second operand 26 states. [2018-01-30 05:14:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:41,239 INFO L93 Difference]: Finished difference Result 432 states and 458 transitions. [2018-01-30 05:14:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 05:14:41,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 243 [2018-01-30 05:14:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:41,240 INFO L225 Difference]: With dead ends: 432 [2018-01-30 05:14:41,240 INFO L226 Difference]: Without dead ends: 321 [2018-01-30 05:14:41,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=688, Invalid=2174, Unknown=0, NotChecked=0, Total=2862 [2018-01-30 05:14:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-30 05:14:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2018-01-30 05:14:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-30 05:14:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2018-01-30 05:14:41,248 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 243 [2018-01-30 05:14:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:41,249 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2018-01-30 05:14:41,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 05:14:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2018-01-30 05:14:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-01-30 05:14:41,249 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:41,249 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:41,249 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1575531588, now seen corresponding path program 3 times [2018-01-30 05:14:41,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:41,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:41,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:41,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:41,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:41,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-01-30 05:14:41,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:41,531 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-30 05:14:41,535 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:14:41,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:41,553 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:41,563 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:41,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:41,583 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:41,584 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:41,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-01-30 05:14:41,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:41,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-01-30 05:14:41,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 05:14:41,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 05:14:41,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:14:41,634 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand 10 states. [2018-01-30 05:14:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:41,774 INFO L93 Difference]: Finished difference Result 375 states and 396 transitions. [2018-01-30 05:14:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 05:14:41,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 263 [2018-01-30 05:14:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:41,788 INFO L225 Difference]: With dead ends: 375 [2018-01-30 05:14:41,788 INFO L226 Difference]: Without dead ends: 302 [2018-01-30 05:14:41,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-01-30 05:14:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-30 05:14:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 271. [2018-01-30 05:14:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-30 05:14:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2018-01-30 05:14:41,795 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 263 [2018-01-30 05:14:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:41,795 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2018-01-30 05:14:41,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 05:14:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2018-01-30 05:14:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-01-30 05:14:41,796 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:41,796 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:41,796 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1780536944, now seen corresponding path program 8 times [2018-01-30 05:14:41,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:41,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:41,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:41,797 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:41,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:41,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-01-30 05:14:41,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:41,991 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-30 05:14:42,000 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:14:42,010 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:42,022 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:42,024 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:42,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 05:14:42,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:42,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 28 [2018-01-30 05:14:42,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 05:14:42,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 05:14:42,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-01-30 05:14:42,285 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand 28 states. [2018-01-30 05:14:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:42,619 INFO L93 Difference]: Finished difference Result 427 states and 452 transitions. [2018-01-30 05:14:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 05:14:42,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 264 [2018-01-30 05:14:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:42,620 INFO L225 Difference]: With dead ends: 427 [2018-01-30 05:14:42,620 INFO L226 Difference]: Without dead ends: 309 [2018-01-30 05:14:42,621 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=803, Invalid=2503, Unknown=0, NotChecked=0, Total=3306 [2018-01-30 05:14:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-30 05:14:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 293. [2018-01-30 05:14:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-30 05:14:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 305 transitions. [2018-01-30 05:14:42,625 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 305 transitions. Word has length 264 [2018-01-30 05:14:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:42,625 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 305 transitions. [2018-01-30 05:14:42,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 05:14:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 305 transitions. [2018-01-30 05:14:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 05:14:42,626 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:42,626 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:42,626 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1937707239, now seen corresponding path program 9 times [2018-01-30 05:14:42,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:42,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:42,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:42,627 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:42,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:42,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-01-30 05:14:42,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:42,832 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-30 05:14:42,839 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:14:42,847 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,860 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,873 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,886 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,899 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,912 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,926 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:42,937 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:42,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 179 proven. 117 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-01-30 05:14:43,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:43,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 19 [2018-01-30 05:14:43,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 05:14:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 05:14:43,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:14:43,210 INFO L87 Difference]: Start difference. First operand 293 states and 305 transitions. Second operand 19 states. [2018-01-30 05:14:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:43,890 INFO L93 Difference]: Finished difference Result 337 states and 353 transitions. [2018-01-30 05:14:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 05:14:43,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-01-30 05:14:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:43,891 INFO L225 Difference]: With dead ends: 337 [2018-01-30 05:14:43,891 INFO L226 Difference]: Without dead ends: 306 [2018-01-30 05:14:43,892 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 05:14:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-30 05:14:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2018-01-30 05:14:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 05:14:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 314 transitions. [2018-01-30 05:14:43,897 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 314 transitions. Word has length 285 [2018-01-30 05:14:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:43,898 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 314 transitions. [2018-01-30 05:14:43,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 05:14:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 314 transitions. [2018-01-30 05:14:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-30 05:14:43,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:43,899 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:43,899 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1666345586, now seen corresponding path program 10 times [2018-01-30 05:14:43,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:43,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:43,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:43,899 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:43,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:43,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 4 proven. 161 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-01-30 05:14:44,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:44,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 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-30 05:14:44,667 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:14:44,688 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:44,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:45,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:45,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:14:45,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:45,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:14:45,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 05:14:45,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:45,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:45,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:14:45,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 05:14:45,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-01-30 05:14:45,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:45,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-01-30 05:14:46,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:46,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 05:14:46,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:14:46,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 05:14:46,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:14:46,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 05:14:46,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:14:46,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 05:14:46,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 05:14:46,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:46,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 45 [2018-01-30 05:14:46,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:46,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:29 [2018-01-30 05:14:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 3 proven. 294 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-01-30 05:14:46,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:46,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 45] total 60 [2018-01-30 05:14:46,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 05:14:46,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 05:14:46,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3199, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 05:14:46,976 INFO L87 Difference]: Start difference. First operand 301 states and 314 transitions. Second operand 60 states. [2018-01-30 05:14:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:48,993 INFO L93 Difference]: Finished difference Result 502 states and 542 transitions. [2018-01-30 05:14:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-01-30 05:14:48,995 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 292 [2018-01-30 05:14:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:48,996 INFO L225 Difference]: With dead ends: 502 [2018-01-30 05:14:48,996 INFO L226 Difference]: Without dead ends: 471 [2018-01-30 05:14:48,998 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4137 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1122, Invalid=11534, Unknown=0, NotChecked=0, Total=12656 [2018-01-30 05:14:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-01-30 05:14:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 442. [2018-01-30 05:14:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-30 05:14:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 473 transitions. [2018-01-30 05:14:49,010 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 473 transitions. Word has length 292 [2018-01-30 05:14:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:49,010 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 473 transitions. [2018-01-30 05:14:49,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-30 05:14:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 473 transitions. [2018-01-30 05:14:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-30 05:14:49,011 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:49,012 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:49,012 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -459086745, now seen corresponding path program 4 times [2018-01-30 05:14:49,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:49,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:49,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:49,012 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:49,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:49,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 93 proven. 30 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-01-30 05:14:49,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:49,226 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-30 05:14:49,232 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:14:49,255 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:49,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 116 proven. 149 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2018-01-30 05:14:49,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:49,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2018-01-30 05:14:49,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 05:14:49,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 05:14:49,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-01-30 05:14:49,428 INFO L87 Difference]: Start difference. First operand 442 states and 473 transitions. Second operand 25 states. [2018-01-30 05:14:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:49,742 INFO L93 Difference]: Finished difference Result 565 states and 609 transitions. [2018-01-30 05:14:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 05:14:49,743 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 305 [2018-01-30 05:14:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:49,744 INFO L225 Difference]: With dead ends: 565 [2018-01-30 05:14:49,744 INFO L226 Difference]: Without dead ends: 442 [2018-01-30 05:14:49,745 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 05:14:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-01-30 05:14:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2018-01-30 05:14:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-30 05:14:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 472 transitions. [2018-01-30 05:14:49,754 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 472 transitions. Word has length 305 [2018-01-30 05:14:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:49,754 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 472 transitions. [2018-01-30 05:14:49,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 05:14:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 472 transitions. [2018-01-30 05:14:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 05:14:49,755 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:49,756 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:49,756 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:49,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2037612706, now seen corresponding path program 11 times [2018-01-30 05:14:49,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:49,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:49,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:49,756 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:49,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:49,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 6 proven. 792 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-01-30 05:14:50,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:50,100 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-30 05:14:50,104 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:14:50,111 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,114 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,116 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,118 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,121 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,124 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,127 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,132 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,137 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,143 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,157 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:50,157 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:50,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-01-30 05:14:50,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:50,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 33 [2018-01-30 05:14:50,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 05:14:50,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 05:14:50,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 05:14:50,325 INFO L87 Difference]: Start difference. First operand 442 states and 472 transitions. Second operand 33 states. [2018-01-30 05:14:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:51,019 INFO L93 Difference]: Finished difference Result 768 states and 834 transitions. [2018-01-30 05:14:51,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-30 05:14:51,019 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 309 [2018-01-30 05:14:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:51,020 INFO L225 Difference]: With dead ends: 768 [2018-01-30 05:14:51,020 INFO L226 Difference]: Without dead ends: 493 [2018-01-30 05:14:51,021 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1114, Invalid=3856, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 05:14:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-01-30 05:14:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2018-01-30 05:14:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-01-30 05:14:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 504 transitions. [2018-01-30 05:14:51,047 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 504 transitions. Word has length 309 [2018-01-30 05:14:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:51,047 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 504 transitions. [2018-01-30 05:14:51,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 05:14:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 504 transitions. [2018-01-30 05:14:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 05:14:51,048 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:51,048 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:51,048 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:51,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1189044601, now seen corresponding path program 12 times [2018-01-30 05:14:51,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:51,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:51,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:51,049 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:51,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:51,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2018-01-30 05:14:51,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:51,735 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-30 05:14:51,739 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:14:51,749 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,750 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,755 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,758 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,760 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,764 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,767 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,771 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,775 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,780 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,785 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,793 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:51,794 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:51,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2018-01-30 05:14:51,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:51,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 27 [2018-01-30 05:14:51,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 05:14:51,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 05:14:51,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-01-30 05:14:51,942 INFO L87 Difference]: Start difference. First operand 472 states and 504 transitions. Second operand 27 states. [2018-01-30 05:14:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:52,514 INFO L93 Difference]: Finished difference Result 663 states and 718 transitions. [2018-01-30 05:14:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 05:14:52,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 330 [2018-01-30 05:14:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:52,517 INFO L225 Difference]: With dead ends: 663 [2018-01-30 05:14:52,517 INFO L226 Difference]: Without dead ends: 537 [2018-01-30 05:14:52,518 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=2451, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 05:14:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-01-30 05:14:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 488. [2018-01-30 05:14:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-01-30 05:14:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 522 transitions. [2018-01-30 05:14:52,526 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 522 transitions. Word has length 330 [2018-01-30 05:14:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:52,527 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 522 transitions. [2018-01-30 05:14:52,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 05:14:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 522 transitions. [2018-01-30 05:14:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-30 05:14:52,528 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:52,528 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 7, 7, 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] [2018-01-30 05:14:52,528 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1001160839, now seen corresponding path program 5 times [2018-01-30 05:14:52,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:52,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:52,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:52,529 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:52,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:52,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 119 proven. 54 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2018-01-30 05:14:52,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:52,802 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-30 05:14:52,807 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:14:52,814 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,815 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,817 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,819 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,821 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,824 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,832 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,836 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,840 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,844 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,850 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,857 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,878 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:52,879 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:52,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 115 proven. 54 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2018-01-30 05:14:53,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:53,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-30 05:14:53,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 05:14:53,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 05:14:53,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-30 05:14:53,015 INFO L87 Difference]: Start difference. First operand 488 states and 522 transitions. Second operand 21 states. [2018-01-30 05:14:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:53,159 INFO L93 Difference]: Finished difference Result 627 states and 676 transitions. [2018-01-30 05:14:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 05:14:53,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 340 [2018-01-30 05:14:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:53,160 INFO L225 Difference]: With dead ends: 627 [2018-01-30 05:14:53,160 INFO L226 Difference]: Without dead ends: 488 [2018-01-30 05:14:53,160 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:14:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-01-30 05:14:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2018-01-30 05:14:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-01-30 05:14:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 521 transitions. [2018-01-30 05:14:53,168 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 521 transitions. Word has length 340 [2018-01-30 05:14:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:53,168 INFO L432 AbstractCegarLoop]: Abstraction has 488 states and 521 transitions. [2018-01-30 05:14:53,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 05:14:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 521 transitions. [2018-01-30 05:14:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-01-30 05:14:53,170 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:53,170 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:53,170 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1374323714, now seen corresponding path program 13 times [2018-01-30 05:14:53,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:53,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:53,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:53,170 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:53,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:53,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 6 proven. 161 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2018-01-30 05:14:53,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:53,497 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-30 05:14:53,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:53,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-01-30 05:14:53,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:53,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 34 [2018-01-30 05:14:53,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 05:14:53,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 05:14:53,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 05:14:53,842 INFO L87 Difference]: Start difference. First operand 488 states and 521 transitions. Second operand 34 states. [2018-01-30 05:14:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:54,370 INFO L93 Difference]: Finished difference Result 875 states and 948 transitions. [2018-01-30 05:14:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-30 05:14:54,371 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 344 [2018-01-30 05:14:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:54,373 INFO L225 Difference]: With dead ends: 875 [2018-01-30 05:14:54,373 INFO L226 Difference]: Without dead ends: 568 [2018-01-30 05:14:54,375 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1186, Invalid=3926, Unknown=0, NotChecked=0, Total=5112 [2018-01-30 05:14:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-01-30 05:14:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 502. [2018-01-30 05:14:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-01-30 05:14:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 535 transitions. [2018-01-30 05:14:54,394 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 535 transitions. Word has length 344 [2018-01-30 05:14:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:54,394 INFO L432 AbstractCegarLoop]: Abstraction has 502 states and 535 transitions. [2018-01-30 05:14:54,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 05:14:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 535 transitions. [2018-01-30 05:14:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-01-30 05:14:54,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:54,398 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 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] [2018-01-30 05:14:54,398 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash -610601853, now seen corresponding path program 6 times [2018-01-30 05:14:54,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:54,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:54,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:54,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:54,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:54,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2018-01-30 05:14:54,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:54,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 05:14:54,647 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:14:54,662 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,690 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,696 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,699 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,704 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,707 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,711 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,715 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,722 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:14:54,723 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:54,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2018-01-30 05:14:54,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:54,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 05:14:54,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 05:14:54,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 05:14:54,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:14:54,807 INFO L87 Difference]: Start difference. First operand 502 states and 535 transitions. Second operand 12 states. [2018-01-30 05:14:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:54,986 INFO L93 Difference]: Finished difference Result 789 states and 852 transitions. [2018-01-30 05:14:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 05:14:54,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 361 [2018-01-30 05:14:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:54,988 INFO L225 Difference]: With dead ends: 789 [2018-01-30 05:14:54,988 INFO L226 Difference]: Without dead ends: 573 [2018-01-30 05:14:54,988 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-01-30 05:14:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-30 05:14:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 516. [2018-01-30 05:14:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-01-30 05:14:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 551 transitions. [2018-01-30 05:14:54,998 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 551 transitions. Word has length 361 [2018-01-30 05:14:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:54,998 INFO L432 AbstractCegarLoop]: Abstraction has 516 states and 551 transitions. [2018-01-30 05:14:54,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 05:14:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 551 transitions. [2018-01-30 05:14:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-01-30 05:14:55,000 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:55,000 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:55,000 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash 158437882, now seen corresponding path program 14 times [2018-01-30 05:14:55,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:55,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:55,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:55,000 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:55,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:55,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 6 proven. 1118 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-01-30 05:14:55,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:55,729 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 05:14:55,734 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:14:55,743 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:55,762 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:14:55,774 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:55,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1118 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2018-01-30 05:14:55,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:55,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 05:14:55,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 05:14:55,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 05:14:55,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-30 05:14:55,845 INFO L87 Difference]: Start difference. First operand 516 states and 551 transitions. Second operand 29 states. [2018-01-30 05:14:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:56,402 INFO L93 Difference]: Finished difference Result 862 states and 932 transitions. [2018-01-30 05:14:56,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 05:14:56,403 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 365 [2018-01-30 05:14:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:56,404 INFO L225 Difference]: With dead ends: 862 [2018-01-30 05:14:56,404 INFO L226 Difference]: Without dead ends: 541 [2018-01-30 05:14:56,405 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 05:14:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-30 05:14:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 530. [2018-01-30 05:14:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-30 05:14:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 565 transitions. [2018-01-30 05:14:56,417 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 565 transitions. Word has length 365 [2018-01-30 05:14:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:56,418 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 565 transitions. [2018-01-30 05:14:56,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 05:14:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 565 transitions. [2018-01-30 05:14:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-01-30 05:14:56,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:56,419 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:56,419 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -73141128, now seen corresponding path program 15 times [2018-01-30 05:14:56,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:56,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:56,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:56,420 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:56,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:56,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 6 proven. 212 refuted. 0 times theorem prover too weak. 1676 trivial. 0 not checked. [2018-01-30 05:14:56,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:56,853 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-30 05:14:56,859 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:14:56,867 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,884 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,888 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,893 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,897 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,901 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,907 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,913 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:14:56,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:56,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2018-01-30 05:14:56,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:56,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 05:14:56,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 05:14:56,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 05:14:56,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:14:56,975 INFO L87 Difference]: Start difference. First operand 530 states and 565 transitions. Second operand 19 states. [2018-01-30 05:14:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:57,196 INFO L93 Difference]: Finished difference Result 754 states and 813 transitions. [2018-01-30 05:14:57,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 05:14:57,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 379 [2018-01-30 05:14:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:57,198 INFO L225 Difference]: With dead ends: 754 [2018-01-30 05:14:57,198 INFO L226 Difference]: Without dead ends: 631 [2018-01-30 05:14:57,199 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 05:14:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-01-30 05:14:57,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 530. [2018-01-30 05:14:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-30 05:14:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 565 transitions. [2018-01-30 05:14:57,208 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 565 transitions. Word has length 379 [2018-01-30 05:14:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:57,208 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 565 transitions. [2018-01-30 05:14:57,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 05:14:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 565 transitions. [2018-01-30 05:14:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-30 05:14:57,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:57,209 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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] [2018-01-30 05:14:57,209 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1524927313, now seen corresponding path program 7 times [2018-01-30 05:14:57,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:57,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:57,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:57,210 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:14:57,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:57,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1983 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2018-01-30 05:14:57,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:57,497 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-30 05:14:57,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:57,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1983 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-01-30 05:14:57,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:14:57,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 31] total 43 [2018-01-30 05:14:57,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 05:14:57,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 05:14:57,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:14:57,931 INFO L87 Difference]: Start difference. First operand 530 states and 565 transitions. Second operand 43 states. [2018-01-30 05:14:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:14:58,955 INFO L93 Difference]: Finished difference Result 954 states and 1032 transitions. [2018-01-30 05:14:58,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 05:14:58,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 382 [2018-01-30 05:14:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:14:58,958 INFO L225 Difference]: With dead ends: 954 [2018-01-30 05:14:58,958 INFO L226 Difference]: Without dead ends: 633 [2018-01-30 05:14:58,959 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2589, Invalid=7917, Unknown=0, NotChecked=0, Total=10506 [2018-01-30 05:14:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-01-30 05:14:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 558. [2018-01-30 05:14:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-01-30 05:14:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 595 transitions. [2018-01-30 05:14:58,968 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 595 transitions. Word has length 382 [2018-01-30 05:14:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:14:58,969 INFO L432 AbstractCegarLoop]: Abstraction has 558 states and 595 transitions. [2018-01-30 05:14:58,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 05:14:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 595 transitions. [2018-01-30 05:14:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-01-30 05:14:58,970 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:14:58,970 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:14:58,970 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:14:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash 847691140, now seen corresponding path program 16 times [2018-01-30 05:14:58,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:14:58,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:14:58,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:58,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:14:58,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:14:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:14:58,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:14:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 6 proven. 335 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-01-30 05:14:59,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:14:59,428 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-30 05:14:59,433 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:14:59,465 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:14:59,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:14:59,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:14:59,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 05:14:59,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:14:59,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 05:14:59,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:14:59,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 05:14:59,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:14:59,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 05:14:59,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:14:59,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 05:14:59,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 05:14:59,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-01-30 05:14:59,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:14:59,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:43 [2018-01-30 05:15:00,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 05:15:00,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 05:15:00,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 05:15:00,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 05:15:00,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 05:15:00,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-30 05:15:00,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 05:15:00,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-01-30 05:15:00,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 05:15:00,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2018-01-30 05:15:00,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 05:15:00,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-30 05:15:00,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:00,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:88 [2018-01-30 05:15:01,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-01-30 05:15:01,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:01,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 43 [2018-01-30 05:15:01,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 05:15:01,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 05:15:01,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:43 [2018-01-30 05:15:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 5 proven. 639 refuted. 0 times theorem prover too weak. 1506 trivial. 0 not checked. [2018-01-30 05:15:02,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:02,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 63] total 84 [2018-01-30 05:15:02,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-01-30 05:15:02,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-01-30 05:15:02,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=6388, Unknown=0, NotChecked=0, Total=6972 [2018-01-30 05:15:02,041 INFO L87 Difference]: Start difference. First operand 558 states and 595 transitions. Second operand 84 states. [2018-01-30 05:15:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:06,667 INFO L93 Difference]: Finished difference Result 840 states and 915 transitions. [2018-01-30 05:15:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-01-30 05:15:06,668 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 400 [2018-01-30 05:15:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:06,669 INFO L225 Difference]: With dead ends: 840 [2018-01-30 05:15:06,669 INFO L226 Difference]: Without dead ends: 788 [2018-01-30 05:15:06,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8191 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1931, Invalid=22249, Unknown=0, NotChecked=0, Total=24180 [2018-01-30 05:15:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-01-30 05:15:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 752. [2018-01-30 05:15:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-01-30 05:15:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 814 transitions. [2018-01-30 05:15:06,688 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 814 transitions. Word has length 400 [2018-01-30 05:15:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:06,688 INFO L432 AbstractCegarLoop]: Abstraction has 752 states and 814 transitions. [2018-01-30 05:15:06,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-01-30 05:15:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 814 transitions. [2018-01-30 05:15:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-01-30 05:15:06,690 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:06,690 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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] [2018-01-30 05:15:06,690 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 186663948, now seen corresponding path program 8 times [2018-01-30 05:15:06,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:06,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:06,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:06,690 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:06,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:06,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 4 proven. 312 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2018-01-30 05:15:07,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:07,200 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-30 05:15:07,204 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:15:07,213 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:07,237 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:07,243 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:07,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2018-01-30 05:15:07,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:07,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 33] total 47 [2018-01-30 05:15:07,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 05:15:07,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 05:15:07,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 05:15:07,576 INFO L87 Difference]: Start difference. First operand 752 states and 814 transitions. Second operand 47 states. [2018-01-30 05:15:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:08,553 INFO L93 Difference]: Finished difference Result 1399 states and 1532 transitions. [2018-01-30 05:15:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-30 05:15:08,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 410 [2018-01-30 05:15:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:08,559 INFO L225 Difference]: With dead ends: 1399 [2018-01-30 05:15:08,559 INFO L226 Difference]: Without dead ends: 870 [2018-01-30 05:15:08,560 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3064, Invalid=9592, Unknown=0, NotChecked=0, Total=12656 [2018-01-30 05:15:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-01-30 05:15:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 787. [2018-01-30 05:15:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-01-30 05:15:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 852 transitions. [2018-01-30 05:15:08,580 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 852 transitions. Word has length 410 [2018-01-30 05:15:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:08,580 INFO L432 AbstractCegarLoop]: Abstraction has 787 states and 852 transitions. [2018-01-30 05:15:08,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 05:15:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 852 transitions. [2018-01-30 05:15:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-01-30 05:15:08,582 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:08,582 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 12, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:08,582 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash 3019444, now seen corresponding path program 17 times [2018-01-30 05:15:08,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:08,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:08,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:08,583 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:08,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:08,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 8 proven. 407 refuted. 0 times theorem prover too weak. 2054 trivial. 0 not checked. [2018-01-30 05:15:09,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:09,093 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-30 05:15:09,097 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:15:09,106 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,108 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,109 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,110 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,114 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,116 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,119 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,123 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,127 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,131 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,136 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,150 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,158 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,168 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,212 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:09,214 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:09,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 0 proven. 1712 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2018-01-30 05:15:09,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:09,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35] total 46 [2018-01-30 05:15:09,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-30 05:15:09,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-30 05:15:09,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 05:15:09,529 INFO L87 Difference]: Start difference. First operand 787 states and 852 transitions. Second operand 46 states. [2018-01-30 05:15:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:10,412 INFO L93 Difference]: Finished difference Result 1401 states and 1540 transitions. [2018-01-30 05:15:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-01-30 05:15:10,412 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 431 [2018-01-30 05:15:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:10,414 INFO L225 Difference]: With dead ends: 1401 [2018-01-30 05:15:10,414 INFO L226 Difference]: Without dead ends: 851 [2018-01-30 05:15:10,415 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2180, Invalid=7720, Unknown=0, NotChecked=0, Total=9900 [2018-01-30 05:15:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-01-30 05:15:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 825. [2018-01-30 05:15:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-01-30 05:15:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 893 transitions. [2018-01-30 05:15:10,431 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 893 transitions. Word has length 431 [2018-01-30 05:15:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:10,431 INFO L432 AbstractCegarLoop]: Abstraction has 825 states and 893 transitions. [2018-01-30 05:15:10,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-30 05:15:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 893 transitions. [2018-01-30 05:15:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-01-30 05:15:10,433 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:10,433 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:10,433 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash 848378765, now seen corresponding path program 18 times [2018-01-30 05:15:10,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:10,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:10,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:10,434 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:10,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:10,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 8 proven. 1938 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-01-30 05:15:11,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:11,272 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-30 05:15:11,277 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 05:15:11,286 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,287 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,290 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,292 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,295 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,297 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,301 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,304 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,308 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,312 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,316 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,322 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,327 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,333 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,341 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,349 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,357 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 05:15:11,369 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:11,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 1938 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 05:15:11,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:11,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-30 05:15:11,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 05:15:11,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 05:15:11,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 05:15:11,462 INFO L87 Difference]: Start difference. First operand 825 states and 893 transitions. Second operand 37 states. [2018-01-30 05:15:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:12,100 INFO L93 Difference]: Finished difference Result 1424 states and 1560 transitions. [2018-01-30 05:15:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 05:15:12,102 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 452 [2018-01-30 05:15:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:12,104 INFO L225 Difference]: With dead ends: 1424 [2018-01-30 05:15:12,104 INFO L226 Difference]: Without dead ends: 850 [2018-01-30 05:15:12,105 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 05:15:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-01-30 05:15:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 839. [2018-01-30 05:15:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-01-30 05:15:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 907 transitions. [2018-01-30 05:15:12,121 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 907 transitions. Word has length 452 [2018-01-30 05:15:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:12,121 INFO L432 AbstractCegarLoop]: Abstraction has 839 states and 907 transitions. [2018-01-30 05:15:12,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 05:15:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 907 transitions. [2018-01-30 05:15:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-01-30 05:15:12,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:12,123 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:12,123 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1078600881, now seen corresponding path program 19 times [2018-01-30 05:15:12,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:12,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:12,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:12,124 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:12,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:12,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 8 proven. 2178 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2018-01-30 05:15:13,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:13,226 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-30 05:15:13,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:15:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:13,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 05:15:13,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:13,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-01-30 05:15:13,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 05:15:13,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 05:15:13,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 05:15:13,369 INFO L87 Difference]: Start difference. First operand 839 states and 907 transitions. Second operand 39 states. [2018-01-30 05:15:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:13,907 INFO L93 Difference]: Finished difference Result 1438 states and 1574 transitions. [2018-01-30 05:15:13,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-30 05:15:13,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 466 [2018-01-30 05:15:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:13,909 INFO L225 Difference]: With dead ends: 1438 [2018-01-30 05:15:13,909 INFO L226 Difference]: Without dead ends: 864 [2018-01-30 05:15:13,910 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 05:15:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-01-30 05:15:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 853. [2018-01-30 05:15:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-01-30 05:15:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 921 transitions. [2018-01-30 05:15:13,928 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 921 transitions. Word has length 466 [2018-01-30 05:15:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:13,928 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 921 transitions. [2018-01-30 05:15:13,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 05:15:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 921 transitions. [2018-01-30 05:15:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-01-30 05:15:13,930 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:13,930 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 13, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:13,930 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash -585187439, now seen corresponding path program 20 times [2018-01-30 05:15:13,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:13,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:13,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:13,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:15:13,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:13,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 8 proven. 270 refuted. 0 times theorem prover too weak. 2990 trivial. 0 not checked. [2018-01-30 05:15:14,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:14,386 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-30 05:15:14,391 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:15:14,401 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:14,426 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:14,430 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:14,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 0 proven. 2432 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2018-01-30 05:15:15,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:15,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 41] total 50 [2018-01-30 05:15:15,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-30 05:15:15,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-30 05:15:15,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1956, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 05:15:15,981 INFO L87 Difference]: Start difference. First operand 853 states and 921 transitions. Second operand 50 states. [2018-01-30 05:15:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:16,838 INFO L93 Difference]: Finished difference Result 1594 states and 1748 transitions. [2018-01-30 05:15:16,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-30 05:15:16,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 480 [2018-01-30 05:15:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:16,840 INFO L225 Difference]: With dead ends: 1594 [2018-01-30 05:15:16,840 INFO L226 Difference]: Without dead ends: 1020 [2018-01-30 05:15:16,842 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2610, Invalid=8520, Unknown=0, NotChecked=0, Total=11130 [2018-01-30 05:15:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-01-30 05:15:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 867. [2018-01-30 05:15:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-01-30 05:15:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 935 transitions. [2018-01-30 05:15:16,858 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 935 transitions. Word has length 480 [2018-01-30 05:15:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:16,858 INFO L432 AbstractCegarLoop]: Abstraction has 867 states and 935 transitions. [2018-01-30 05:15:16,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-30 05:15:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 935 transitions. [2018-01-30 05:15:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-01-30 05:15:16,860 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:16,860 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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] [2018-01-30 05:15:16,860 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2014537947, now seen corresponding path program 9 times [2018-01-30 05:15:16,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:16,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:16,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:16,861 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:16,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:16,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 259 proven. 85 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-01-30 05:15:17,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:17,488 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) [2018-01-30 05:15:17,497 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:17,509 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,526 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,537 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,540 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,550 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,561 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:17,562 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:17,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2018-01-30 05:15:17,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:17,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-01-30 05:15:17,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 05:15:17,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 05:15:17,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-01-30 05:15:17,797 INFO L87 Difference]: Start difference. First operand 867 states and 935 transitions. Second operand 30 states. [2018-01-30 05:15:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:18,520 INFO L93 Difference]: Finished difference Result 1217 states and 1323 transitions. [2018-01-30 05:15:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 05:15:18,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 494 [2018-01-30 05:15:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:18,522 INFO L225 Difference]: With dead ends: 1217 [2018-01-30 05:15:18,522 INFO L226 Difference]: Without dead ends: 797 [2018-01-30 05:15:18,523 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1363, Invalid=3467, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 05:15:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-01-30 05:15:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 725. [2018-01-30 05:15:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-01-30 05:15:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 773 transitions. [2018-01-30 05:15:18,559 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 773 transitions. Word has length 494 [2018-01-30 05:15:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:18,560 INFO L432 AbstractCegarLoop]: Abstraction has 725 states and 773 transitions. [2018-01-30 05:15:18,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 05:15:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 773 transitions. [2018-01-30 05:15:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-01-30 05:15:18,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:18,562 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:18,562 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash 722514076, now seen corresponding path program 10 times [2018-01-30 05:15:18,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:18,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:18,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:18,562 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:18,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:18,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2018-01-30 05:15:19,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:19,041 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 05:15:19,057 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:19,097 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:19,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 263 proven. 593 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2018-01-30 05:15:19,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:19,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2018-01-30 05:15:19,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 05:15:19,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 05:15:19,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 05:15:19,486 INFO L87 Difference]: Start difference. First operand 725 states and 773 transitions. Second operand 47 states. [2018-01-30 05:15:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:21,096 INFO L93 Difference]: Finished difference Result 1279 states and 1393 transitions. [2018-01-30 05:15:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-01-30 05:15:21,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 518 [2018-01-30 05:15:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:21,100 INFO L225 Difference]: With dead ends: 1279 [2018-01-30 05:15:21,100 INFO L226 Difference]: Without dead ends: 1015 [2018-01-30 05:15:21,101 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2950, Invalid=13306, Unknown=0, NotChecked=0, Total=16256 [2018-01-30 05:15:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-01-30 05:15:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 846. [2018-01-30 05:15:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-01-30 05:15:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 905 transitions. [2018-01-30 05:15:21,120 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 905 transitions. Word has length 518 [2018-01-30 05:15:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:21,120 INFO L432 AbstractCegarLoop]: Abstraction has 846 states and 905 transitions. [2018-01-30 05:15:21,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 05:15:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 905 transitions. [2018-01-30 05:15:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-01-30 05:15:21,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:21,122 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:21,122 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash 915090430, now seen corresponding path program 1 times [2018-01-30 05:15:21,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:21,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:21,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:21,123 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:21,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:21,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3971 backedges. 6 proven. 2700 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-01-30 05:15:22,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:22,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:22,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:15:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:22,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3971 backedges. 0 proven. 2700 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2018-01-30 05:15:22,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:22,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-01-30 05:15:22,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 05:15:22,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 05:15:22,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:15:22,422 INFO L87 Difference]: Start difference. First operand 846 states and 905 transitions. Second operand 43 states. [2018-01-30 05:15:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:23,139 INFO L93 Difference]: Finished difference Result 1424 states and 1542 transitions. [2018-01-30 05:15:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 05:15:23,139 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 525 [2018-01-30 05:15:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:23,141 INFO L225 Difference]: With dead ends: 1424 [2018-01-30 05:15:23,141 INFO L226 Difference]: Without dead ends: 871 [2018-01-30 05:15:23,142 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 05:15:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-01-30 05:15:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 860. [2018-01-30 05:15:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-01-30 05:15:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 919 transitions. [2018-01-30 05:15:23,159 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 919 transitions. Word has length 525 [2018-01-30 05:15:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:23,159 INFO L432 AbstractCegarLoop]: Abstraction has 860 states and 919 transitions. [2018-01-30 05:15:23,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 05:15:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 919 transitions. [2018-01-30 05:15:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-01-30 05:15:23,161 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:23,162 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:23,162 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2042743172, now seen corresponding path program 2 times [2018-01-30 05:15:23,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:23,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:23,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:23,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:15:23,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:23,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 6 proven. 2982 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-01-30 05:15:24,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:24,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:24,395 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:15:24,407 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:24,435 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:24,439 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:24,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 0 proven. 2982 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2018-01-30 05:15:24,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:24,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-01-30 05:15:24,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 05:15:24,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 05:15:24,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 05:15:24,559 INFO L87 Difference]: Start difference. First operand 860 states and 919 transitions. Second operand 45 states. [2018-01-30 05:15:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:25,478 INFO L93 Difference]: Finished difference Result 1438 states and 1556 transitions. [2018-01-30 05:15:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-30 05:15:25,479 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 539 [2018-01-30 05:15:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:25,480 INFO L225 Difference]: With dead ends: 1438 [2018-01-30 05:15:25,480 INFO L226 Difference]: Without dead ends: 885 [2018-01-30 05:15:25,481 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 05:15:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-01-30 05:15:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 874. [2018-01-30 05:15:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-01-30 05:15:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 933 transitions. [2018-01-30 05:15:25,507 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 933 transitions. Word has length 539 [2018-01-30 05:15:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:25,508 INFO L432 AbstractCegarLoop]: Abstraction has 874 states and 933 transitions. [2018-01-30 05:15:25,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 05:15:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 933 transitions. [2018-01-30 05:15:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-01-30 05:15:25,510 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:25,510 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 16, 15, 15, 15, 15, 14, 14, 13, 12, 12, 12, 12, 11, 11, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:25,510 INFO L371 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1395258246, now seen corresponding path program 3 times [2018-01-30 05:15:25,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:25,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:25,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:25,511 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:25,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:25,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 6 proven. 352 refuted. 0 times theorem prover too weak. 4191 trivial. 0 not checked. [2018-01-30 05:15:26,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:26,075 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:26,080 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:15:26,090 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,093 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,097 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,100 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,104 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,108 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,112 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,117 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:26,118 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:26,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4549 backedges. 99 proven. 352 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-01-30 05:15:26,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:26,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 19 [2018-01-30 05:15:26,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 05:15:26,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 05:15:26,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-30 05:15:26,284 INFO L87 Difference]: Start difference. First operand 874 states and 933 transitions. Second operand 19 states. [2018-01-30 05:15:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:26,596 INFO L93 Difference]: Finished difference Result 1652 states and 1817 transitions. [2018-01-30 05:15:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 05:15:26,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 553 [2018-01-30 05:15:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:26,599 INFO L225 Difference]: With dead ends: 1652 [2018-01-30 05:15:26,599 INFO L226 Difference]: Without dead ends: 1584 [2018-01-30 05:15:26,600 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 05:15:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2018-01-30 05:15:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 862. [2018-01-30 05:15:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-01-30 05:15:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 921 transitions. [2018-01-30 05:15:26,621 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 921 transitions. Word has length 553 [2018-01-30 05:15:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:26,621 INFO L432 AbstractCegarLoop]: Abstraction has 862 states and 921 transitions. [2018-01-30 05:15:26,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 05:15:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 921 transitions. [2018-01-30 05:15:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-01-30 05:15:26,623 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:26,624 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 17, 16, 16, 16, 16, 15, 15, 13, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:26,624 INFO L371 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1602173500, now seen corresponding path program 11 times [2018-01-30 05:15:26,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:26,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:26,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:26,624 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:26,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:26,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4666 backedges. 6 proven. 486 refuted. 0 times theorem prover too weak. 4174 trivial. 0 not checked. [2018-01-30 05:15:27,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:27,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:27,303 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 05:15:27,315 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,316 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,317 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,319 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,321 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,322 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,324 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,327 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,330 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,333 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,336 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,341 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,353 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,360 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,369 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,378 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,388 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,401 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,415 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,431 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,450 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,525 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:15:27,527 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:27,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4666 backedges. 453 proven. 168 refuted. 0 times theorem prover too weak. 4045 trivial. 0 not checked. [2018-01-30 05:15:27,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:27,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2018-01-30 05:15:27,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 05:15:27,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 05:15:27,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1439, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 05:15:27,848 INFO L87 Difference]: Start difference. First operand 862 states and 921 transitions. Second operand 43 states. [2018-01-30 05:15:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:28,538 INFO L93 Difference]: Finished difference Result 1257 states and 1368 transitions. [2018-01-30 05:15:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 05:15:28,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 560 [2018-01-30 05:15:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:28,540 INFO L225 Difference]: With dead ends: 1257 [2018-01-30 05:15:28,540 INFO L226 Difference]: Without dead ends: 849 [2018-01-30 05:15:28,541 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1742, Invalid=5568, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 05:15:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-01-30 05:15:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 843. [2018-01-30 05:15:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-01-30 05:15:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 881 transitions. [2018-01-30 05:15:28,563 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 881 transitions. Word has length 560 [2018-01-30 05:15:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:28,563 INFO L432 AbstractCegarLoop]: Abstraction has 843 states and 881 transitions. [2018-01-30 05:15:28,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 05:15:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 881 transitions. [2018-01-30 05:15:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-01-30 05:15:28,565 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:28,565 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 16, 15, 15, 15, 15, 15, 15, 14, 13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:28,565 INFO L371 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1653945208, now seen corresponding path program 21 times [2018-01-30 05:15:28,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:28,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:28,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:28,566 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:28,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:28,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4695 backedges. 8 proven. 3278 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2018-01-30 05:15:29,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:29,819 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:29,824 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 05:15:29,835 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,838 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,841 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,845 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,850 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,854 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,859 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,878 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,887 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,896 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,908 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,921 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 05:15:29,922 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:29,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:15:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4695 backedges. 100 proven. 572 refuted. 0 times theorem prover too weak. 4023 trivial. 0 not checked. [2018-01-30 05:15:30,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:15:30,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 32] total 63 [2018-01-30 05:15:30,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-30 05:15:30,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-30 05:15:30,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=3174, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 05:15:30,274 INFO L87 Difference]: Start difference. First operand 843 states and 881 transitions. Second operand 63 states. [2018-01-30 05:15:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:15:31,717 INFO L93 Difference]: Finished difference Result 1416 states and 1496 transitions. [2018-01-30 05:15:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-01-30 05:15:31,717 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 571 [2018-01-30 05:15:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:15:31,719 INFO L225 Difference]: With dead ends: 1416 [2018-01-30 05:15:31,719 INFO L226 Difference]: Without dead ends: 894 [2018-01-30 05:15:31,721 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3968, Invalid=14392, Unknown=0, NotChecked=0, Total=18360 [2018-01-30 05:15:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-01-30 05:15:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 857. [2018-01-30 05:15:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-01-30 05:15:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 895 transitions. [2018-01-30 05:15:31,742 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 895 transitions. Word has length 571 [2018-01-30 05:15:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:15:31,742 INFO L432 AbstractCegarLoop]: Abstraction has 857 states and 895 transitions. [2018-01-30 05:15:31,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-30 05:15:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 895 transitions. [2018-01-30 05:15:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-01-30 05:15:31,744 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:15:31,744 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:15:31,744 INFO L371 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 05:15:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2023974855, now seen corresponding path program 22 times [2018-01-30 05:15:31,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:15:31,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:15:31,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:31,745 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:15:31,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:15:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:15:31,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:15:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5098 backedges. 8 proven. 665 refuted. 0 times theorem prover too weak. 4425 trivial. 0 not checked. [2018-01-30 05:15:32,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:15:32,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:15:32,577 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 05:15:32,632 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:15:32,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-30 05:15:33,091 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 05:15:33,091 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:15:33,094 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:15:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:15:33 BasicIcfg [2018-01-30 05:15:33,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:15:33,095 INFO L168 Benchmark]: Toolchain (without parser) took 65330.94 ms. Allocated memory was 149.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 115.0 MB in the beginning and 109.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.9 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 103.45 ms. Allocated memory is still 149.9 MB. Free memory was 114.8 MB in the beginning and 106.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: Boogie Preprocessor took 17.43 ms. Allocated memory is still 149.9 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: RCFGBuilder took 393.57 ms. Allocated memory is still 149.9 MB. Free memory was 104.9 MB in the beginning and 89.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: IcfgTransformer took 13.08 ms. Allocated memory is still 149.9 MB. Free memory was 89.8 MB in the beginning and 88.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,096 INFO L168 Benchmark]: TraceAbstraction took 64800.98 ms. Allocated memory was 149.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 88.3 MB in the beginning and 109.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-30 05:15:33,097 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 149.9 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 103.45 ms. Allocated memory is still 149.9 MB. Free memory was 114.8 MB in the beginning and 106.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.43 ms. Allocated memory is still 149.9 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 393.57 ms. Allocated memory is still 149.9 MB. Free memory was 104.9 MB in the beginning and 89.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 13.08 ms. Allocated memory is still 149.9 MB. Free memory was 89.8 MB in the beginning and 88.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64800.98 ms. Allocated memory was 149.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 88.3 MB in the beginning and 109.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 1.2 GB. 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 593 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 1 error locations. TIMEOUT Result, 64.7s OverallTime, 45 OverallIterations, 24 TraceHistogramMax, 28.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2167 SDtfs, 8654 SDslu, 31739 SDs, 0 SdLazy, 29330 SolverSat, 1635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14843 GetRequests, 12507 SyntacticMatches, 0 SemanticMatches, 2336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48147 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=874occurred in iteration=41, 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.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 2162 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 25981 NumberOfCodeBlocks, 24444 NumberOfCodeBlocksAsserted, 260 NumberOfCheckSat, 25896 ConstructedInterpolants, 0 QuantifiedInterpolants, 23354592 SizeOfPredicates, 813 NumberOfNonLiveVariables, 15612 ConjunctsInSsa, 1046 ConjunctsInUnsatCore, 85 InterpolantComputations, 3 PerfectInterpolantSequences, 90931/136386 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/copysome2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-15-33-101.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copysome2_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-15-33-101.csv Completed graceful shutdown