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-examples/standard_reverse_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 03:50:18,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 03:50:18,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 03:50:18,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 03:50:18,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 03:50:18,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 03:50:18,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 03:50:18,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 03:50:18,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 03:50:18,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 03:50:18,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 03:50:18,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 03:50:18,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 03:50:18,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 03:50:18,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 03:50:18,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 03:50:18,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 03:50:18,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 03:50:18,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 03:50:18,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 03:50:18,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 03:50:18,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 03:50:18,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 03:50:18,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 03:50:18,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 03:50:18,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 03:50:18,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 03:50:18,324 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 03:50:18,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 03:50:18,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 03:50:18,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 03:50:18,325 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 03:50:18,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 03:50:18,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 03:50:18,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 03:50:18,331 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 03:50:18,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 03:50:18,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 03:50:18,331 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 03:50:18,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 03:50:18,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 03:50:18,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 03:50:18,332 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 03:50:18,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 03:50:18,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 03:50:18,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 03:50:18,334 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 03:50:18,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 03:50:18,361 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 03:50:18,363 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 03:50:18,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 03:50:18,364 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 03:50:18,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_reverse_true-unreach-call_ground.i [2018-01-30 03:50:18,428 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 03:50:18,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 03:50:18,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 03:50:18,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 03:50:18,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 03:50:18,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d35538b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18, skipping insertion in model container [2018-01-30 03:50:18,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,445 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:50:18,454 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:50:18,523 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:50:18,530 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:50:18,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18 WrapperNode [2018-01-30 03:50:18,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 03:50:18,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 03:50:18,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 03:50:18,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 03:50:18,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 03:50:18,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 03:50:18,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 03:50:18,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 03:50:18,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (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 03:50:18,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 03:50:18,595 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 03:50:18,595 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 03:50:18,596 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 03:50:18,596 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 03:50:18,596 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 03:50:18,596 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 03:50:18,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 03:50:18,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 03:50:18,760 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 03:50:18,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:50:18 BoogieIcfgContainer [2018-01-30 03:50:18,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 03:50:18,761 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 03:50:18,761 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 03:50:18,762 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 03:50:18,763 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:50:18" (1/1) ... [2018-01-30 03:50:18,771 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 03:50:18,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:50:18 BasicIcfg [2018-01-30 03:50:18,777 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 03:50:18,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 03:50:18,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 03:50:18,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 03:50:18,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 03:50:18" (1/4) ... [2018-01-30 03:50:18,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a69f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:50:18, skipping insertion in model container [2018-01-30 03:50:18,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:50:18" (2/4) ... [2018-01-30 03:50:18,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a69f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:50:18, skipping insertion in model container [2018-01-30 03:50:18,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:50:18" (3/4) ... [2018-01-30 03:50:18,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a69f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:50:18, skipping insertion in model container [2018-01-30 03:50:18,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:50:18" (4/4) ... [2018-01-30 03:50:18,791 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_reverse_true-unreach-call_ground.ileft_unchanged_by_heapseparator [2018-01-30 03:50:18,799 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 03:50:18,804 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 03:50:18,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 03:50:18,847 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 03:50:18,847 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 03:50:18,847 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 03:50:18,847 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 03:50:18,847 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 03:50:18,847 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 03:50:18,847 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 03:50:18,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 03:50:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-30 03:50:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-30 03:50:18,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:18,861 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:18,861 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2056886801, now seen corresponding path program 1 times [2018-01-30 03:50:18,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:18,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:18,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:18,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:18,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:18,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:18,931 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 03:50:18,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:50:18,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 03:50:18,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 03:50:18,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 03:50:18,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 03:50:18,942 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-30 03:50:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:18,955 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-01-30 03:50:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 03:50:18,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-30 03:50:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:18,961 INFO L225 Difference]: With dead ends: 52 [2018-01-30 03:50:18,961 INFO L226 Difference]: Without dead ends: 28 [2018-01-30 03:50:18,963 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 03:50:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-30 03:50:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-30 03:50:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-30 03:50:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-01-30 03:50:18,984 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2018-01-30 03:50:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:18,984 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-01-30 03:50:18,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 03:50:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-01-30 03:50:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 03:50:18,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:18,985 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:18,985 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2067364562, now seen corresponding path program 1 times [2018-01-30 03:50:18,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:18,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:18,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:18,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:18,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:18,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:19,043 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 03:50:19,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:50:19,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:50:19,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:50:19,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:50:19,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:50:19,045 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2018-01-30 03:50:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:19,178 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-30 03:50:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:50:19,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-01-30 03:50:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:19,182 INFO L225 Difference]: With dead ends: 47 [2018-01-30 03:50:19,182 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 03:50:19,182 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 03:50:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 03:50:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-01-30 03:50:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-30 03:50:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-01-30 03:50:19,186 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-01-30 03:50:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:19,186 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-01-30 03:50:19,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:50:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-01-30 03:50:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 03:50:19,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:19,187 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:19,187 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1937533819, now seen corresponding path program 1 times [2018-01-30 03:50:19,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:19,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:19,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:19,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:19,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:50:19,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:19,292 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 03:50:19,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:19,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:50:19,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:19,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 03:50:19,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 03:50:19,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 03:50:19,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 03:50:19,351 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2018-01-30 03:50:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:19,486 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-30 03:50:19,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 03:50:19,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 03:50:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:19,487 INFO L225 Difference]: With dead ends: 53 [2018-01-30 03:50:19,487 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 03:50:19,487 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:50:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 03:50:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-01-30 03:50:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-30 03:50:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-30 03:50:19,490 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 24 [2018-01-30 03:50:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:19,490 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-30 03:50:19,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 03:50:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-30 03:50:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 03:50:19,491 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:19,491 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:19,491 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1976072548, now seen corresponding path program 2 times [2018-01-30 03:50:19,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:19,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:19,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:19,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:19,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:50:19,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:19,676 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:50:19,682 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:50:19,689 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:19,701 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:19,708 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:19,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:50:19,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:19,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 03:50:19,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 03:50:19,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 03:50:19,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:50:19,731 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 7 states. [2018-01-30 03:50:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:19,815 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-30 03:50:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 03:50:19,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-30 03:50:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:19,816 INFO L225 Difference]: With dead ends: 59 [2018-01-30 03:50:19,816 INFO L226 Difference]: Without dead ends: 45 [2018-01-30 03:50:19,816 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:50:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-30 03:50:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-30 03:50:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-30 03:50:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-30 03:50:19,820 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 30 [2018-01-30 03:50:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:19,820 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-30 03:50:19,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 03:50:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-30 03:50:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 03:50:19,820 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:19,820 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:19,820 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1705161869, now seen corresponding path program 3 times [2018-01-30 03:50:19,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:19,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:19,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,821 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:19,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:19,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 03:50:19,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:19,977 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 03:50:19,985 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:50:19,996 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:19,999 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:19,999 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:20,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:20,065 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 12 treesize of output 11 [2018-01-30 03:50:20,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:20,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:20,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 03:50:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-30 03:50:20,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 03:50:20,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-01-30 03:50:20,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 03:50:20,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 03:50:20,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-30 03:50:20,505 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2018-01-30 03:50:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:21,242 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-01-30 03:50:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 03:50:21,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-30 03:50:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:21,243 INFO L225 Difference]: With dead ends: 74 [2018-01-30 03:50:21,243 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 03:50:21,243 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 03:50:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 03:50:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-30 03:50:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 03:50:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-30 03:50:21,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2018-01-30 03:50:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:21,248 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-30 03:50:21,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 03:50:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-30 03:50:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 03:50:21,248 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:21,248 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:21,248 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1789633177, now seen corresponding path program 1 times [2018-01-30 03:50:21,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:21,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:21,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,249 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:21,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:21,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:50:21,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:21,368 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 03:50:21,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:21,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:50:21,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:21,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 03:50:21,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 03:50:21,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 03:50:21,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:50:21,425 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 11 states. [2018-01-30 03:50:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:21,593 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-30 03:50:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 03:50:21,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-01-30 03:50:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:21,595 INFO L225 Difference]: With dead ends: 85 [2018-01-30 03:50:21,595 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 03:50:21,595 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:50:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 03:50:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-30 03:50:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-30 03:50:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-30 03:50:21,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 52 [2018-01-30 03:50:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:21,599 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-30 03:50:21,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 03:50:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-30 03:50:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-30 03:50:21,600 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:21,600 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:21,600 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash -347526910, now seen corresponding path program 2 times [2018-01-30 03:50:21,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:21,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:21,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:21,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:21,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:50:21,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:21,743 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 03:50:21,748 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:50:21,751 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:21,771 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:21,774 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:21,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 03:50:21,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:21,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 03:50:21,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 03:50:21,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 03:50:21,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-30 03:50:21,798 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 13 states. [2018-01-30 03:50:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:21,929 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-30 03:50:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 03:50:21,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-01-30 03:50:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:21,929 INFO L225 Difference]: With dead ends: 91 [2018-01-30 03:50:21,929 INFO L226 Difference]: Without dead ends: 70 [2018-01-30 03:50:21,930 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-01-30 03:50:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-30 03:50:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-30 03:50:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 03:50:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-30 03:50:21,934 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 58 [2018-01-30 03:50:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:21,934 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-30 03:50:21,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 03:50:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-30 03:50:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 03:50:21,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:21,935 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:21,935 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -141001557, now seen corresponding path program 3 times [2018-01-30 03:50:21,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:21,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:21,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:21,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:21,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 03:50:22,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:22,042 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 03:50:22,048 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:50:22,052 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:22,059 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:22,075 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:22,081 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:22,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:22,104 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 12 treesize of output 11 [2018-01-30 03:50:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:22,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:22,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:50:22,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:22,197 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 26 treesize of output 31 [2018-01-30 03:50:22,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:22,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:22,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2018-01-30 03:50:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 03:50:22,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:22,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-01-30 03:50:22,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 03:50:22,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 03:50:22,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-01-30 03:50:22,689 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 30 states. [2018-01-30 03:50:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:24,110 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-01-30 03:50:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 03:50:24,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-01-30 03:50:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:24,111 INFO L225 Difference]: With dead ends: 111 [2018-01-30 03:50:24,111 INFO L226 Difference]: Without dead ends: 90 [2018-01-30 03:50:24,112 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=704, Invalid=3718, Unknown=0, NotChecked=0, Total=4422 [2018-01-30 03:50:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-30 03:50:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-01-30 03:50:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 03:50:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-01-30 03:50:24,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 64 [2018-01-30 03:50:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:24,118 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-01-30 03:50:24,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 03:50:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-01-30 03:50:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 03:50:24,118 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:24,119 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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] [2018-01-30 03:50:24,119 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1056410185, now seen corresponding path program 4 times [2018-01-30 03:50:24,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:24,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:24,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,124 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:24,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:24,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 140 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:50:24,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:24,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:50:24,320 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:50:24,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:24,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:50:24,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:24,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-30 03:50:24,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 03:50:24,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 03:50:24,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-30 03:50:24,370 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 17 states. [2018-01-30 03:50:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:24,560 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-01-30 03:50:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 03:50:24,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-01-30 03:50:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:24,572 INFO L225 Difference]: With dead ends: 123 [2018-01-30 03:50:24,572 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 03:50:24,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:50:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 03:50:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-01-30 03:50:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 03:50:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-01-30 03:50:24,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 80 [2018-01-30 03:50:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:24,578 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-01-30 03:50:24,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 03:50:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-01-30 03:50:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 03:50:24,579 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:24,579 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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] [2018-01-30 03:50:24,579 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash 663073952, now seen corresponding path program 5 times [2018-01-30 03:50:24,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:24,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:24,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,580 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:24,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:24,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 4 proven. 184 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:50:24,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:24,733 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 03:50:24,743 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:50:24,747 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,758 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,768 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,769 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,771 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,773 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,775 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,778 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:24,779 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:24,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-30 03:50:24,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:24,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 03:50:24,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 03:50:24,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 03:50:24,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:50:24,808 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 19 states. [2018-01-30 03:50:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:24,959 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-01-30 03:50:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 03:50:24,959 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-01-30 03:50:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:24,960 INFO L225 Difference]: With dead ends: 129 [2018-01-30 03:50:24,960 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 03:50:24,960 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 87 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 03:50:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 03:50:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2018-01-30 03:50:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 03:50:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-01-30 03:50:24,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 86 [2018-01-30 03:50:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:24,966 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-01-30 03:50:24,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 03:50:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-01-30 03:50:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-30 03:50:24,967 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:24,967 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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] [2018-01-30 03:50:24,967 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -467115831, now seen corresponding path program 6 times [2018-01-30 03:50:24,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:24,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:24,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,968 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:24,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:24,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 4 proven. 234 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:50:25,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:25,129 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 03:50:25,136 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:50:25,144 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,151 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,159 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,160 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,167 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,169 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,170 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,173 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:25,173 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:25,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:25,185 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 12 treesize of output 11 [2018-01-30 03:50:25,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:50:25,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:25,227 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 26 treesize of output 31 [2018-01-30 03:50:25,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:50:25,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:25,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:25,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:25,292 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 39 treesize of output 58 [2018-01-30 03:50:25,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:25,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-01-30 03:50:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 124 proven. 21 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-01-30 03:50:25,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:25,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2018-01-30 03:50:25,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 03:50:25,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 03:50:25,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 03:50:25,967 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 41 states. [2018-01-30 03:50:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:29,119 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-01-30 03:50:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-30 03:50:29,119 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 92 [2018-01-30 03:50:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:29,120 INFO L225 Difference]: With dead ends: 149 [2018-01-30 03:50:29,120 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 03:50:29,121 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1257, Invalid=7299, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 03:50:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 03:50:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-01-30 03:50:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 03:50:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-01-30 03:50:29,129 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 92 [2018-01-30 03:50:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:29,129 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-01-30 03:50:29,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 03:50:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-01-30 03:50:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 03:50:29,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:29,130 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:29,130 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 208315605, now seen corresponding path program 7 times [2018-01-30 03:50:29,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:29,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:29,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:29,131 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:29,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:29,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 6 proven. 290 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 03:50:29,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:29,500 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 03:50:29,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:29,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 03:50:29,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:29,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 03:50:29,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 03:50:29,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 03:50:29,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-30 03:50:29,547 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 23 states. [2018-01-30 03:50:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:29,831 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-01-30 03:50:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 03:50:29,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 108 [2018-01-30 03:50:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:29,832 INFO L225 Difference]: With dead ends: 161 [2018-01-30 03:50:29,832 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 03:50:29,832 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 03:50:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 03:50:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-01-30 03:50:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-30 03:50:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-01-30 03:50:29,838 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 108 [2018-01-30 03:50:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:29,838 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-01-30 03:50:29,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 03:50:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-01-30 03:50:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-30 03:50:29,839 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:29,839 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 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] [2018-01-30 03:50:29,839 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -126493634, now seen corresponding path program 8 times [2018-01-30 03:50:29,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:29,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:29,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:29,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:29,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:29,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 6 proven. 352 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 03:50:30,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:30,043 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 03:50:30,048 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:50:30,054 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:30,063 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:30,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:30,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 03:50:30,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:30,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-30 03:50:30,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 03:50:30,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 03:50:30,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-30 03:50:30,092 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 25 states. [2018-01-30 03:50:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:30,294 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-01-30 03:50:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 03:50:30,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 114 [2018-01-30 03:50:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:30,295 INFO L225 Difference]: With dead ends: 167 [2018-01-30 03:50:30,295 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 03:50:30,296 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 03:50:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 03:50:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-01-30 03:50:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-30 03:50:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-01-30 03:50:30,304 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 114 [2018-01-30 03:50:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:30,304 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-01-30 03:50:30,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 03:50:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-01-30 03:50:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-30 03:50:30,310 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:30,310 INFO L350 BasicCegarLoop]: trace histogram [13, 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] [2018-01-30 03:50:30,310 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1721098009, now seen corresponding path program 9 times [2018-01-30 03:50:30,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:30,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:30,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:30,310 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:30,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:30,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 6 proven. 420 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 03:50:30,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:30,521 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 03:50:30,526 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:50:30,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,542 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,545 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,547 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,572 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:30,574 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:30,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:30,597 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 12 treesize of output 11 [2018-01-30 03:50:30,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:50:30,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,810 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 26 treesize of output 31 [2018-01-30 03:50:30,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:50:30,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,879 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 39 treesize of output 58 [2018-01-30 03:50:30,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-01-30 03:50:30,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:30,975 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 52 treesize of output 93 [2018-01-30 03:50:30,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:30,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2018-01-30 03:50:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 212 proven. 86 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-01-30 03:50:31,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:31,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2018-01-30 03:50:31,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 03:50:31,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 03:50:31,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2465, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 03:50:31,847 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 53 states. [2018-01-30 03:50:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:36,169 INFO L93 Difference]: Finished difference Result 187 states and 193 transitions. [2018-01-30 03:50:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-01-30 03:50:36,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 120 [2018-01-30 03:50:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:36,171 INFO L225 Difference]: With dead ends: 187 [2018-01-30 03:50:36,171 INFO L226 Difference]: Without dead ends: 146 [2018-01-30 03:50:36,173 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4038 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1985, Invalid=12295, Unknown=0, NotChecked=0, Total=14280 [2018-01-30 03:50:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-30 03:50:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2018-01-30 03:50:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 03:50:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-01-30 03:50:36,181 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 120 [2018-01-30 03:50:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:36,182 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-01-30 03:50:36,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 03:50:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-01-30 03:50:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-30 03:50:36,183 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:36,183 INFO L350 BasicCegarLoop]: trace histogram [14, 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] [2018-01-30 03:50:36,183 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:36,183 INFO L82 PathProgramCache]: Analyzing trace with hash 811200499, now seen corresponding path program 10 times [2018-01-30 03:50:36,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:36,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:36,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:36,184 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:36,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:36,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 8 proven. 494 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-30 03:50:36,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:36,605 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 03:50:36,609 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:50:36,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:36,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-30 03:50:36,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:36,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 03:50:36,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 03:50:36,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 03:50:36,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-30 03:50:36,662 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 29 states. [2018-01-30 03:50:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:36,950 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-01-30 03:50:36,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 03:50:36,950 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 136 [2018-01-30 03:50:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:36,951 INFO L225 Difference]: With dead ends: 199 [2018-01-30 03:50:36,951 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 03:50:36,952 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 03:50:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 03:50:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-01-30 03:50:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-30 03:50:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-01-30 03:50:36,959 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 136 [2018-01-30 03:50:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:36,959 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-01-30 03:50:36,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 03:50:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-01-30 03:50:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 03:50:36,960 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:36,960 INFO L350 BasicCegarLoop]: trace histogram [15, 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] [2018-01-30 03:50:36,960 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 163667932, now seen corresponding path program 11 times [2018-01-30 03:50:36,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:36,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:36,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:36,961 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:36,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:36,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 8 proven. 574 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-30 03:50:37,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:37,229 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 03:50:37,235 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:50:37,239 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,240 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,241 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,242 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,243 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,244 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,245 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,246 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,248 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,249 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,252 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,255 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,258 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,262 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,266 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:37,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:37,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-30 03:50:37,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:37,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-01-30 03:50:37,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 03:50:37,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 03:50:37,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-01-30 03:50:37,301 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 31 states. [2018-01-30 03:50:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:37,661 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-01-30 03:50:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 03:50:37,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-01-30 03:50:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:37,662 INFO L225 Difference]: With dead ends: 205 [2018-01-30 03:50:37,662 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 03:50:37,663 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 03:50:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 03:50:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-01-30 03:50:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-30 03:50:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-01-30 03:50:37,674 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 142 [2018-01-30 03:50:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:37,674 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-01-30 03:50:37,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 03:50:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-01-30 03:50:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-30 03:50:37,674 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:37,675 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:37,675 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash -215646971, now seen corresponding path program 12 times [2018-01-30 03:50:37,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:37,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:37,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:37,676 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:37,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:37,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 8 proven. 660 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-30 03:50:38,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:38,024 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 03:50:38,029 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:50:38,034 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,035 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,036 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,037 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,039 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,045 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,047 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,049 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,055 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,058 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,060 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,061 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,063 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:50:38,064 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:38,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:38,077 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 12 treesize of output 11 [2018-01-30 03:50:38,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:50:38,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,134 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 26 treesize of output 31 [2018-01-30 03:50:38,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:50:38,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,194 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 39 treesize of output 58 [2018-01-30 03:50:38,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-01-30 03:50:38,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,279 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 52 treesize of output 93 [2018-01-30 03:50:38,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:51 [2018-01-30 03:50:38,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:38,415 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 65 treesize of output 136 [2018-01-30 03:50:38,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:38,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-30 03:50:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 360 proven. 65 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-01-30 03:50:39,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:39,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 63 [2018-01-30 03:50:39,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-30 03:50:39,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-30 03:50:39,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=3510, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 03:50:39,936 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 63 states. [2018-01-30 03:50:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:47,548 INFO L93 Difference]: Finished difference Result 225 states and 231 transitions. [2018-01-30 03:50:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-01-30 03:50:47,549 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 148 [2018-01-30 03:50:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:47,549 INFO L225 Difference]: With dead ends: 225 [2018-01-30 03:50:47,549 INFO L226 Difference]: Without dead ends: 174 [2018-01-30 03:50:47,552 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5953 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2837, Invalid=18043, Unknown=0, NotChecked=0, Total=20880 [2018-01-30 03:50:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-30 03:50:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-01-30 03:50:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-30 03:50:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-01-30 03:50:47,562 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 148 [2018-01-30 03:50:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:47,562 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-01-30 03:50:47,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-30 03:50:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-01-30 03:50:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 03:50:47,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:47,563 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:47,563 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1307699439, now seen corresponding path program 13 times [2018-01-30 03:50:47,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:47,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:47,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:47,564 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:47,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:47,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 10 proven. 752 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-01-30 03:50:48,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:48,323 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 03:50:48,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:48,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-01-30 03:50:48,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:48,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-01-30 03:50:48,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 03:50:48,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 03:50:48,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 03:50:48,379 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 35 states. [2018-01-30 03:50:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:48,797 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-01-30 03:50:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-30 03:50:48,811 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 164 [2018-01-30 03:50:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:48,812 INFO L225 Difference]: With dead ends: 237 [2018-01-30 03:50:48,812 INFO L226 Difference]: Without dead ends: 176 [2018-01-30 03:50:48,813 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-01-30 03:50:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-30 03:50:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-01-30 03:50:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 03:50:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-01-30 03:50:48,825 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 164 [2018-01-30 03:50:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:48,825 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-01-30 03:50:48,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 03:50:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-01-30 03:50:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-30 03:50:48,825 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:48,825 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:48,826 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 952106874, now seen corresponding path program 14 times [2018-01-30 03:50:48,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:48,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:48,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:48,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:50:48,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:48,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 10 proven. 850 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-01-30 03:50:49,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:49,244 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 03:50:49,248 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:50:49,257 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:49,267 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:50:49,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:49,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-01-30 03:50:49,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:49,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-01-30 03:50:49,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 03:50:49,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 03:50:49,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 03:50:49,308 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 37 states. [2018-01-30 03:50:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:50:49,767 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-01-30 03:50:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 03:50:49,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 170 [2018-01-30 03:50:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:50:49,779 INFO L225 Difference]: With dead ends: 243 [2018-01-30 03:50:49,779 INFO L226 Difference]: Without dead ends: 182 [2018-01-30 03:50:49,779 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 03:50:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-30 03:50:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2018-01-30 03:50:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-30 03:50:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-01-30 03:50:49,792 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 170 [2018-01-30 03:50:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:50:49,792 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-01-30 03:50:49,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 03:50:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-01-30 03:50:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-01-30 03:50:49,793 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:50:49,793 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:50:49,793 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:50:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1898826461, now seen corresponding path program 15 times [2018-01-30 03:50:49,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:50:49,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:50:49,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:49,794 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:50:49,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:50:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:50:49,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:50:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 10 proven. 954 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-01-30 03:50:50,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:50:50,234 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 03:50:50,239 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:50:50,244 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,245 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,249 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,254 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,256 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,258 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:50:50,259 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:50:50,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:50:50,284 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 12 treesize of output 11 [2018-01-30 03:50:50,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:50:50,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,342 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 26 treesize of output 31 [2018-01-30 03:50:50,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:50:50,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,416 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 39 treesize of output 58 [2018-01-30 03:50:50,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-01-30 03:50:50,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,507 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 52 treesize of output 93 [2018-01-30 03:50:50,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:51 [2018-01-30 03:50:50,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,621 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 65 treesize of output 136 [2018-01-30 03:50:50,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2018-01-30 03:50:50,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:50:50,803 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 78 treesize of output 187 [2018-01-30 03:50:50,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:50:50,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:80 [2018-01-30 03:50:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 500 proven. 166 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2018-01-30 03:50:52,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:50:52,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 75 [2018-01-30 03:50:52,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-01-30 03:50:52,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-01-30 03:50:52,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=4991, Unknown=0, NotChecked=0, Total=5550 [2018-01-30 03:50:52,218 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 75 states. [2018-01-30 03:50:56,260 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 116 DAG size of output 116 [2018-01-30 03:50:59,003 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 116 DAG size of output 116 [2018-01-30 03:51:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:03,052 INFO L93 Difference]: Finished difference Result 263 states and 269 transitions. [2018-01-30 03:51:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-01-30 03:51:03,052 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 176 [2018-01-30 03:51:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:03,053 INFO L225 Difference]: With dead ends: 263 [2018-01-30 03:51:03,053 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 03:51:03,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8602 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3887, Invalid=25525, Unknown=0, NotChecked=0, Total=29412 [2018-01-30 03:51:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 03:51:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2018-01-30 03:51:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 03:51:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-01-30 03:51:03,067 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 176 [2018-01-30 03:51:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:03,067 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-01-30 03:51:03,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-01-30 03:51:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-01-30 03:51:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-01-30 03:51:03,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:03,068 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:03,068 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 208591407, now seen corresponding path program 16 times [2018-01-30 03:51:03,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:03,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:03,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:03,069 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:51:03,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:03,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 12 proven. 1064 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 03:51:03,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:03,499 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 03:51:03,509 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:51:03,528 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:51:03,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 03:51:03,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:51:03,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-01-30 03:51:03,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 03:51:03,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 03:51:03,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 03:51:03,565 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 41 states. [2018-01-30 03:51:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:04,102 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2018-01-30 03:51:04,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-30 03:51:04,103 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-01-30 03:51:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:04,103 INFO L225 Difference]: With dead ends: 275 [2018-01-30 03:51:04,109 INFO L226 Difference]: Without dead ends: 204 [2018-01-30 03:51:04,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-01-30 03:51:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-30 03:51:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-01-30 03:51:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-30 03:51:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-01-30 03:51:04,122 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 192 [2018-01-30 03:51:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:04,122 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-01-30 03:51:04,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 03:51:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-01-30 03:51:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-30 03:51:04,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:04,123 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:04,123 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -394691816, now seen corresponding path program 17 times [2018-01-30 03:51:04,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:04,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:04,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:04,124 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:51:04,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:04,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 12 proven. 1180 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 03:51:04,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:04,712 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 03:51:04,717 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:51:04,722 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,723 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,724 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,725 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,726 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,727 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,728 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,729 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,731 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,735 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,738 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,740 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,743 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,748 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,754 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,759 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,765 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,777 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,790 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:04,790 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:51:04,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 03:51:04,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:51:04,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-01-30 03:51:04,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 03:51:04,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 03:51:04,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 03:51:04,830 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 43 states. [2018-01-30 03:51:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:06,453 INFO L93 Difference]: Finished difference Result 281 states and 285 transitions. [2018-01-30 03:51:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-30 03:51:06,455 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 198 [2018-01-30 03:51:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:06,455 INFO L225 Difference]: With dead ends: 281 [2018-01-30 03:51:06,456 INFO L226 Difference]: Without dead ends: 210 [2018-01-30 03:51:06,456 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-01-30 03:51:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-30 03:51:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-01-30 03:51:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-30 03:51:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2018-01-30 03:51:06,469 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 198 [2018-01-30 03:51:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:06,470 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2018-01-30 03:51:06,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 03:51:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2018-01-30 03:51:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-30 03:51:06,470 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:06,470 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:06,470 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash 530057537, now seen corresponding path program 18 times [2018-01-30 03:51:06,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:06,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:06,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:06,471 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:51:06,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:06,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 12 proven. 1302 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 03:51:07,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:07,010 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 03:51:07,015 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:51:07,021 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,025 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,026 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,028 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,029 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,031 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,033 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,034 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,036 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,038 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,040 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,043 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,046 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,048 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,051 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,053 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,056 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:51:07,057 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:51:07,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:07,082 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 12 treesize of output 11 [2018-01-30 03:51:07,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:51:07,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,133 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 26 treesize of output 31 [2018-01-30 03:51:07,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:51:07,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,213 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 39 treesize of output 58 [2018-01-30 03:51:07,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-01-30 03:51:07,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,305 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 52 treesize of output 93 [2018-01-30 03:51:07,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:51 [2018-01-30 03:51:07,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,423 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 65 treesize of output 136 [2018-01-30 03:51:07,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2018-01-30 03:51:07,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,579 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 78 treesize of output 187 [2018-01-30 03:51:07,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:77 [2018-01-30 03:51:07,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:07,812 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 91 treesize of output 246 [2018-01-30 03:51:07,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:07,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:93 [2018-01-30 03:51:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 689 proven. 215 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-01-30 03:51:10,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:51:10,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 86 [2018-01-30 03:51:10,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-01-30 03:51:10,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-01-30 03:51:10,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=6584, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 03:51:10,227 INFO L87 Difference]: Start difference. First operand 207 states and 209 transitions. Second operand 86 states. [2018-01-30 03:51:12,597 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:13,167 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 90 DAG size of output 90 [2018-01-30 03:51:13,349 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:13,791 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:14,254 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:14,748 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:15,249 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:15,768 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:16,297 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:16,843 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:17,408 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:17,998 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:18,592 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:19,203 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:19,840 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:20,488 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 133 DAG size of output 133 [2018-01-30 03:51:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:25,411 INFO L93 Difference]: Finished difference Result 301 states and 307 transitions. [2018-01-30 03:51:25,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-01-30 03:51:25,411 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 204 [2018-01-30 03:51:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:25,412 INFO L225 Difference]: With dead ends: 301 [2018-01-30 03:51:25,412 INFO L226 Difference]: Without dead ends: 230 [2018-01-30 03:51:25,413 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11520 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=5075, Invalid=33931, Unknown=0, NotChecked=0, Total=39006 [2018-01-30 03:51:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-30 03:51:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2018-01-30 03:51:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-30 03:51:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 225 transitions. [2018-01-30 03:51:25,429 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 225 transitions. Word has length 204 [2018-01-30 03:51:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:25,429 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 225 transitions. [2018-01-30 03:51:25,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-01-30 03:51:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 225 transitions. [2018-01-30 03:51:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-30 03:51:25,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:25,430 INFO L350 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:25,430 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 68417869, now seen corresponding path program 19 times [2018-01-30 03:51:25,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:25,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:25,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:25,431 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:51:25,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:25,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 14 proven. 1430 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-30 03:51:26,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:26,162 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 03:51:26,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:51:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:26,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-01-30 03:51:26,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:51:26,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-01-30 03:51:26,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 03:51:26,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 03:51:26,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 03:51:26,243 INFO L87 Difference]: Start difference. First operand 223 states and 225 transitions. Second operand 47 states. [2018-01-30 03:51:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:27,005 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2018-01-30 03:51:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-30 03:51:27,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 220 [2018-01-30 03:51:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:27,006 INFO L225 Difference]: With dead ends: 313 [2018-01-30 03:51:27,006 INFO L226 Difference]: Without dead ends: 232 [2018-01-30 03:51:27,007 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-01-30 03:51:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-30 03:51:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-01-30 03:51:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-30 03:51:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2018-01-30 03:51:27,023 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 220 [2018-01-30 03:51:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:27,023 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2018-01-30 03:51:27,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 03:51:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-01-30 03:51:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-01-30 03:51:27,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:27,024 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:27,024 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1436914358, now seen corresponding path program 20 times [2018-01-30 03:51:27,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:27,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:27,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:27,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:51:27,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:27,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 14 proven. 1564 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-30 03:51:27,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:27,747 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 03:51:27,752 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:51:27,758 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:27,771 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:51:27,773 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:51:27,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-01-30 03:51:27,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:51:27,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-01-30 03:51:27,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-30 03:51:27,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-30 03:51:27,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 03:51:27,825 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 49 states. [2018-01-30 03:51:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:51:29,201 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2018-01-30 03:51:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-30 03:51:29,202 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 226 [2018-01-30 03:51:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:51:29,203 INFO L225 Difference]: With dead ends: 319 [2018-01-30 03:51:29,203 INFO L226 Difference]: Without dead ends: 238 [2018-01-30 03:51:29,203 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-01-30 03:51:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-30 03:51:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2018-01-30 03:51:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-30 03:51:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-01-30 03:51:29,219 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 226 [2018-01-30 03:51:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:51:29,220 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-01-30 03:51:29,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-30 03:51:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-01-30 03:51:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-01-30 03:51:29,220 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:51:29,221 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:51:29,221 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:51:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1035028129, now seen corresponding path program 21 times [2018-01-30 03:51:29,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:51:29,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:51:29,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:29,221 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:51:29,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:51:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:51:29,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:51:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 14 proven. 1704 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-30 03:51:30,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:51:30,213 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 03:51:30,224 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:51:30,230 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,236 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,237 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,240 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,242 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,244 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,253 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,255 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,258 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:51:30,259 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:51:30,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:51:30,272 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 12 treesize of output 11 [2018-01-30 03:51:30,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:51:30,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,335 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 26 treesize of output 31 [2018-01-30 03:51:30,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:51:30,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,414 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 39 treesize of output 58 [2018-01-30 03:51:30,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2018-01-30 03:51:30,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,513 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 52 treesize of output 93 [2018-01-30 03:51:30,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:51 [2018-01-30 03:51:30,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,638 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 65 treesize of output 136 [2018-01-30 03:51:30,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2018-01-30 03:51:30,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,795 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 78 treesize of output 187 [2018-01-30 03:51:30,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:30,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:77 [2018-01-30 03:51:30,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:30,990 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 91 treesize of output 246 [2018-01-30 03:51:30,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:31,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:31,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:90 [2018-01-30 03:51:31,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:51:31,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 313 [2018-01-30 03:51:31,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:51:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:51:31,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:106 Received shutdown request... [2018-01-30 03:51:32,845 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 03:51:32,845 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 03:51:32,848 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 03:51:32,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:51:32 BasicIcfg [2018-01-30 03:51:32,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 03:51:32,848 INFO L168 Benchmark]: Toolchain (without parser) took 74420.15 ms. Allocated memory was 151.5 MB in the beginning and 558.4 MB in the end (delta: 406.8 MB). Free memory was 116.5 MB in the beginning and 220.2 MB in the end (delta: -103.7 MB). Peak memory consumption was 303.1 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,849 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 03:51:32,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 104.07 ms. Allocated memory is still 151.5 MB. Free memory was 116.3 MB in the beginning and 108.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,849 INFO L168 Benchmark]: Boogie Preprocessor took 17.01 ms. Allocated memory is still 151.5 MB. Free memory was 108.5 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,850 INFO L168 Benchmark]: RCFGBuilder took 209.93 ms. Allocated memory is still 151.5 MB. Free memory was 106.7 MB in the beginning and 95.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,850 INFO L168 Benchmark]: IcfgTransformer took 16.31 ms. Allocated memory is still 151.5 MB. Free memory was 95.6 MB in the beginning and 94.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,850 INFO L168 Benchmark]: TraceAbstraction took 74070.40 ms. Allocated memory was 151.5 MB in the beginning and 558.4 MB in the end (delta: 406.8 MB). Free memory was 94.1 MB in the beginning and 220.2 MB in the end (delta: -126.2 MB). Peak memory consumption was 280.7 MB. Max. memory is 5.3 GB. [2018-01-30 03:51:32,851 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 151.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 104.07 ms. Allocated memory is still 151.5 MB. Free memory was 116.3 MB in the beginning and 108.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.01 ms. Allocated memory is still 151.5 MB. Free memory was 108.5 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.93 ms. Allocated memory is still 151.5 MB. Free memory was 106.7 MB in the beginning and 95.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * IcfgTransformer took 16.31 ms. Allocated memory is still 151.5 MB. Free memory was 95.6 MB in the beginning and 94.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74070.40 ms. Allocated memory was 151.5 MB in the beginning and 558.4 MB in the end (delta: 406.8 MB). Free memory was 94.1 MB in the beginning and 220.2 MB in the end (delta: -126.2 MB). Peak memory consumption was 280.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 233 with TraceHistMax 25, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 74.0s OverallTime, 26 OverallIterations, 25 TraceHistogramMax, 50.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 719 SDtfs, 2581 SDslu, 16439 SDs, 0 SdLazy, 13134 SolverSat, 1553 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4294 GetRequests, 2685 SyntacticMatches, 6 SemanticMatches, 1603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42602 ImplicationChecksByTransitivity, 51.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 98 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 5715 NumberOfCodeBlocks, 5517 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 5667 ConstructedInterpolants, 189 QuantifiedInterpolants, 4740940 SizeOfPredicates, 531 NumberOfNonLiveVariables, 3889 ConjunctsInSsa, 738 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 6845/29102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_reverse_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_03-51-32-855.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_reverse_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_03-51-32-855.csv Completed graceful shutdown