java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:19:01,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:19:01,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:19:01,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:19:01,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:19:01,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:19:01,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:19:01,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:19:01,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:19:01,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:19:01,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:19:01,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:19:01,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:19:01,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:19:01,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:19:01,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:19:01,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:19:01,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:19:01,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:19:01,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:19:01,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:19:01,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:19:01,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:19:01,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:19:01,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:19:01,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:19:01,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:19:01,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:19:01,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:19:01,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:19:01,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:19:01,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:19:01,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:19:01,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:19:01,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:19:01,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:19:01,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:19:01,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:19:01,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:19:01,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:19:01,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:19:01,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:19:01,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:19:01,461 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:19:01,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:19:01,461 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:19:01,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:19:01,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:19:01,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:19:01,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:19:01,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:19:01,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:19:01,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:19:01,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:19:01,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:19:01,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:19:01,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:19:01,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:19:01,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:19:01,465 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:19:01,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:19:01,465 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:19:01,465 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:19:01,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:19:01,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:19:01,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:19:01,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:19:01,552 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:19:01,552 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:19:01,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-19 16:19:01,900 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c65493f/813e4ee8d8d143c4ae4d0f49adbd4618/FLAG93545df68 [2018-09-19 16:19:02,093 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:19:02,094 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231a_true-unreach-call.c [2018-09-19 16:19:02,104 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c65493f/813e4ee8d8d143c4ae4d0f49adbd4618/FLAG93545df68 [2018-09-19 16:19:02,128 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c65493f/813e4ee8d8d143c4ae4d0f49adbd4618 [2018-09-19 16:19:02,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:19:02,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:19:02,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:02,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:19:02,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:19:02,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3e83e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02, skipping insertion in model container [2018-09-19 16:19:02,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,177 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:19:02,452 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:02,475 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:19:02,503 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:02,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02 WrapperNode [2018-09-19 16:19:02,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:02,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:19:02,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:19:02,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:19:02,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... [2018-09-19 16:19:02,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:19:02,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:19:02,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:19:02,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:19:02,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (1/1) ... No working directory specified, using /storage/repos/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-09-19 16:19:02,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:19:02,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:19:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:19:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-19 16:19:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-19 16:19:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:19:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:19:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:19:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:19:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-19 16:19:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:19:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:19:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:19:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:19:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-19 16:19:02,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:19:02,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:19:03,146 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:03,179 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:03,200 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:03,353 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:19:03,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:03 BoogieIcfgContainer [2018-09-19 16:19:03,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:19:03,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:19:03,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:19:03,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:19:03,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:19:02" (1/3) ... [2018-09-19 16:19:03,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f03b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:03, skipping insertion in model container [2018-09-19 16:19:03,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:02" (2/3) ... [2018-09-19 16:19:03,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f03b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:03, skipping insertion in model container [2018-09-19 16:19:03,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:03" (3/3) ... [2018-09-19 16:19:03,364 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231a_true-unreach-call.c [2018-09-19 16:19:03,374 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:19:03,384 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:19:03,439 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:19:03,440 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:19:03,440 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:19:03,440 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:19:03,440 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:19:03,443 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:19:03,443 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:19:03,443 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:19:03,443 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:19:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-19 16:19:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 16:19:03,487 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:03,488 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:03,496 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -883733309, now seen corresponding path program 1 times [2018-09-19 16:19:03,520 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:03,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:03,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:03,632 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:03,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:03,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:19:03,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:19:03,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:19:03,670 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:19:03,672 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-19 16:19:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:03,698 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-19 16:19:03,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:19:03,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-19 16:19:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:03,710 INFO L225 Difference]: With dead ends: 88 [2018-09-19 16:19:03,710 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:03,714 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-09-19 16:19:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-19 16:19:03,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-19 16:19:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:03,764 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-19 16:19:03,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:19:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-19 16:19:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-19 16:19:03,767 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:03,767 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:03,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2016097883, now seen corresponding path program 1 times [2018-09-19 16:19:03,769 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:03,769 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:03,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:03,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:03,989 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:03,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:03,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:03,993 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:03,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:03,995 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-19 16:19:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:04,132 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-19 16:19:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:04,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-19 16:19:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:04,140 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:04,140 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:04,142 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:04,163 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-19 16:19:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:04,164 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:04,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-19 16:19:04,168 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:04,168 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:04,169 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1374149908, now seen corresponding path program 1 times [2018-09-19 16:19:04,170 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:04,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:04,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:04,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:04,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:04,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:04,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:04,333 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:04,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,333 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:04,426 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:04,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:04,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-19 16:19:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:04,429 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:04,430 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:04,430 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:04,439 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-19 16:19:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:04,440 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:04,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 16:19:04,442 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:04,442 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:04,442 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1588482423, now seen corresponding path program 1 times [2018-09-19 16:19:04,443 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:04,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:04,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:04,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:04,574 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:04,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:04,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:04,575 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:04,575 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,575 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:04,754 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:04,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:04,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-19 16:19:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:04,756 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:04,757 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:04,757 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:04,765 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-19 16:19:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:04,766 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:04,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:04,768 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:04,768 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:04,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1717260944, now seen corresponding path program 1 times [2018-09-19 16:19:04,769 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:04,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:04,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:04,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:04,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:04,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:04,940 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:04,940 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,941 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:04,993 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:04,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:04,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-19 16:19:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:04,996 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:04,996 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:04,997 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:05,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-19 16:19:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:05,005 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:05,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:05,007 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:05,007 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:05,007 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -90193519, now seen corresponding path program 1 times [2018-09-19 16:19:05,008 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:05,008 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:05,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:19:05,678 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:05,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:05,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:19:05,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:19:05,696 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:19:05,696 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:19:05,696 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-09-19 16:19:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:06,848 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-19 16:19:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 16:19:06,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-19 16:19:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:06,850 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:06,850 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:06,851 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-19 16:19:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-09-19 16:19:06,859 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-09-19 16:19:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:06,859 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-09-19 16:19:06,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:19:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-09-19 16:19:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-19 16:19:06,861 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:06,862 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:06,862 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash -429778258, now seen corresponding path program 1 times [2018-09-19 16:19:06,863 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:06,863 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:06,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:06,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:07,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:07,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:07,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:07,031 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:07,031 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:07,031 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-09-19 16:19:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:07,121 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-19 16:19:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:07,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-19 16:19:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:07,123 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:07,123 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:07,123 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-19 16:19:07,130 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 58 [2018-09-19 16:19:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:07,131 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-19 16:19:07,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-19 16:19:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-19 16:19:07,133 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:07,133 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:07,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:07,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1152900451, now seen corresponding path program 1 times [2018-09-19 16:19:07,135 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:07,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:07,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:07,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:07,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:07,332 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:07,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:07,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:07,334 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:07,334 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:07,334 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-19 16:19:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:07,391 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-19 16:19:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:07,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-19 16:19:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:07,393 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:07,394 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:07,394 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-19 16:19:07,401 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 59 [2018-09-19 16:19:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:07,401 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-19 16:19:07,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-19 16:19:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:07,403 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:07,403 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:07,404 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 831452585, now seen corresponding path program 1 times [2018-09-19 16:19:07,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:07,405 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:07,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:07,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:07,765 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:07,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:19:07,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:19:07,766 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:19:07,766 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:19:07,766 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-09-19 16:19:08,204 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-09-19 16:19:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:08,414 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-09-19 16:19:08,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:19:08,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-19 16:19:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:08,416 INFO L225 Difference]: With dead ends: 56 [2018-09-19 16:19:08,416 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:08,417 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:19:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-09-19 16:19:08,422 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 60 [2018-09-19 16:19:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:08,423 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-09-19 16:19:08,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:19:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-09-19 16:19:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:08,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:08,425 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:08,425 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1688507349, now seen corresponding path program 1 times [2018-09-19 16:19:08,425 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:08,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:08,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:08,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:08,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 11 treesize of output 10 [2018-09-19 16:19:08,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:08,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:08,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:08,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:08,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:08,695 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 16 treesize of output 4 [2018-09-19 16:19:08,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:08,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:08,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:08,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:09,260 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:09,757 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:19:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:09,789 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:09,803 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:09,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 16:19:09,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 16:19:09,804 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 16:19:09,804 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:19:09,804 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 13 states. [2018-09-19 16:19:12,247 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-19 16:19:12,609 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-19 16:19:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:12,886 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-09-19 16:19:12,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:19:12,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-09-19 16:19:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:12,888 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:12,889 INFO L226 Difference]: Without dead ends: 51 [2018-09-19 16:19:12,890 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:19:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-19 16:19:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-19 16:19:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:19:12,896 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-19 16:19:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:12,897 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:19:12,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 16:19:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:19:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:12,898 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:12,899 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:12,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash -734735214, now seen corresponding path program 1 times [2018-09-19 16:19:12,900 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:12,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:12,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:13,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:13,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:13,040 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:13,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:13,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:13,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:13,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:13,042 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:13,098 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-19 16:19:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:13,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-19 16:19:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:13,100 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:13,100 INFO L226 Difference]: Without dead ends: 54 [2018-09-19 16:19:13,100 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-19 16:19:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-19 16:19:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:19:13,108 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-19 16:19:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:13,111 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:19:13,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:19:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:13,112 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:13,112 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:13,113 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash -824232870, now seen corresponding path program 1 times [2018-09-19 16:19:13,113 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:13,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:13,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:13,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:13,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:13,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:13,595 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:13,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:13,596 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-19 16:19:14,092 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:19:14,451 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:19:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:14,580 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-09-19 16:19:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:19:14,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-19 16:19:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:14,582 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:14,582 INFO L226 Difference]: Without dead ends: 48 [2018-09-19 16:19:14,583 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-19 16:19:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-19 16:19:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-19 16:19:14,589 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-19 16:19:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-19 16:19:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-19 16:19:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:14,591 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:14,591 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:14,591 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 703601985, now seen corresponding path program 1 times [2018-09-19 16:19:14,592 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:14,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:14,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:14,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:14,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:14,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:14,750 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:14,750 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:14,751 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-09-19 16:19:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:14,817 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-09-19 16:19:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:14,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-19 16:19:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:14,818 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:14,818 INFO L226 Difference]: Without dead ends: 48 [2018-09-19 16:19:14,819 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-19 16:19:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-19 16:19:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-19 16:19:14,824 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-19 16:19:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:14,825 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-19 16:19:14,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-19 16:19:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:14,826 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:14,826 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:14,826 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1103852478, now seen corresponding path program 1 times [2018-09-19 16:19:14,827 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:14,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:14,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:14,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:14,986 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 11 treesize of output 10 [2018-09-19 16:19:14,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:15,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:15,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:15,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:15,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:15,125 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 16 treesize of output 4 [2018-09-19 16:19:15,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:15,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:15,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:15,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:15,722 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-19 16:19:16,192 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:19:16,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:16,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/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-09-19 16:19:16,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:16,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:16,416 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:16,417 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:16,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:19:16,429 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:16,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:16,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:16,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:16,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:16,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:16,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:16,628 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:16,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:16,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:16,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:16,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:16,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:16,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:16,924 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 16:19:17,047 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:17,152 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:17,268 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:17,451 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:17,557 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:19:18,701 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-19 16:19:19,802 WARN L178 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-19 16:19:19,825 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:19,827 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:19,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:19,835 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:19,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:19,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:19,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:19,907 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:19,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:19,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:19,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:19,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:20,002 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:20,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:20,024 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:20,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:20,040 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:20,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:20,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:20,087 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:20,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:20,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:20,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:20,134 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:33 [2018-09-19 16:19:20,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:20,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-19 16:19:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:19:20,304 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:19:20,304 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:20,304 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-09-19 16:19:21,238 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:19:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:22,482 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-09-19 16:19:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:22,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-09-19 16:19:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:22,484 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:22,484 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:22,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:19:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-09-19 16:19:22,492 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 61 [2018-09-19 16:19:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:22,492 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-09-19 16:19:22,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:19:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-09-19 16:19:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 16:19:22,493 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:22,493 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:22,494 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1414810853, now seen corresponding path program 1 times [2018-09-19 16:19:22,494 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:22,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:22,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:22,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:22,671 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 11 treesize of output 10 [2018-09-19 16:19:22,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:22,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:22,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:22,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:22,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:22,736 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 16 treesize of output 4 [2018-09-19 16:19:22,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:22,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:22,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:22,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:23,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:23,361 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:23,686 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-19 16:19:24,142 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:19:24,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:24,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 16:19:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:24,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:24,603 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:24,604 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:24,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:19:24,627 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:24,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:24,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:24,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:24,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:24,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:24,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:24,806 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:24,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:24,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:24,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:24,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:24,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:25,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:25,649 WARN L178 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-19 16:19:25,912 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:26,166 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:26,177 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:26,181 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:26,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-09-19 16:19:26,189 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:26,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:26,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:26,433 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:26,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:26,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,588 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:26,590 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:26,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-19 16:19:26,599 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:26,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:26,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:26,666 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:26,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:26,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:26,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:26,732 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:101, output treesize:43 [2018-09-19 16:19:26,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:26,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-19 16:19:26,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:19:26,838 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:19:26,838 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:26,839 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-09-19 16:19:27,794 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-19 16:19:28,927 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:19:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:29,447 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-09-19 16:19:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:29,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-09-19 16:19:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:29,449 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:29,449 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:29,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:19:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-19 16:19:29,454 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 62 [2018-09-19 16:19:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:29,455 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-19 16:19:29,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:19:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-19 16:19:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 16:19:29,455 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:29,456 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:29,456 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1915066658, now seen corresponding path program 1 times [2018-09-19 16:19:29,456 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:29,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:29,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:29,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:29,614 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 11 treesize of output 10 [2018-09-19 16:19:29,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:29,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:29,808 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 16 treesize of output 4 [2018-09-19 16:19:29,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:29,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:29,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:30,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:30,349 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-19 16:19:30,667 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-09-19 16:19:30,796 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-19 16:19:31,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:31,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 16:19:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:31,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:31,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:31,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:31,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:19:31,260 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:31,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:31,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:31,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:31,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:31,429 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:31,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:31,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:31,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:31,952 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-19 16:19:32,264 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:19:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:32,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:32,995 WARN L178 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-09-19 16:19:33,349 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-19 16:19:33,464 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:33,762 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:33,879 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:33,897 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:33,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-19 16:19:33,907 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:33,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:33,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:33,977 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:33,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:33,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,084 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:34,087 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:34,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:34,095 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:34,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:34,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:34,153 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:34,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:34,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,161 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:34,196 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:38 [2018-09-19 16:19:34,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:34,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-09-19 16:19:34,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:19:34,294 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:19:34,294 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:19:34,294 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-09-19 16:19:35,886 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:19:36,197 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-19 16:19:37,583 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-19 16:19:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:37,737 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-19 16:19:37,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:19:37,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-19 16:19:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:37,739 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:37,739 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:37,740 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:19:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-19 16:19:37,745 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 63 [2018-09-19 16:19:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:37,746 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-19 16:19:37,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:19:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-19 16:19:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:19:37,746 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:37,747 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:37,747 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash 306391799, now seen corresponding path program 1 times [2018-09-19 16:19:37,747 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:37,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:37,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:37,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:37,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:37,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:37,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:19:37,939 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:37,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:37,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:37,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:38,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:38,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:38,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-19 16:19:38,143 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:38,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:19:38,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:38,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:38,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:19:38,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:19:38,294 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:38,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:19:38,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:38,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:38,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:38,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:19:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:40,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:41,581 WARN L178 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-19 16:19:41,738 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:42,069 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:42,415 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:42,615 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:19:42,853 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:19:42,988 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:19:43,036 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,058 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,083 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,106 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,108 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-09-19 16:19:43,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 132 [2018-09-19 16:19:43,226 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-19 16:19:43,233 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:43,234 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:43,234 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:43,236 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,238 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:43,440 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-19 16:19:43,442 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_30 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-19 16:19:43,446 INFO L168 Benchmark]: Toolchain (without parser) took 41301.63 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 848.8 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -220.5 MB). Peak memory consumption was 628.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:43,447 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:43,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.94 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:43,448 INFO L168 Benchmark]: Boogie Preprocessor took 76.69 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:19:43,448 INFO L168 Benchmark]: RCFGBuilder took 705.27 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:43,449 INFO L168 Benchmark]: TraceAbstraction took 40089.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 111.7 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Peak memory consumption was 646.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:19:43,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 422.94 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.69 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 705.27 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40089.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 111.7 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Peak memory consumption was 646.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_30 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...