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-tiling/mlceu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 04:53:36,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 04:53:36,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 04:53:36,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 04:53:36,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 04:53:36,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 04:53:36,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 04:53:36,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 04:53:36,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 04:53:36,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 04:53:36,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 04:53:36,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 04:53:36,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 04:53:36,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 04:53:36,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 04:53:36,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 04:53:36,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 04:53:36,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 04:53:36,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 04:53:36,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 04:53:36,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 04:53:36,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 04:53:36,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 04:53:36,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 04:53:36,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 04:53:36,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 04:53:36,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 04:53:36,616 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 04:53:36,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 04:53:36,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 04:53:36,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 04:53:36,616 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 04:53:36,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 04:53:36,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 04:53:36,629 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 04:53:36,629 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 04:53:36,629 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 04:53:36,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 04:53:36,629 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 04:53:36,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 04:53:36,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 04:53:36,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 04:53:36,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 04:53:36,631 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 04:53:36,632 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 04:53:36,632 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 04:53:36,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 04:53:36,666 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 04:53:36,668 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 04:53:36,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 04:53:36,669 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 04:53:36,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i [2018-01-30 04:53:36,732 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 04:53:36,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 04:53:36,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 04:53:36,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 04:53:36,736 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 04:53:36,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e9a166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36, skipping insertion in model container [2018-01-30 04:53:36,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,747 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:53:36,756 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:53:36,823 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:53:36,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:53:36,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36 WrapperNode [2018-01-30 04:53:36,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 04:53:36,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 04:53:36,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 04:53:36,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 04:53:36,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (1/1) ... [2018-01-30 04:53:36,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 04:53:36,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 04:53:36,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 04:53:36,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 04:53:36,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (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 04:53:36,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 04:53:36,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 04:53:36,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 04:53:36,895 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 04:53:36,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 04:53:37,122 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 04:53:37,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:53:37 BoogieIcfgContainer [2018-01-30 04:53:37,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 04:53:37,123 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 04:53:37,123 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 04:53:37,124 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 04:53:37,126 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:53:37" (1/1) ... [2018-01-30 04:53:37,128 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 04:53:37,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:53:37 BasicIcfg [2018-01-30 04:53:37,134 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 04:53:37,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 04:53:37,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 04:53:37,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 04:53:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 04:53:36" (1/4) ... [2018-01-30 04:53:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de61ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:53:37, skipping insertion in model container [2018-01-30 04:53:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:53:36" (2/4) ... [2018-01-30 04:53:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de61ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:53:37, skipping insertion in model container [2018-01-30 04:53:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:53:37" (3/4) ... [2018-01-30 04:53:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de61ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:53:37, skipping insertion in model container [2018-01-30 04:53:37,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:53:37" (4/4) ... [2018-01-30 04:53:37,138 INFO L107 eAbstractionObserver]: Analyzing ICFG mlceu_false-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 04:53:37,143 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 04:53:37,148 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 04:53:37,171 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 04:53:37,171 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 04:53:37,171 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 04:53:37,171 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 04:53:37,171 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 04:53:37,171 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 04:53:37,171 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 04:53:37,171 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 04:53:37,172 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 04:53:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 04:53:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 04:53:37,184 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:37,184 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:37,184 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1280533187, now seen corresponding path program 1 times [2018-01-30 04:53:37,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:37,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:37,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:37,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:37,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:37,258 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 04:53:37,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:53:37,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 04:53:37,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 04:53:37,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 04:53:37,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:53:37,270 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 04:53:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:37,282 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-30 04:53:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 04:53:37,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-30 04:53:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:37,288 INFO L225 Difference]: With dead ends: 56 [2018-01-30 04:53:37,288 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 04:53:37,290 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 04:53:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 04:53:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 04:53:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 04:53:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 04:53:37,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2018-01-30 04:53:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:37,312 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 04:53:37,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 04:53:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 04:53:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 04:53:37,312 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:37,313 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] [2018-01-30 04:53:37,313 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1232618195, now seen corresponding path program 1 times [2018-01-30 04:53:37,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:37,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:37,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:37,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:37,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:37,442 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 04:53:37,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:53:37,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 04:53:37,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 04:53:37,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 04:53:37,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 04:53:37,444 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-01-30 04:53:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:37,569 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-30 04:53:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 04:53:37,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-30 04:53:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:37,571 INFO L225 Difference]: With dead ends: 58 [2018-01-30 04:53:37,571 INFO L226 Difference]: Without dead ends: 45 [2018-01-30 04:53:37,571 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 04:53:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-30 04:53:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-01-30 04:53:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 04:53:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-30 04:53:37,577 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-01-30 04:53:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:37,577 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-30 04:53:37,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 04:53:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-30 04:53:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 04:53:37,578 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:37,578 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:37,578 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1464295251, now seen corresponding path program 1 times [2018-01-30 04:53:37,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:37,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:37,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:37,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:37,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:37,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:53:37,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 04:53:37,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 04:53:37,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 04:53:37,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:53:37,627 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2018-01-30 04:53:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:37,702 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-01-30 04:53:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 04:53:37,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-30 04:53:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:37,703 INFO L225 Difference]: With dead ends: 65 [2018-01-30 04:53:37,703 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 04:53:37,703 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 04:53:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 04:53:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-30 04:53:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-30 04:53:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-30 04:53:37,707 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2018-01-30 04:53:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:37,707 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-30 04:53:37,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 04:53:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-30 04:53:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 04:53:37,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:37,708 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:37,708 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:37,708 INFO L82 PathProgramCache]: Analyzing trace with hash 665333619, now seen corresponding path program 1 times [2018-01-30 04:53:37,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:37,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:37,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:37,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:37,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:37,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:37,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 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 04:53:37,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:37,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:38,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:38,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 04:53:38,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 04:53:38,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 04:53:38,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 04:53:38,030 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 9 states. [2018-01-30 04:53:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:38,202 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-01-30 04:53:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 04:53:38,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 04:53:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:38,203 INFO L225 Difference]: With dead ends: 72 [2018-01-30 04:53:38,203 INFO L226 Difference]: Without dead ends: 51 [2018-01-30 04:53:38,203 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-01-30 04:53:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-30 04:53:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-01-30 04:53:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 04:53:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 04:53:38,207 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 28 [2018-01-30 04:53:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:38,207 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 04:53:38,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 04:53:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 04:53:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 04:53:38,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:38,208 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:38,208 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash -535444883, now seen corresponding path program 2 times [2018-01-30 04:53:38,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:38,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:38,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:38,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:38,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:38,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:38,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:38,624 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 04:53:38,637 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:53:38,643 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:38,645 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:38,654 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:38,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:38,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:38,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:38,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:38,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 04:53:38,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 04:53:38,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:38,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:38,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 04:53:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:38,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:38,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2018-01-30 04:53:38,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 04:53:38,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 04:53:38,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:53:38,778 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 15 states. [2018-01-30 04:53:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:39,098 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-01-30 04:53:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 04:53:39,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-30 04:53:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:39,099 INFO L225 Difference]: With dead ends: 92 [2018-01-30 04:53:39,099 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 04:53:39,099 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-01-30 04:53:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 04:53:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2018-01-30 04:53:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-30 04:53:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-30 04:53:39,105 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 35 [2018-01-30 04:53:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:39,105 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-30 04:53:39,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 04:53:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-30 04:53:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 04:53:39,106 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:39,106 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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 04:53:39,106 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1344598547, now seen corresponding path program 1 times [2018-01-30 04:53:39,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:39,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:39,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:39,107 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:39,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:39,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:39,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:39,175 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 04:53:39,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:39,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:39,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:39,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 04:53:39,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 04:53:39,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 04:53:39,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 04:53:39,231 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 7 states. [2018-01-30 04:53:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:39,338 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-30 04:53:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 04:53:39,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-01-30 04:53:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:39,340 INFO L225 Difference]: With dead ends: 95 [2018-01-30 04:53:39,340 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 04:53:39,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-30 04:53:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 04:53:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-01-30 04:53:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 04:53:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-30 04:53:39,344 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 42 [2018-01-30 04:53:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:39,344 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-30 04:53:39,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 04:53:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-30 04:53:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-30 04:53:39,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:39,345 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] [2018-01-30 04:53:39,345 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 84485104, now seen corresponding path program 1 times [2018-01-30 04:53:39,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:39,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:39,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:39,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:39,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:39,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:39,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:39,590 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 04:53:39,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:39,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:39,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:39,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:39,624 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 04:53:39,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 04:53:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:39,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:39,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-01-30 04:53:39,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 04:53:39,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 04:53:39,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:53:39,698 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 15 states. [2018-01-30 04:53:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:40,024 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-01-30 04:53:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 04:53:40,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-01-30 04:53:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:40,027 INFO L225 Difference]: With dead ends: 111 [2018-01-30 04:53:40,027 INFO L226 Difference]: Without dead ends: 99 [2018-01-30 04:53:40,027 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-01-30 04:53:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-30 04:53:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2018-01-30 04:53:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 04:53:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-30 04:53:40,035 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 45 [2018-01-30 04:53:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:40,035 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-30 04:53:40,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 04:53:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-30 04:53:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-30 04:53:40,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:40,036 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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 04:53:40,036 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 682674061, now seen corresponding path program 2 times [2018-01-30 04:53:40,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:40,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:40,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:40,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:40,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:40,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:40,312 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 04:53:40,317 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:53:40,321 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:40,329 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:40,338 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:40,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:40,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:40,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-01-30 04:53:40,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 04:53:40,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 04:53:40,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 04:53:40,365 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-01-30 04:53:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:40,467 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-01-30 04:53:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 04:53:40,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-30 04:53:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:40,468 INFO L225 Difference]: With dead ends: 113 [2018-01-30 04:53:40,468 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 04:53:40,469 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:53:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 04:53:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-01-30 04:53:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 04:53:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-30 04:53:40,474 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 49 [2018-01-30 04:53:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:40,474 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-30 04:53:40,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 04:53:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-30 04:53:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 04:53:40,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:40,475 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:40,475 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1359037005, now seen corresponding path program 2 times [2018-01-30 04:53:40,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:40,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:40,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,476 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:40,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:40,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 04:53:40,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:40,644 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 04:53:40,649 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:53:40,655 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:40,665 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:40,666 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:40,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 04:53:40,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:40,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-01-30 04:53:40,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 04:53:40,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 04:53:40,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-01-30 04:53:40,742 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 18 states. [2018-01-30 04:53:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:40,948 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-01-30 04:53:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 04:53:40,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-01-30 04:53:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:40,949 INFO L225 Difference]: With dead ends: 122 [2018-01-30 04:53:40,949 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 04:53:40,950 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-01-30 04:53:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 04:53:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-01-30 04:53:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 04:53:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-30 04:53:40,955 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 55 [2018-01-30 04:53:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:40,955 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-30 04:53:40,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 04:53:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-30 04:53:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 04:53:40,956 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:40,956 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 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 04:53:40,956 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1989495597, now seen corresponding path program 3 times [2018-01-30 04:53:40,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:40,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:40,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,956 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:40,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:40,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:41,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:41,005 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 04:53:41,009 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:53:41,013 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,014 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,015 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,016 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,018 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,019 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,019 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:41,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:41,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:41,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 04:53:41,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 04:53:41,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 04:53:41,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 04:53:41,057 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 11 states. [2018-01-30 04:53:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:41,295 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-01-30 04:53:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 04:53:41,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-01-30 04:53:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:41,298 INFO L225 Difference]: With dead ends: 120 [2018-01-30 04:53:41,298 INFO L226 Difference]: Without dead ends: 99 [2018-01-30 04:53:41,298 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 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 04:53:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-30 04:53:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-01-30 04:53:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 04:53:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-30 04:53:41,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 56 [2018-01-30 04:53:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:41,303 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-30 04:53:41,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 04:53:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-30 04:53:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 04:53:41,304 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:41,304 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:41,304 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2093424249, now seen corresponding path program 3 times [2018-01-30 04:53:41,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:41,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:41,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:41,305 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:41,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:41,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 04:53:41,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:41,498 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 04:53:41,503 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:53:41,509 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,511 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,513 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,515 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:41,515 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:41,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:41,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:41,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 04:53:41,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-30 04:53:41,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 04:53:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-01-30 04:53:41,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:41,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 04:53:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 04:53:42,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:42,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-01-30 04:53:42,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 04:53:42,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 04:53:42,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 04:53:42,103 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 34 states. [2018-01-30 04:53:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:43,505 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-01-30 04:53:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-30 04:53:43,505 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2018-01-30 04:53:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:43,506 INFO L225 Difference]: With dead ends: 166 [2018-01-30 04:53:43,506 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 04:53:43,507 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=614, Invalid=4788, Unknown=0, NotChecked=0, Total=5402 [2018-01-30 04:53:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 04:53:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-01-30 04:53:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 04:53:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-30 04:53:43,515 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 62 [2018-01-30 04:53:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:43,516 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-30 04:53:43,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 04:53:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-30 04:53:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-30 04:53:43,516 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:43,516 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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 04:53:43,516 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1957588173, now seen corresponding path program 4 times [2018-01-30 04:53:43,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:43,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:43,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:43,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:43,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:43,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:43,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:43,620 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 04:53:43,625 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:53:43,639 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:43,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:43,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:43,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 04:53:43,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 04:53:43,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-30 04:53:43,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,839 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 17 treesize of output 24 [2018-01-30 04:53:43,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 04:53:43,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:43,900 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 22 treesize of output 41 [2018-01-30 04:53:43,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:43,911 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 04:53:43,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-01-30 04:53:44,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,021 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 27 treesize of output 62 [2018-01-30 04:53:44,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:44,038 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 04:53:44,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:39 [2018-01-30 04:53:44,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:44,168 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 32 treesize of output 87 [2018-01-30 04:53:44,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:44,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 04:53:44,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:49 [2018-01-30 04:53:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 36 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:53:44,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:44,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2018-01-30 04:53:44,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 04:53:44,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 04:53:44,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 04:53:44,355 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 33 states. [2018-01-30 04:53:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:46,078 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-01-30 04:53:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 04:53:46,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-01-30 04:53:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:46,079 INFO L225 Difference]: With dead ends: 161 [2018-01-30 04:53:46,079 INFO L226 Difference]: Without dead ends: 140 [2018-01-30 04:53:46,080 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=439, Invalid=2867, Unknown=0, NotChecked=0, Total=3306 [2018-01-30 04:53:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-30 04:53:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2018-01-30 04:53:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-30 04:53:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-01-30 04:53:46,087 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2018-01-30 04:53:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:46,088 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-01-30 04:53:46,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 04:53:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-01-30 04:53:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 04:53:46,089 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:46,089 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 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] [2018-01-30 04:53:46,089 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1672977162, now seen corresponding path program 4 times [2018-01-30 04:53:46,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:46,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:46,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:46,090 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:46,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:46,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 04:53:46,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:46,388 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 04:53:46,401 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:53:46,410 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:46,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:46,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:46,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:46,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:46,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 04:53:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 6 proven. 77 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 04:53:46,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:46,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2018-01-30 04:53:46,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 04:53:46,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 04:53:46,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 04:53:46,673 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 41 states. [2018-01-30 04:53:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:47,962 INFO L93 Difference]: Finished difference Result 180 states and 200 transitions. [2018-01-30 04:53:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-30 04:53:47,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-01-30 04:53:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:47,963 INFO L225 Difference]: With dead ends: 180 [2018-01-30 04:53:47,963 INFO L226 Difference]: Without dead ends: 138 [2018-01-30 04:53:47,965 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=833, Invalid=6649, Unknown=0, NotChecked=0, Total=7482 [2018-01-30 04:53:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-30 04:53:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-01-30 04:53:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 04:53:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-30 04:53:47,983 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 79 [2018-01-30 04:53:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:47,983 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-30 04:53:47,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 04:53:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-30 04:53:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 04:53:47,994 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:47,995 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:47,995 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1380995478, now seen corresponding path program 1 times [2018-01-30 04:53:47,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:47,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:47,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:47,995 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:47,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:48,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 34 proven. 123 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 04:53:48,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:48,153 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 04:53:48,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:48,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 32 proven. 123 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 04:53:48,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:48,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 04:53:48,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 04:53:48,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 04:53:48,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:53:48,202 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 15 states. [2018-01-30 04:53:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:48,316 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-01-30 04:53:48,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 04:53:48,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-01-30 04:53:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:48,319 INFO L225 Difference]: With dead ends: 161 [2018-01-30 04:53:48,319 INFO L226 Difference]: Without dead ends: 133 [2018-01-30 04:53:48,320 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-01-30 04:53:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-30 04:53:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2018-01-30 04:53:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-30 04:53:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-30 04:53:48,332 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 80 [2018-01-30 04:53:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:48,332 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-30 04:53:48,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 04:53:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-30 04:53:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 04:53:48,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:48,333 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:48,333 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 46807952, now seen corresponding path program 2 times [2018-01-30 04:53:48,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:48,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:48,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:48,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:53:48,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:48,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 39 proven. 168 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 04:53:48,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:48,860 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 04:53:48,865 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:53:48,871 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:48,881 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:48,882 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:48,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 37 proven. 168 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 04:53:48,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:48,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-30 04:53:48,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 04:53:48,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 04:53:48,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-30 04:53:48,907 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 17 states. [2018-01-30 04:53:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:49,120 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2018-01-30 04:53:49,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 04:53:49,121 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-01-30 04:53:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:49,121 INFO L225 Difference]: With dead ends: 169 [2018-01-30 04:53:49,121 INFO L226 Difference]: Without dead ends: 141 [2018-01-30 04:53:49,122 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-01-30 04:53:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-30 04:53:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2018-01-30 04:53:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-30 04:53:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2018-01-30 04:53:49,128 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 87 [2018-01-30 04:53:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:49,128 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2018-01-30 04:53:49,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 04:53:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2018-01-30 04:53:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-30 04:53:49,129 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:49,129 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 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] [2018-01-30 04:53:49,129 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:49,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1100062335, now seen corresponding path program 5 times [2018-01-30 04:53:49,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:49,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:49,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:49,130 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:49,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:49,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 138 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 04:53:49,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:49,377 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 04:53:49,381 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 04:53:49,385 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,386 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,388 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,390 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,393 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:53:49,397 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:49,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:49,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:49,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:49,424 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 04:53:49,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 04:53:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 128 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 04:53:49,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:49,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 33 [2018-01-30 04:53:49,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 04:53:49,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 04:53:49,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 04:53:49,733 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 33 states. [2018-01-30 04:53:50,218 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-30 04:53:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:51,346 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-01-30 04:53:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-30 04:53:51,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 96 [2018-01-30 04:53:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:51,347 INFO L225 Difference]: With dead ends: 174 [2018-01-30 04:53:51,348 INFO L226 Difference]: Without dead ends: 162 [2018-01-30 04:53:51,348 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=273, Invalid=3267, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 04:53:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-30 04:53:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2018-01-30 04:53:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 04:53:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-30 04:53:51,356 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 96 [2018-01-30 04:53:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:51,356 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-30 04:53:51,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 04:53:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-30 04:53:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-30 04:53:51,357 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:51,357 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:51,357 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -336722858, now seen corresponding path program 3 times [2018-01-30 04:53:51,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:51,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:51,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:51,358 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:51,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:51,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 44 proven. 220 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 04:53:51,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:51,668 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 04:53:51,681 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:53:51,685 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,688 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,689 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,691 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,692 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,695 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,696 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,700 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:53:51,701 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:51,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 42 proven. 220 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 04:53:51,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:53:51,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-01-30 04:53:51,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 04:53:51,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 04:53:51,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-30 04:53:51,736 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 19 states. [2018-01-30 04:53:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:53:52,046 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-01-30 04:53:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 04:53:52,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-01-30 04:53:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:53:52,048 INFO L225 Difference]: With dead ends: 187 [2018-01-30 04:53:52,048 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 04:53:52,049 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 04:53:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 04:53:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-01-30 04:53:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-30 04:53:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-01-30 04:53:52,056 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 94 [2018-01-30 04:53:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:53:52,056 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-01-30 04:53:52,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 04:53:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-01-30 04:53:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 04:53:52,056 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:53:52,056 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:53:52,056 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:53:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1218572496, now seen corresponding path program 4 times [2018-01-30 04:53:52,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:53:52,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:53:52,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:52,057 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:53:52,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:53:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:53:52,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:53:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 49 proven. 279 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 04:53:52,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:53:52,498 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 04:53:52,502 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:53:52,512 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:53:52,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:53:52,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 04:53:52,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 04:53:52,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 04:53:52,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-30 04:53:52,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,818 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 17 treesize of output 28 [2018-01-30 04:53:52,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,825 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 04:53:52,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 04:53:52,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:52,904 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 22 treesize of output 45 [2018-01-30 04:53:52,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:52,916 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 04:53:52,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-01-30 04:53:53,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,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 27 treesize of output 66 [2018-01-30 04:53:53,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:53,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 04:53:53,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:44 [2018-01-30 04:53:53,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,190 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 32 treesize of output 91 [2018-01-30 04:53:53,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:53,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 04:53:53,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:54 [2018-01-30 04:53:53,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:53:53,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2018-01-30 04:53:53,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:53:53,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-30 04:53:53,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:65, output treesize:64 [2018-01-30 04:54:01,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:01,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2018-01-30 04:54:01,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:54:01,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-30 04:54:01,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:75, output treesize:74 [2018-01-30 04:54:48,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:54:48,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 196 [2018-01-30 04:54:48,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:54:48,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-30 04:54:48,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 Received shutdown request... [2018-01-30 04:54:58,436 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 04:54:58,436 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 04:54:58,439 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 04:54:58,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:54:58 BasicIcfg [2018-01-30 04:54:58,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 04:54:58,440 INFO L168 Benchmark]: Toolchain (without parser) took 81707.80 ms. Allocated memory was 148.9 MB in the beginning and 326.6 MB in the end (delta: 177.7 MB). Free memory was 113.8 MB in the beginning and 153.9 MB in the end (delta: -40.1 MB). Peak memory consumption was 137.6 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,440 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 04:54:58,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 101.54 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,441 INFO L168 Benchmark]: Boogie Preprocessor took 18.15 ms. Allocated memory is still 148.9 MB. Free memory was 105.7 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,441 INFO L168 Benchmark]: RCFGBuilder took 269.91 ms. Allocated memory is still 148.9 MB. Free memory was 103.9 MB in the beginning and 92.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,441 INFO L168 Benchmark]: IcfgTransformer took 10.91 ms. Allocated memory is still 148.9 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,441 INFO L168 Benchmark]: TraceAbstraction took 81304.87 ms. Allocated memory was 148.9 MB in the beginning and 326.6 MB in the end (delta: 177.7 MB). Free memory was 90.6 MB in the beginning and 153.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 114.4 MB. Max. memory is 5.3 GB. [2018-01-30 04:54:58,442 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 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 101.54 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.15 ms. Allocated memory is still 148.9 MB. Free memory was 105.7 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 269.91 ms. Allocated memory is still 148.9 MB. Free memory was 103.9 MB in the beginning and 92.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 10.91 ms. Allocated memory is still 148.9 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 81304.87 ms. Allocated memory was 148.9 MB in the beginning and 326.6 MB in the end (delta: 177.7 MB). Free memory was 90.6 MB in the beginning and 153.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 114.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 81.2s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 562 SDtfs, 961 SDslu, 5210 SDs, 0 SdLazy, 6126 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1303 GetRequests, 810 SyntacticMatches, 14 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5900 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=17, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 224 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1780 ConstructedInterpolants, 48 QuantifiedInterpolants, 488441 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1349 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 31 InterpolantComputations, 3 PerfectInterpolantSequences, 565/2520 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/mlceu_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_04-54-58-446.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mlceu_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_04-54-58-446.csv Completed graceful shutdown