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_copy3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 03:16:50,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 03:16:50,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 03:16:50,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 03:16:50,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 03:16:50,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 03:16:50,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 03:16:50,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 03:16:50,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 03:16:50,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 03:16:50,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 03:16:50,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 03:16:50,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 03:16:50,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 03:16:50,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 03:16:50,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 03:16:50,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 03:16:50,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 03:16:50,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 03:16:50,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 03:16:50,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 03:16:50,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 03:16:50,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 03:16:50,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 03:16:50,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 03:16:50,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 03:16:50,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 03:16:50,424 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 03:16:50,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 03:16:50,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 03:16:50,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 03:16:50,426 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:16:50,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 03:16:50,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 03:16:50,431 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 03:16:50,431 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 03:16:50,431 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 03:16:50,431 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 03:16:50,431 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 03:16:50,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 03:16:50,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 03:16:50,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 03:16:50,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 03:16:50,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 03:16:50,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 03:16:50,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 03:16:50,434 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 03:16:50,434 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 03:16:50,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 03:16:50,459 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 03:16:50,461 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 03:16:50,462 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 03:16:50,462 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 03:16:50,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_true-unreach-call_ground.i [2018-01-30 03:16:50,524 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 03:16:50,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 03:16:50,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 03:16:50,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 03:16:50,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 03:16:50,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e59db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50, skipping insertion in model container [2018-01-30 03:16:50,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,541 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:16:50,550 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 03:16:50,629 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:16:50,639 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 03:16:50,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50 WrapperNode [2018-01-30 03:16:50,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 03:16:50,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 03:16:50,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 03:16:50,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 03:16:50,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (1/1) ... [2018-01-30 03:16:50,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 03:16:50,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 03:16:50,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 03:16:50,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 03:16:50,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (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:16:50,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 03:16:50,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 03:16:50,702 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 03:16:50,702 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 03:16:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 03:16:51,013 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 03:16:51,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:16:51 BoogieIcfgContainer [2018-01-30 03:16:51,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 03:16:51,014 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 03:16:51,014 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 03:16:51,014 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 03:16:51,016 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:16:51" (1/1) ... [2018-01-30 03:16:51,018 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 03:16:51,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:16:51 BasicIcfg [2018-01-30 03:16:51,026 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 03:16:51,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 03:16:51,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 03:16:51,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 03:16:51,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 03:16:50" (1/4) ... [2018-01-30 03:16:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ed43c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:16:51, skipping insertion in model container [2018-01-30 03:16:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 03:16:50" (2/4) ... [2018-01-30 03:16:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ed43c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 03:16:51, skipping insertion in model container [2018-01-30 03:16:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 03:16:51" (3/4) ... [2018-01-30 03:16:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ed43c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:16:51, skipping insertion in model container [2018-01-30 03:16:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 03:16:51" (4/4) ... [2018-01-30 03:16:51,030 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_copy3_true-unreach-call_ground.ileft_unchanged_by_heapseparator [2018-01-30 03:16:51,035 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 03:16:51,040 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 03:16:51,063 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 03:16:51,063 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 03:16:51,063 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 03:16:51,063 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 03:16:51,063 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 03:16:51,063 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 03:16:51,063 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 03:16:51,064 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 03:16:51,064 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 03:16:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-30 03:16:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 03:16:51,077 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:51,077 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:51,077 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1520681025, now seen corresponding path program 1 times [2018-01-30 03:16:51,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:51,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:51,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:51,148 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:16:51,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:16:51,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 03:16:51,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 03:16:51,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 03:16:51,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 03:16:51,159 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-30 03:16:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:51,173 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2018-01-30 03:16:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 03:16:51,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-30 03:16:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:51,180 INFO L225 Difference]: With dead ends: 100 [2018-01-30 03:16:51,180 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 03:16:51,182 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:16:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 03:16:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-30 03:16:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 03:16:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-30 03:16:51,203 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2018-01-30 03:16:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:51,203 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-30 03:16:51,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 03:16:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-30 03:16:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 03:16:51,204 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:51,204 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:51,204 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash -685660446, now seen corresponding path program 1 times [2018-01-30 03:16:51,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:51,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:51,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:51,302 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:16:51,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:16:51,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:16:51,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:16:51,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:16:51,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:16:51,304 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 3 states. [2018-01-30 03:16:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:51,350 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-01-30 03:16:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:16:51,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-30 03:16:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:51,351 INFO L225 Difference]: With dead ends: 97 [2018-01-30 03:16:51,351 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 03:16:51,351 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:16:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 03:16:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-30 03:16:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 03:16:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-30 03:16:51,355 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 30 [2018-01-30 03:16:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:51,356 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-30 03:16:51,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:16:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-30 03:16:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 03:16:51,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:51,357 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:51,357 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 340789200, now seen corresponding path program 1 times [2018-01-30 03:16:51,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:51,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:51,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 03:16:51,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 03:16:51,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 03:16:51,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 03:16:51,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 03:16:51,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 03:16:51,397 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-01-30 03:16:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:51,541 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-01-30 03:16:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 03:16:51,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-30 03:16:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:51,542 INFO L225 Difference]: With dead ends: 99 [2018-01-30 03:16:51,542 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 03:16:51,542 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:16:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 03:16:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-01-30 03:16:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 03:16:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-30 03:16:51,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 38 [2018-01-30 03:16:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:51,546 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-30 03:16:51,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 03:16:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-30 03:16:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 03:16:51,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:51,547 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:51,547 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -961037636, now seen corresponding path program 1 times [2018-01-30 03:16:51,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:51,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:51,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 03:16:51,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:51,658 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:16:51,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 03:16:51,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:51,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 03:16:51,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 03:16:51,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 03:16:51,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 03:16:51,728 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 5 states. [2018-01-30 03:16:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:51,883 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-01-30 03:16:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 03:16:51,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-30 03:16:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:51,884 INFO L225 Difference]: With dead ends: 117 [2018-01-30 03:16:51,884 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 03:16:51,884 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:16:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 03:16:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-30 03:16:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 03:16:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-30 03:16:51,888 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 56 [2018-01-30 03:16:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:51,888 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-30 03:16:51,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 03:16:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-30 03:16:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 03:16:51,889 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:51,889 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:51,889 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1980476970, now seen corresponding path program 2 times [2018-01-30 03:16:51,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:51,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:51,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:51,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:51,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 03:16:51,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:51,975 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:16:51,993 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:16:52,002 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:52,019 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:52,020 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:52,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 03:16:52,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:52,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-30 03:16:52,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 03:16:52,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 03:16:52,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:16:52,162 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 10 states. [2018-01-30 03:16:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:52,536 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-30 03:16:52,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 03:16:52,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-30 03:16:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:52,537 INFO L225 Difference]: With dead ends: 140 [2018-01-30 03:16:52,537 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 03:16:52,538 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-30 03:16:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 03:16:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2018-01-30 03:16:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 03:16:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-30 03:16:52,545 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 64 [2018-01-30 03:16:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:52,545 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-30 03:16:52,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 03:16:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-30 03:16:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-30 03:16:52,546 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:52,546 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:52,546 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash 72801540, now seen corresponding path program 3 times [2018-01-30 03:16:52,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:52,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:52,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:52,547 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:52,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:52,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 03:16:52,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:52,595 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:16:52,600 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:16:52,605 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:16:52,614 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:16:52,614 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:52,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 03:16:52,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:52,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-30 03:16:52,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 03:16:52,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 03:16:52,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 03:16:52,642 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-30 03:16:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:52,772 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-01-30 03:16:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 03:16:52,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-01-30 03:16:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:52,775 INFO L225 Difference]: With dead ends: 125 [2018-01-30 03:16:52,776 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 03:16:52,776 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-30 03:16:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 03:16:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-01-30 03:16:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 03:16:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-30 03:16:52,780 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 78 [2018-01-30 03:16:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:52,780 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-30 03:16:52,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 03:16:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-30 03:16:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-30 03:16:52,781 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:52,781 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:52,781 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -411061116, now seen corresponding path program 4 times [2018-01-30 03:16:52,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:52,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:52,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:52,782 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:52,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:52,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-30 03:16:52,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:52,921 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:16:52,926 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:16:52,948 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:52,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:53,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:53,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:16:53,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 03:16:53,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-30 03:16:53,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:53,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-01-30 03:16:53,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 03:16:53,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2018-01-30 03:16:53,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 03:16:53,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 03:16:53,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-01-30 03:16:53,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:53,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:16:53,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:16:53,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:16:53,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:16:53,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-30 03:16:53,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:53,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2018-01-30 03:16:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-30 03:16:53,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:53,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 25 [2018-01-30 03:16:53,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 03:16:53,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 03:16:53,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-01-30 03:16:53,790 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 25 states. [2018-01-30 03:16:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:54,282 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2018-01-30 03:16:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 03:16:54,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-01-30 03:16:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:54,283 INFO L225 Difference]: With dead ends: 181 [2018-01-30 03:16:54,283 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 03:16:54,284 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=1436, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 03:16:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 03:16:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-01-30 03:16:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 03:16:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-01-30 03:16:54,289 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 90 [2018-01-30 03:16:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:54,289 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-01-30 03:16:54,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 03:16:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-01-30 03:16:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 03:16:54,290 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:54,290 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:54,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -559764715, now seen corresponding path program 1 times [2018-01-30 03:16:54,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:54,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:54,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:54,291 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:54,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:54,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 03:16:54,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:54,413 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:54,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:54,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-30 03:16:54,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:54,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-01-30 03:16:54,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 03:16:54,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 03:16:54,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-01-30 03:16:54,527 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 16 states. [2018-01-30 03:16:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:54,726 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2018-01-30 03:16:54,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 03:16:54,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-01-30 03:16:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:54,731 INFO L225 Difference]: With dead ends: 200 [2018-01-30 03:16:54,731 INFO L226 Difference]: Without dead ends: 133 [2018-01-30 03:16:54,731 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-01-30 03:16:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-30 03:16:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-01-30 03:16:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-30 03:16:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-01-30 03:16:54,737 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 108 [2018-01-30 03:16:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:54,738 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-01-30 03:16:54,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 03:16:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-01-30 03:16:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-30 03:16:54,740 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:54,740 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:54,740 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1755216049, now seen corresponding path program 2 times [2018-01-30 03:16:54,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:54,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:54,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:54,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:54,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:54,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-01-30 03:16:54,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:54,816 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:16:54,822 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:16:54,839 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:54,858 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:54,868 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:54,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-01-30 03:16:55,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:55,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-01-30 03:16:55,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 03:16:55,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 03:16:55,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-01-30 03:16:55,165 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 18 states. [2018-01-30 03:16:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:55,338 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2018-01-30 03:16:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 03:16:55,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2018-01-30 03:16:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:55,340 INFO L225 Difference]: With dead ends: 220 [2018-01-30 03:16:55,340 INFO L226 Difference]: Without dead ends: 147 [2018-01-30 03:16:55,341 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-01-30 03:16:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-30 03:16:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2018-01-30 03:16:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-30 03:16:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2018-01-30 03:16:55,346 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 122 [2018-01-30 03:16:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:55,346 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2018-01-30 03:16:55,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 03:16:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2018-01-30 03:16:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-30 03:16:55,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:55,347 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:55,347 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1775167959, now seen corresponding path program 3 times [2018-01-30 03:16:55,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:55,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:55,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:55,348 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:55,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:55,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-01-30 03:16:55,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:55,566 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:16:55,573 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:16:55,579 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:16:55,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:16:55,596 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:16:55,597 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:55,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-01-30 03:16:55,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:55,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 03:16:55,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 03:16:55,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 03:16:55,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 03:16:55,623 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand 7 states. [2018-01-30 03:16:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:55,682 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2018-01-30 03:16:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 03:16:55,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2018-01-30 03:16:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:55,683 INFO L225 Difference]: With dead ends: 190 [2018-01-30 03:16:55,683 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 03:16:55,684 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 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:16:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 03:16:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-01-30 03:16:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-30 03:16:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 150 transitions. [2018-01-30 03:16:55,689 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 150 transitions. Word has length 136 [2018-01-30 03:16:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:55,690 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 150 transitions. [2018-01-30 03:16:55,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 03:16:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2018-01-30 03:16:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 03:16:55,691 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:55,691 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:55,691 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1174464093, now seen corresponding path program 4 times [2018-01-30 03:16:55,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:55,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:55,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:55,692 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:55,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:55,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-01-30 03:16:55,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:55,797 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:16:55,802 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:16:55,822 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:55,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:55,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:55,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:55,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:55,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:16:55,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:16:55,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:16:55,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:55,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:16:55,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 03:16:55,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:55,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:55,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:16:55,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-30 03:16:56,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 03:16:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:16:56,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2018-01-30 03:16:56,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 03:16:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 03:16:56,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-30 03:16:56,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:16:56,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:16:56,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 03:16:56,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-01-30 03:16:56,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:16:56,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-01-30 03:16:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-30 03:16:56,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:56,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 31] total 38 [2018-01-30 03:16:56,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-30 03:16:56,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-30 03:16:56,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 03:16:56,605 INFO L87 Difference]: Start difference. First operand 145 states and 150 transitions. Second operand 38 states. [2018-01-30 03:16:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:57,909 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-01-30 03:16:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 03:16:57,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 142 [2018-01-30 03:16:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:57,913 INFO L225 Difference]: With dead ends: 193 [2018-01-30 03:16:57,913 INFO L226 Difference]: Without dead ends: 172 [2018-01-30 03:16:57,913 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=513, Invalid=4179, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 03:16:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-30 03:16:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2018-01-30 03:16:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 03:16:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2018-01-30 03:16:57,930 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 142 [2018-01-30 03:16:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:57,930 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2018-01-30 03:16:57,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-30 03:16:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2018-01-30 03:16:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-30 03:16:57,931 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:57,931 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:57,931 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1005667468, now seen corresponding path program 5 times [2018-01-30 03:16:57,931 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:57,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:57,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:57,932 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:57,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:57,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-01-30 03:16:58,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:58,072 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:16:58,077 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:16:58,082 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,083 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,096 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,103 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,116 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,121 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:58,135 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:58,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-01-30 03:16:58,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:58,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 03:16:58,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 03:16:58,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 03:16:58,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 03:16:58,163 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 9 states. [2018-01-30 03:16:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:58,266 INFO L93 Difference]: Finished difference Result 249 states and 258 transitions. [2018-01-30 03:16:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 03:16:58,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2018-01-30 03:16:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:58,267 INFO L225 Difference]: With dead ends: 249 [2018-01-30 03:16:58,267 INFO L226 Difference]: Without dead ends: 170 [2018-01-30 03:16:58,268 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 03:16:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-30 03:16:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-01-30 03:16:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-30 03:16:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 172 transitions. [2018-01-30 03:16:58,272 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 172 transitions. Word has length 158 [2018-01-30 03:16:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:58,272 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 172 transitions. [2018-01-30 03:16:58,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 03:16:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 172 transitions. [2018-01-30 03:16:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 03:16:58,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:58,273 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:58,273 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1002969464, now seen corresponding path program 6 times [2018-01-30 03:16:58,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:58,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:58,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:58,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:58,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:58,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-01-30 03:16:58,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:58,357 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:16:58,361 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:16:58,367 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,368 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,373 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,387 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,399 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,406 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:16:58,407 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:58,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-01-30 03:16:58,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:58,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 03:16:58,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 03:16:58,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 03:16:58,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:16:58,436 INFO L87 Difference]: Start difference. First operand 167 states and 172 transitions. Second operand 11 states. [2018-01-30 03:16:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:58,560 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2018-01-30 03:16:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 03:16:58,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2018-01-30 03:16:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:58,561 INFO L225 Difference]: With dead ends: 255 [2018-01-30 03:16:58,561 INFO L226 Difference]: Without dead ends: 176 [2018-01-30 03:16:58,561 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:16:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-30 03:16:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-01-30 03:16:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 03:16:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2018-01-30 03:16:58,565 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 164 [2018-01-30 03:16:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:58,565 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2018-01-30 03:16:58,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 03:16:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2018-01-30 03:16:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-30 03:16:58,566 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:58,566 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:58,567 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -261190300, now seen corresponding path program 7 times [2018-01-30 03:16:58,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:58,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:58,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:58,567 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:58,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:58,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-01-30 03:16:58,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:58,746 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:16:58,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:58,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-01-30 03:16:58,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:58,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-01-30 03:16:58,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 03:16:58,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 03:16:58,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-01-30 03:16:58,884 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand 26 states. [2018-01-30 03:16:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:59,236 INFO L93 Difference]: Finished difference Result 308 states and 319 transitions. [2018-01-30 03:16:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 03:16:59,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 170 [2018-01-30 03:16:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:59,237 INFO L225 Difference]: With dead ends: 308 [2018-01-30 03:16:59,237 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 03:16:59,238 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1836, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 03:16:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 03:16:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2018-01-30 03:16:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 03:16:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-01-30 03:16:59,242 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 170 [2018-01-30 03:16:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:59,242 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-01-30 03:16:59,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 03:16:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-01-30 03:16:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 03:16:59,243 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:59,243 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:59,243 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1865007550, now seen corresponding path program 8 times [2018-01-30 03:16:59,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:59,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:59,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:59,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:16:59,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:59,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:16:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-01-30 03:16:59,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:16:59,527 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:16:59,536 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:16:59,543 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:59,554 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:16:59,556 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:16:59,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:16:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-30 03:16:59,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:16:59,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 24 [2018-01-30 03:16:59,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 03:16:59,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 03:16:59,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-01-30 03:16:59,722 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 24 states. [2018-01-30 03:16:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:16:59,966 INFO L93 Difference]: Finished difference Result 328 states and 339 transitions. [2018-01-30 03:16:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 03:16:59,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 184 [2018-01-30 03:16:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:16:59,970 INFO L225 Difference]: With dead ends: 328 [2018-01-30 03:16:59,970 INFO L226 Difference]: Without dead ends: 209 [2018-01-30 03:16:59,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2018-01-30 03:16:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-30 03:16:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2018-01-30 03:16:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-30 03:16:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 206 transitions. [2018-01-30 03:16:59,975 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 206 transitions. Word has length 184 [2018-01-30 03:16:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:16:59,975 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 206 transitions. [2018-01-30 03:16:59,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 03:16:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 206 transitions. [2018-01-30 03:16:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-30 03:16:59,976 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:16:59,976 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:16:59,976 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:16:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 695783008, now seen corresponding path program 9 times [2018-01-30 03:16:59,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:16:59,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:16:59,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:59,977 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:16:59,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:16:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:16:59,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-01-30 03:17:00,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:00,149 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:17:00,154 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:17:00,164 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:00,166 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:00,170 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:00,174 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:00,178 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:00,178 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:00,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-01-30 03:17:00,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:00,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2018-01-30 03:17:00,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 03:17:00,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 03:17:00,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:17:00,240 INFO L87 Difference]: Start difference. First operand 201 states and 206 transitions. Second operand 19 states. [2018-01-30 03:17:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:00,466 INFO L93 Difference]: Finished difference Result 304 states and 314 transitions. [2018-01-30 03:17:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 03:17:00,467 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 198 [2018-01-30 03:17:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:00,467 INFO L225 Difference]: With dead ends: 304 [2018-01-30 03:17:00,467 INFO L226 Difference]: Without dead ends: 219 [2018-01-30 03:17:00,468 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=361, Invalid=1121, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 03:17:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-30 03:17:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2018-01-30 03:17:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-30 03:17:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2018-01-30 03:17:00,473 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 198 [2018-01-30 03:17:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:00,473 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2018-01-30 03:17:00,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 03:17:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2018-01-30 03:17:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-01-30 03:17:00,474 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:00,474 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:00,474 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1289749864, now seen corresponding path program 10 times [2018-01-30 03:17:00,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:00,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:00,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:00,475 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:00,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:00,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-01-30 03:17:00,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:00,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 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:17:00,610 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:17:00,628 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:00,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:00,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:00,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:17:00,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:00,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:17:00,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:00,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:17:00,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 03:17:00,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 03:17:00,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:00,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 64 [2018-01-30 03:17:00,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:00,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:00,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:44 [2018-01-30 03:17:03,697 WARN L143 SmtUtils]: Spent 306ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 03:17:03,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:03,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:03,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:03,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:54 [2018-01-30 03:17:04,373 WARN L143 SmtUtils]: Spent 490ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 03:17:04,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 03:17:04,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-01-30 03:17:04,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:15 [2018-01-30 03:17:04,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:04,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:17:04,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:04,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 03:17:04,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 03:17:04,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-30 03:17:04,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:04,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-01-30 03:17:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 8 proven. 265 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-01-30 03:17:05,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:05,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 51] total 62 [2018-01-30 03:17:05,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-30 03:17:05,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-30 03:17:05,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3492, Unknown=1, NotChecked=0, Total=3782 [2018-01-30 03:17:05,159 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand 62 states. [2018-01-30 03:17:08,147 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 03:17:08,901 WARN L143 SmtUtils]: Spent 534ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 03:17:09,295 WARN L143 SmtUtils]: Spent 281ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-30 03:17:10,199 WARN L146 SmtUtils]: Spent 755ms on a formula simplification. DAG size of input: 42 DAG size of output 40 [2018-01-30 03:17:11,632 WARN L146 SmtUtils]: Spent 1248ms on a formula simplification. DAG size of input: 46 DAG size of output 42 [2018-01-30 03:17:13,015 WARN L146 SmtUtils]: Spent 1365ms on a formula simplification. DAG size of input: 41 DAG size of output 40 [2018-01-30 03:17:13,873 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 44 DAG size of output 43 [2018-01-30 03:17:16,218 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-30 03:17:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:16,897 INFO L93 Difference]: Finished difference Result 271 states and 280 transitions. [2018-01-30 03:17:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-01-30 03:17:16,897 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 210 [2018-01-30 03:17:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:16,898 INFO L225 Difference]: With dead ends: 271 [2018-01-30 03:17:16,898 INFO L226 Difference]: Without dead ends: 240 [2018-01-30 03:17:16,900 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4328 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=926, Invalid=12645, Unknown=1, NotChecked=0, Total=13572 [2018-01-30 03:17:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-30 03:17:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2018-01-30 03:17:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-30 03:17:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 234 transitions. [2018-01-30 03:17:16,905 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 234 transitions. Word has length 210 [2018-01-30 03:17:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:16,905 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 234 transitions. [2018-01-30 03:17:16,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-30 03:17:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 234 transitions. [2018-01-30 03:17:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-01-30 03:17:16,906 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:16,906 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:16,906 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1619658233, now seen corresponding path program 11 times [2018-01-30 03:17:16,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:16,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:16,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:16,907 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:16,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:16,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-01-30 03:17:17,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:17,430 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:17,434 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:17:17,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,441 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,442 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,444 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,447 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,450 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,454 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,458 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,465 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:17,466 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:17,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-01-30 03:17:17,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:17,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-01-30 03:17:17,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 03:17:17,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 03:17:17,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2018-01-30 03:17:17,627 INFO L87 Difference]: Start difference. First operand 229 states and 234 transitions. Second operand 32 states. [2018-01-30 03:17:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:17,961 INFO L93 Difference]: Finished difference Result 404 states and 415 transitions. [2018-01-30 03:17:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-30 03:17:17,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 226 [2018-01-30 03:17:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:17,962 INFO L225 Difference]: With dead ends: 404 [2018-01-30 03:17:17,962 INFO L226 Difference]: Without dead ends: 251 [2018-01-30 03:17:17,963 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=645, Invalid=2895, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 03:17:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-30 03:17:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2018-01-30 03:17:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 03:17:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 248 transitions. [2018-01-30 03:17:17,968 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 248 transitions. Word has length 226 [2018-01-30 03:17:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:17,969 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 248 transitions. [2018-01-30 03:17:17,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 03:17:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 248 transitions. [2018-01-30 03:17:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 03:17:17,969 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:17,970 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:17,970 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1669961535, now seen corresponding path program 12 times [2018-01-30 03:17:17,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:17,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:17,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:17,970 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:17,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:17,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-01-30 03:17:18,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:18,177 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:17:18,182 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:17:18,189 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,190 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,193 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,195 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,199 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,203 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,206 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,209 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,214 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:18,214 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:18,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-01-30 03:17:18,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:18,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 03:17:18,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 03:17:18,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 03:17:18,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 03:17:18,254 INFO L87 Difference]: Start difference. First operand 243 states and 248 transitions. Second operand 11 states. [2018-01-30 03:17:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:18,420 INFO L93 Difference]: Finished difference Result 338 states and 346 transitions. [2018-01-30 03:17:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 03:17:18,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-01-30 03:17:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:18,420 INFO L225 Difference]: With dead ends: 338 [2018-01-30 03:17:18,421 INFO L226 Difference]: Without dead ends: 252 [2018-01-30 03:17:18,421 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 241 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:17:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-30 03:17:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2018-01-30 03:17:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-30 03:17:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2018-01-30 03:17:18,426 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 254 transitions. Word has length 240 [2018-01-30 03:17:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:18,427 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 254 transitions. [2018-01-30 03:17:18,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 03:17:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 254 transitions. [2018-01-30 03:17:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-30 03:17:18,427 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:18,427 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:18,427 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:18,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1159517835, now seen corresponding path program 13 times [2018-01-30 03:17:18,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:18,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:18,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:18,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:18,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:18,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 6 proven. 140 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-01-30 03:17:18,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:18,622 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:18,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:18,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-01-30 03:17:18,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:18,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2018-01-30 03:17:18,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 03:17:18,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 03:17:18,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 03:17:18,858 INFO L87 Difference]: Start difference. First operand 249 states and 254 transitions. Second operand 36 states. [2018-01-30 03:17:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:19,315 INFO L93 Difference]: Finished difference Result 436 states and 447 transitions. [2018-01-30 03:17:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-30 03:17:19,315 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 246 [2018-01-30 03:17:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:19,316 INFO L225 Difference]: With dead ends: 436 [2018-01-30 03:17:19,316 INFO L226 Difference]: Without dead ends: 271 [2018-01-30 03:17:19,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=815, Invalid=3741, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 03:17:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-30 03:17:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2018-01-30 03:17:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-01-30 03:17:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 268 transitions. [2018-01-30 03:17:19,323 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 268 transitions. Word has length 246 [2018-01-30 03:17:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:19,323 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 268 transitions. [2018-01-30 03:17:19,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 03:17:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 268 transitions. [2018-01-30 03:17:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-01-30 03:17:19,324 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:19,324 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:19,324 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 737319759, now seen corresponding path program 14 times [2018-01-30 03:17:19,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:19,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:19,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:19,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:19,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:19,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 6 proven. 380 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-01-30 03:17:19,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:19,678 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:17:19,683 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:17:19,690 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:19,708 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:19,710 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:19,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-01-30 03:17:19,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:19,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 03:17:19,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 03:17:19,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 03:17:19,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-30 03:17:19,753 INFO L87 Difference]: Start difference. First operand 263 states and 268 transitions. Second operand 23 states. [2018-01-30 03:17:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:20,701 INFO L93 Difference]: Finished difference Result 447 states and 457 transitions. [2018-01-30 03:17:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 03:17:20,702 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 260 [2018-01-30 03:17:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:20,702 INFO L225 Difference]: With dead ends: 447 [2018-01-30 03:17:20,702 INFO L226 Difference]: Without dead ends: 276 [2018-01-30 03:17:20,703 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 03:17:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-30 03:17:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2018-01-30 03:17:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-30 03:17:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 276 transitions. [2018-01-30 03:17:20,709 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 276 transitions. Word has length 260 [2018-01-30 03:17:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:20,709 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 276 transitions. [2018-01-30 03:17:20,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 03:17:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 276 transitions. [2018-01-30 03:17:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-01-30 03:17:20,710 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:20,710 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:20,710 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:20,710 INFO L82 PathProgramCache]: Analyzing trace with hash 717195709, now seen corresponding path program 15 times [2018-01-30 03:17:20,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:20,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:20,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:20,711 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:20,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:20,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 6 proven. 70 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-01-30 03:17:21,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:21,106 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:17:21,110 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:17:21,117 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,122 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,125 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,130 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,133 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,137 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:21,137 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:21,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 126 proven. 70 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-01-30 03:17:21,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:21,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 19 [2018-01-30 03:17:21,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 03:17:21,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 03:17:21,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:17:21,224 INFO L87 Difference]: Start difference. First operand 271 states and 276 transitions. Second operand 19 states. [2018-01-30 03:17:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:21,495 INFO L93 Difference]: Finished difference Result 366 states and 374 transitions. [2018-01-30 03:17:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 03:17:21,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 268 [2018-01-30 03:17:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:21,508 INFO L225 Difference]: With dead ends: 366 [2018-01-30 03:17:21,508 INFO L226 Difference]: Without dead ends: 280 [2018-01-30 03:17:21,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 03:17:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-30 03:17:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-01-30 03:17:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-30 03:17:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 282 transitions. [2018-01-30 03:17:21,515 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 282 transitions. Word has length 268 [2018-01-30 03:17:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:21,515 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 282 transitions. [2018-01-30 03:17:21,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 03:17:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 282 transitions. [2018-01-30 03:17:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-30 03:17:21,516 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:21,516 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:21,516 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:21,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2005492367, now seen corresponding path program 16 times [2018-01-30 03:17:21,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:21,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:21,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:21,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:21,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:21,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-01-30 03:17:22,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:22,062 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:17:22,067 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:17:22,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:22,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:22,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:22,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:17:22,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:22,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:17:22,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:17:22,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 03:17:22,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 03:17:22,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:22,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 64 [2018-01-30 03:17:22,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:22,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:44 [2018-01-30 03:17:22,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:22,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:22,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:22,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:54 [2018-01-30 03:17:23,724 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 03:17:23,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:23,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:23,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:23,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:23,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:61 [2018-01-30 03:17:24,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-30 03:17:24,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:24,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:24,927 INFO L303 Elim1Store]: Index analysis took 318 ms [2018-01-30 03:17:24,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-01-30 03:17:24,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:22 [2018-01-30 03:17:25,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:25,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 03:17:25,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:25,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:25,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 03:17:25,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:25,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:25,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:25,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:25,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 03:17:26,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-01-30 03:17:26,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:26,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2018-01-30 03:17:26,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:26,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:26,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:22 [2018-01-30 03:17:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 10 proven. 455 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-01-30 03:17:26,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:26,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 65] total 78 [2018-01-30 03:17:26,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-30 03:17:26,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-30 03:17:26,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5619, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 03:17:26,715 INFO L87 Difference]: Start difference. First operand 277 states and 282 transitions. Second operand 78 states. [2018-01-30 03:17:30,487 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 56 DAG size of output 53 [2018-01-30 03:17:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:31,234 INFO L93 Difference]: Finished difference Result 390 states and 400 transitions. [2018-01-30 03:17:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-01-30 03:17:31,234 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 274 [2018-01-30 03:17:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:31,235 INFO L225 Difference]: With dead ends: 390 [2018-01-30 03:17:31,235 INFO L226 Difference]: Without dead ends: 304 [2018-01-30 03:17:31,238 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7387 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1252, Invalid=20800, Unknown=0, NotChecked=0, Total=22052 [2018-01-30 03:17:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-30 03:17:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 293. [2018-01-30 03:17:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-30 03:17:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 298 transitions. [2018-01-30 03:17:31,246 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 298 transitions. Word has length 274 [2018-01-30 03:17:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:31,246 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 298 transitions. [2018-01-30 03:17:31,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-30 03:17:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 298 transitions. [2018-01-30 03:17:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-01-30 03:17:31,247 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:31,247 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:31,247 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2011903240, now seen corresponding path program 17 times [2018-01-30 03:17:31,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:31,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:31,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:31,248 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:31,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:31,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2018-01-30 03:17:31,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:31,744 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:17:31,749 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:17:31,755 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,758 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,759 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,762 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,765 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,767 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,771 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,775 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,780 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,786 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,797 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:31,798 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:31,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2018-01-30 03:17:32,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:32,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-01-30 03:17:32,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 03:17:32,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 03:17:32,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-01-30 03:17:32,716 INFO L87 Difference]: Start difference. First operand 293 states and 298 transitions. Second operand 24 states. [2018-01-30 03:17:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:33,001 INFO L93 Difference]: Finished difference Result 407 states and 416 transitions. [2018-01-30 03:17:33,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-30 03:17:33,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 290 [2018-01-30 03:17:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:33,002 INFO L225 Difference]: With dead ends: 407 [2018-01-30 03:17:33,002 INFO L226 Difference]: Without dead ends: 311 [2018-01-30 03:17:33,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=591, Invalid=2061, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 03:17:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-30 03:17:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2018-01-30 03:17:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-01-30 03:17:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 310 transitions. [2018-01-30 03:17:33,010 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 310 transitions. Word has length 290 [2018-01-30 03:17:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:33,011 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 310 transitions. [2018-01-30 03:17:33,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 03:17:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 310 transitions. [2018-01-30 03:17:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-01-30 03:17:33,012 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:33,012 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:33,012 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1707148424, now seen corresponding path program 18 times [2018-01-30 03:17:33,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:33,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:33,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:33,013 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:33,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:33,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-01-30 03:17:33,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:33,702 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:17:33,707 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:17:33,716 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,717 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,720 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,722 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,724 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,726 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,729 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,733 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,740 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,745 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,750 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,755 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:33,756 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:33,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 44 proven. 184 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2018-01-30 03:17:33,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:33,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 22 [2018-01-30 03:17:33,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 03:17:33,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 03:17:33,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-01-30 03:17:33,843 INFO L87 Difference]: Start difference. First operand 305 states and 310 transitions. Second operand 22 states. [2018-01-30 03:17:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:34,040 INFO L93 Difference]: Finished difference Result 365 states and 372 transitions. [2018-01-30 03:17:34,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 03:17:34,040 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 302 [2018-01-30 03:17:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:34,041 INFO L225 Difference]: With dead ends: 365 [2018-01-30 03:17:34,041 INFO L226 Difference]: Without dead ends: 314 [2018-01-30 03:17:34,042 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=486, Invalid=1154, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 03:17:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-30 03:17:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2018-01-30 03:17:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-01-30 03:17:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 316 transitions. [2018-01-30 03:17:34,049 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 316 transitions. Word has length 302 [2018-01-30 03:17:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:34,049 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 316 transitions. [2018-01-30 03:17:34,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 03:17:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 316 transitions. [2018-01-30 03:17:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 03:17:34,050 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:34,050 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:34,050 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493908, now seen corresponding path program 19 times [2018-01-30 03:17:34,051 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:34,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:34,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:34,051 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:34,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:34,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-01-30 03:17:34,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:34,723 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:17:34,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:34,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2018-01-30 03:17:35,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:35,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2018-01-30 03:17:35,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-30 03:17:35,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-30 03:17:35,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-01-30 03:17:35,087 INFO L87 Difference]: Start difference. First operand 311 states and 316 transitions. Second operand 44 states. [2018-01-30 03:17:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:35,740 INFO L93 Difference]: Finished difference Result 544 states and 555 transitions. [2018-01-30 03:17:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-30 03:17:35,741 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 308 [2018-01-30 03:17:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:35,742 INFO L225 Difference]: With dead ends: 544 [2018-01-30 03:17:35,742 INFO L226 Difference]: Without dead ends: 333 [2018-01-30 03:17:35,743 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1215, Invalid=5757, Unknown=0, NotChecked=0, Total=6972 [2018-01-30 03:17:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-30 03:17:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 325. [2018-01-30 03:17:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-30 03:17:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 330 transitions. [2018-01-30 03:17:35,752 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 330 transitions. Word has length 308 [2018-01-30 03:17:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:35,752 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 330 transitions. [2018-01-30 03:17:35,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-30 03:17:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 330 transitions. [2018-01-30 03:17:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 03:17:35,753 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:35,753 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:35,753 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1481666318, now seen corresponding path program 20 times [2018-01-30 03:17:35,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:35,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:35,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:35,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:35,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:35,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 8 proven. 290 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-01-30 03:17:36,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:36,105 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:17:36,109 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:17:36,129 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:36,146 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:36,149 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:36,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-01-30 03:17:36,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:36,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 48 [2018-01-30 03:17:36,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 03:17:36,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 03:17:36,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1919, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 03:17:36,464 INFO L87 Difference]: Start difference. First operand 325 states and 330 transitions. Second operand 48 states. [2018-01-30 03:17:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:37,132 INFO L93 Difference]: Finished difference Result 564 states and 575 transitions. [2018-01-30 03:17:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-30 03:17:37,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 322 [2018-01-30 03:17:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:37,142 INFO L225 Difference]: With dead ends: 564 [2018-01-30 03:17:37,142 INFO L226 Difference]: Without dead ends: 347 [2018-01-30 03:17:37,143 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1445, Invalid=6927, Unknown=0, NotChecked=0, Total=8372 [2018-01-30 03:17:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-30 03:17:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2018-01-30 03:17:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-01-30 03:17:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 344 transitions. [2018-01-30 03:17:37,152 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 344 transitions. Word has length 322 [2018-01-30 03:17:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:37,152 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 344 transitions. [2018-01-30 03:17:37,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 03:17:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 344 transitions. [2018-01-30 03:17:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-01-30 03:17:37,153 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:37,153 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:37,153 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1155499064, now seen corresponding path program 21 times [2018-01-30 03:17:37,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:37,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:37,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:37,154 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:37,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:37,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-01-30 03:17:37,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:37,460 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:37,464 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:17:37,473 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,475 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,479 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,483 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,487 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,491 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,495 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,501 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,507 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:37,508 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:37,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2018-01-30 03:17:37,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:37,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 03:17:37,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 03:17:37,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 03:17:37,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-30 03:17:37,587 INFO L87 Difference]: Start difference. First operand 339 states and 344 transitions. Second operand 19 states. [2018-01-30 03:17:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:37,778 INFO L93 Difference]: Finished difference Result 468 states and 476 transitions. [2018-01-30 03:17:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 03:17:37,779 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 336 [2018-01-30 03:17:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:37,779 INFO L225 Difference]: With dead ends: 468 [2018-01-30 03:17:37,780 INFO L226 Difference]: Without dead ends: 348 [2018-01-30 03:17:37,780 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 337 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:17:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-30 03:17:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2018-01-30 03:17:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-01-30 03:17:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 350 transitions. [2018-01-30 03:17:37,788 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 350 transitions. Word has length 336 [2018-01-30 03:17:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:37,788 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 350 transitions. [2018-01-30 03:17:37,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 03:17:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 350 transitions. [2018-01-30 03:17:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-01-30 03:17:37,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:37,790 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:37,790 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash 39241852, now seen corresponding path program 22 times [2018-01-30 03:17:37,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:37,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:37,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:37,790 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:37,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:37,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-01-30 03:17:38,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:38,082 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:38,086 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:17:38,118 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:38,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:38,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:38,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:17:38,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:38,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:17:38,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:38,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 03:17:38,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-01-30 03:17:38,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-01-30 03:17:38,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:38,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 03:17:38,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:38,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 03:17:38,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:38,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 03:17:38,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:38,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 03:17:38,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:38,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 03:17:39,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-01-30 03:17:39,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 29 [2018-01-30 03:17:39,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:29 [2018-01-30 03:17:39,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:39,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 03:17:39,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:39,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2018-01-30 03:17:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 03:17:39,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2018-01-30 03:17:39,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:39,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 03:17:39,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:39,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2018-01-30 03:17:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 03:17:40,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:40,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:40,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-01-30 03:17:40,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 79 [2018-01-30 03:17:40,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:40,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:40,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:79 [2018-01-30 03:17:40,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 95 [2018-01-30 03:17:40,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:40,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:40,625 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 35 treesize of output 50 [2018-01-30 03:17:40,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:40,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:40,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:92, output treesize:29 [2018-01-30 03:17:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 23 proven. 812 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2018-01-30 03:17:41,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:41,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 85] total 104 [2018-01-30 03:17:41,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-01-30 03:17:41,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-01-30 03:17:41,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=10056, Unknown=0, NotChecked=0, Total=10712 [2018-01-30 03:17:41,630 INFO L87 Difference]: Start difference. First operand 345 states and 350 transitions. Second operand 104 states. [2018-01-30 03:17:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:47,322 INFO L93 Difference]: Finished difference Result 491 states and 501 transitions. [2018-01-30 03:17:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-30 03:17:47,322 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 342 [2018-01-30 03:17:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:47,323 INFO L225 Difference]: With dead ends: 491 [2018-01-30 03:17:47,323 INFO L226 Difference]: Without dead ends: 371 [2018-01-30 03:17:47,326 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12988 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2011, Invalid=35431, Unknown=0, NotChecked=0, Total=37442 [2018-01-30 03:17:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-30 03:17:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2018-01-30 03:17:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-01-30 03:17:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 366 transitions. [2018-01-30 03:17:47,336 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 366 transitions. Word has length 342 [2018-01-30 03:17:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:47,336 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 366 transitions. [2018-01-30 03:17:47,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-01-30 03:17:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 366 transitions. [2018-01-30 03:17:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-01-30 03:17:47,338 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:47,338 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:47,338 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -946698413, now seen corresponding path program 23 times [2018-01-30 03:17:47,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:47,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:47,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:47,340 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:47,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:47,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 10 proven. 650 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-01-30 03:17:48,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:48,013 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:48,018 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 03:17:48,025 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,026 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,027 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,029 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,031 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,033 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,036 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,044 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,049 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,056 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,071 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,108 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:48,118 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:48,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-01-30 03:17:48,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:48,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 50 [2018-01-30 03:17:48,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-30 03:17:48,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-30 03:17:48,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 03:17:48,491 INFO L87 Difference]: Start difference. First operand 361 states and 366 transitions. Second operand 50 states. [2018-01-30 03:17:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:49,317 INFO L93 Difference]: Finished difference Result 628 states and 639 transitions. [2018-01-30 03:17:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-01-30 03:17:49,318 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 358 [2018-01-30 03:17:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:49,319 INFO L225 Difference]: With dead ends: 628 [2018-01-30 03:17:49,319 INFO L226 Difference]: Without dead ends: 383 [2018-01-30 03:17:49,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1580, Invalid=7540, Unknown=0, NotChecked=0, Total=9120 [2018-01-30 03:17:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-01-30 03:17:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 375. [2018-01-30 03:17:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-01-30 03:17:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 380 transitions. [2018-01-30 03:17:49,330 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 380 transitions. Word has length 358 [2018-01-30 03:17:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:49,331 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 380 transitions. [2018-01-30 03:17:49,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-30 03:17:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 380 transitions. [2018-01-30 03:17:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-01-30 03:17:49,332 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:49,332 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:49,332 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2025419403, now seen corresponding path program 24 times [2018-01-30 03:17:49,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:49,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:49,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:49,333 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:49,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:49,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 10 proven. 756 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-01-30 03:17:49,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:49,823 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:49,828 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 03:17:49,837 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,838 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,841 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,842 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,845 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,847 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,850 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,853 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,857 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,862 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,867 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,874 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,880 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,887 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,895 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 03:17:49,896 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:49,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2018-01-30 03:17:50,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:50,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 48 [2018-01-30 03:17:50,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-30 03:17:50,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-30 03:17:50,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 03:17:50,232 INFO L87 Difference]: Start difference. First operand 375 states and 380 transitions. Second operand 48 states. [2018-01-30 03:17:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:50,975 INFO L93 Difference]: Finished difference Result 648 states and 659 transitions. [2018-01-30 03:17:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-30 03:17:50,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 372 [2018-01-30 03:17:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:50,976 INFO L225 Difference]: With dead ends: 648 [2018-01-30 03:17:50,976 INFO L226 Difference]: Without dead ends: 397 [2018-01-30 03:17:50,977 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1525, Invalid=6847, Unknown=0, NotChecked=0, Total=8372 [2018-01-30 03:17:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-30 03:17:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 389. [2018-01-30 03:17:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-01-30 03:17:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 394 transitions. [2018-01-30 03:17:50,987 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 394 transitions. Word has length 372 [2018-01-30 03:17:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:50,987 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 394 transitions. [2018-01-30 03:17:50,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-30 03:17:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 394 transitions. [2018-01-30 03:17:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-01-30 03:17:50,989 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:50,989 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:50,989 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2013214031, now seen corresponding path program 25 times [2018-01-30 03:17:50,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:50,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:50,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:50,989 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:50,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:51,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 10 proven. 870 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2018-01-30 03:17:51,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:51,679 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:51,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:51,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2018-01-30 03:17:51,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:51,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-30 03:17:51,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 03:17:51,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 03:17:51,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 03:17:51,787 INFO L87 Difference]: Start difference. First operand 389 states and 394 transitions. Second operand 33 states. [2018-01-30 03:17:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:52,269 INFO L93 Difference]: Finished difference Result 659 states and 669 transitions. [2018-01-30 03:17:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-30 03:17:52,271 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 386 [2018-01-30 03:17:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:52,271 INFO L225 Difference]: With dead ends: 659 [2018-01-30 03:17:52,271 INFO L226 Difference]: Without dead ends: 402 [2018-01-30 03:17:52,272 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 03:17:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-01-30 03:17:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 397. [2018-01-30 03:17:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-01-30 03:17:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 402 transitions. [2018-01-30 03:17:52,296 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 402 transitions. Word has length 386 [2018-01-30 03:17:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:52,296 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 402 transitions. [2018-01-30 03:17:52,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 03:17:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 402 transitions. [2018-01-30 03:17:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-01-30 03:17:52,297 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:52,297 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:52,297 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2078541629, now seen corresponding path program 26 times [2018-01-30 03:17:52,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:52,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:52,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:52,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 03:17:52,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:52,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2055 backedges. 10 proven. 352 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-01-30 03:17:52,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:52,924 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:52,928 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 03:17:52,938 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:52,958 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 03:17:52,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:52,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2055 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2018-01-30 03:17:53,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:53,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35] total 58 [2018-01-30 03:17:53,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-30 03:17:53,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-30 03:17:53,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2816, Unknown=0, NotChecked=0, Total=3306 [2018-01-30 03:17:53,431 INFO L87 Difference]: Start difference. First operand 397 states and 402 transitions. Second operand 58 states. [2018-01-30 03:17:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:54,444 INFO L93 Difference]: Finished difference Result 676 states and 687 transitions. [2018-01-30 03:17:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-01-30 03:17:54,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 394 [2018-01-30 03:17:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:54,445 INFO L225 Difference]: With dead ends: 676 [2018-01-30 03:17:54,445 INFO L226 Difference]: Without dead ends: 419 [2018-01-30 03:17:54,446 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2160, Invalid=10272, Unknown=0, NotChecked=0, Total=12432 [2018-01-30 03:17:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-30 03:17:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2018-01-30 03:17:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-01-30 03:17:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 416 transitions. [2018-01-30 03:17:54,456 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 416 transitions. Word has length 394 [2018-01-30 03:17:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:54,457 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 416 transitions. [2018-01-30 03:17:54,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-30 03:17:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 416 transitions. [2018-01-30 03:17:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-30 03:17:54,458 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:54,458 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:54,458 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash 481285855, now seen corresponding path program 27 times [2018-01-30 03:17:54,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:54,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:54,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:54,459 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:54,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:54,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 10 proven. 352 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-01-30 03:17:54,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:54,923 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:54,929 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 03:17:54,938 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,951 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,955 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,959 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,963 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,969 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,975 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,982 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,991 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 03:17:54,992 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:54,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2019 trivial. 0 not checked. [2018-01-30 03:17:55,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 03:17:55,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 34 [2018-01-30 03:17:55,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 03:17:55,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 03:17:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 03:17:55,141 INFO L87 Difference]: Start difference. First operand 411 states and 416 transitions. Second operand 34 states. [2018-01-30 03:17:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 03:17:55,615 INFO L93 Difference]: Finished difference Result 634 states and 644 transitions. [2018-01-30 03:17:55,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 03:17:55,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 408 [2018-01-30 03:17:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 03:17:55,623 INFO L225 Difference]: With dead ends: 634 [2018-01-30 03:17:55,623 INFO L226 Difference]: Without dead ends: 429 [2018-01-30 03:17:55,623 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1186, Invalid=4216, Unknown=0, NotChecked=0, Total=5402 [2018-01-30 03:17:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-01-30 03:17:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2018-01-30 03:17:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-30 03:17:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 428 transitions. [2018-01-30 03:17:55,634 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 428 transitions. Word has length 408 [2018-01-30 03:17:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 03:17:55,635 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 428 transitions. [2018-01-30 03:17:55,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 03:17:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 428 transitions. [2018-01-30 03:17:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-01-30 03:17:55,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 03:17:55,636 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 03:17:55,636 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 03:17:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -294426601, now seen corresponding path program 28 times [2018-01-30 03:17:55,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 03:17:55,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 03:17:55,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:55,637 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 03:17:55,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 03:17:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 03:17:55,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 03:17:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 10 proven. 420 refuted. 0 times theorem prover too weak. 1947 trivial. 0 not checked. [2018-01-30 03:17:56,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 03:17:56,366 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 03:17:56,370 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 03:17:56,412 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 03:17:56,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 03:17:56,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 03:17:56,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 03:17:56,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 03:17:56,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 03:17:56,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-30 03:17:56,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:56,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-30 03:17:56,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,755 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 34 treesize of output 63 [2018-01-30 03:17:56,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:56,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:41 [2018-01-30 03:17:56,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 03:17:56,881 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 45 treesize of output 100 [2018-01-30 03:17:56,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 03:17:56,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 03:17:56,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:52 Received shutdown request... [2018-01-30 03:18:01,206 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 03:18:01,206 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 03:18:01,209 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 03:18:01,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 03:18:01 BasicIcfg [2018-01-30 03:18:01,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 03:18:01,210 INFO L168 Benchmark]: Toolchain (without parser) took 70686.07 ms. Allocated memory was 148.9 MB in the beginning and 933.8 MB in the end (delta: 784.9 MB). Free memory was 115.0 MB in the beginning and 796.7 MB in the end (delta: -681.7 MB). Peak memory consumption was 103.2 MB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,211 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 03:18:01,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.28 ms. Allocated memory is still 148.9 MB. Free memory was 115.0 MB in the beginning and 106.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,211 INFO L168 Benchmark]: Boogie Preprocessor took 19.84 ms. Allocated memory is still 148.9 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,211 INFO L168 Benchmark]: RCFGBuilder took 350.78 ms. Allocated memory is still 148.9 MB. Free memory was 105.1 MB in the beginning and 90.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,211 INFO L168 Benchmark]: IcfgTransformer took 12.25 ms. Allocated memory is still 148.9 MB. Free memory was 90.1 MB in the beginning and 89.2 MB in the end (delta: 868.0 kB). Peak memory consumption was 868.0 kB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,212 INFO L168 Benchmark]: TraceAbstraction took 70183.46 ms. Allocated memory was 148.9 MB in the beginning and 933.8 MB in the end (delta: 784.9 MB). Free memory was 88.8 MB in the beginning and 796.7 MB in the end (delta: -707.9 MB). Peak memory consumption was 77.0 MB. Max. memory is 5.3 GB. [2018-01-30 03:18:01,212 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 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 117.28 ms. Allocated memory is still 148.9 MB. Free memory was 115.0 MB in the beginning and 106.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.84 ms. Allocated memory is still 148.9 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 350.78 ms. Allocated memory is still 148.9 MB. Free memory was 105.1 MB in the beginning and 90.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 12.25 ms. Allocated memory is still 148.9 MB. Free memory was 90.1 MB in the beginning and 89.2 MB in the end (delta: 868.0 kB). Peak memory consumption was 868.0 kB. Max. memory is 5.3 GB. * TraceAbstraction took 70183.46 ms. Allocated memory was 148.9 MB in the beginning and 933.8 MB in the end (delta: 784.9 MB). Free memory was 88.8 MB in the beginning and 796.7 MB in the end (delta: -707.9 MB). Peak memory consumption was 77.0 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 421 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 50 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 1 error locations. TIMEOUT Result, 70.1s OverallTime, 35 OverallIterations, 18 TraceHistogramMax, 33.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1772 SDtfs, 3413 SDslu, 27756 SDs, 0 SdLazy, 21893 SolverSat, 1154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8525 GetRequests, 6773 SyntacticMatches, 0 SemanticMatches, 1752 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41449 ImplicationChecksByTransitivity, 44.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 229 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 14518 NumberOfCodeBlocks, 13961 NumberOfCodeBlocksAsserted, 177 NumberOfCheckSat, 14453 ConstructedInterpolants, 108 QuantifiedInterpolants, 9958968 SizeOfPredicates, 581 NumberOfNonLiveVariables, 9387 ConjunctsInSsa, 840 ConjunctsInUnsatCore, 65 InterpolantComputations, 3 PerfectInterpolantSequences, 36312/49188 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_copy3_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_03-18-01-216.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_copy3_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_03-18-01-216.csv Completed graceful shutdown