java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 20:27:44,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 20:27:44,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 20:27:44,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 20:27:44,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 20:27:44,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 20:27:44,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 20:27:44,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 20:27:44,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 20:27:44,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 20:27:44,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 20:27:44,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 20:27:44,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 20:27:44,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 20:27:44,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 20:27:44,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 20:27:44,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 20:27:44,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 20:27:44,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 20:27:44,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 20:27:44,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 20:27:44,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 20:27:44,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 20:27:44,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 20:27:44,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 20:27:44,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 20:27:44,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 20:27:44,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 20:27:44,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 20:27:44,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 20:27:44,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 20:27:44,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 20:27:44,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 20:27:44,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 20:27:44,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 20:27:44,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 20:27:44,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf [2018-07-23 20:27:44,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 20:27:44,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 20:27:44,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 20:27:44,335 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-23 20:27:44,335 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-23 20:27:44,335 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-23 20:27:44,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-23 20:27:44,336 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-23 20:27:44,336 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-23 20:27:44,336 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-23 20:27:44,336 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-23 20:27:44,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 20:27:44,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 20:27:44,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 20:27:44,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 20:27:44,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 20:27:44,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 20:27:44,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 20:27:44,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 20:27:44,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 20:27:44,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 20:27:44,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 20:27:44,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 20:27:44,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 20:27:44,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 20:27:44,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 20:27:44,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 20:27:44,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-07-23 20:27:44,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 20:27:44,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 20:27:44,342 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 20:27:44,342 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 20:27:44,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-23 20:27:44,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 20:27:44,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 20:27:44,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 20:27:44,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 20:27:44,423 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 20:27:44,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-07-23 20:27:44,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f342ca1/ac7cfabe34dd406ebd200e3939b66808/FLAG60a538a94 [2018-07-23 20:27:45,079 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 20:27:45,080 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-07-23 20:27:45,113 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f342ca1/ac7cfabe34dd406ebd200e3939b66808/FLAG60a538a94 [2018-07-23 20:27:45,135 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86f342ca1/ac7cfabe34dd406ebd200e3939b66808 [2018-07-23 20:27:45,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 20:27:45,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 20:27:45,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 20:27:45,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 20:27:45,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 20:27:45,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:45,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77928ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45, skipping insertion in model container [2018-07-23 20:27:45,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:45,384 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 20:27:45,665 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:27:45,682 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 20:27:45,843 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:27:45,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45 WrapperNode [2018-07-23 20:27:45,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 20:27:45,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 20:27:45,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 20:27:45,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 20:27:45,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:45,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:45,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 20:27:45,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 20:27:45,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 20:27:45,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 20:27:45,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:45,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (1/1) ... [2018-07-23 20:27:46,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 20:27:46,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 20:27:46,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 20:27:46,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 20:27:46,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (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-07-23 20:27:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-23 20:27:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-23 20:27:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-23 20:27:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-23 20:27:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 20:27:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 20:27:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 20:27:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 20:27:49,531 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 20:27:49,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:27:49 BoogieIcfgContainer [2018-07-23 20:27:49,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 20:27:49,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 20:27:49,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 20:27:49,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 20:27:49,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 08:27:45" (1/3) ... [2018-07-23 20:27:49,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d112c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:27:49, skipping insertion in model container [2018-07-23 20:27:49,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:45" (2/3) ... [2018-07-23 20:27:49,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d112c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:27:49, skipping insertion in model container [2018-07-23 20:27:49,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:27:49" (3/3) ... [2018-07-23 20:27:49,549 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-07-23 20:27:49,562 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 20:27:49,575 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 20:27:49,646 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 20:27:49,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 20:27:49,648 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 20:27:49,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 20:27:49,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 20:27:49,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 20:27:49,649 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 20:27:49,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 20:27:49,649 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 20:27:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-23 20:27:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-23 20:27:49,708 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:49,713 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:49,713 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1868962523, now seen corresponding path program 1 times [2018-07-23 20:27:49,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:49,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:50,407 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:50,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 20:27:50,408 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:50,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 20:27:50,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 20:27:50,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:50,433 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-23 20:27:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:52,086 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-07-23 20:27:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 20:27:52,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-07-23 20:27:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:52,111 INFO L225 Difference]: With dead ends: 621 [2018-07-23 20:27:52,111 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 20:27:52,118 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 20:27:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-07-23 20:27:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 20:27:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-07-23 20:27:52,226 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 121 [2018-07-23 20:27:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:52,229 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-07-23 20:27:52,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 20:27:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-07-23 20:27:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 20:27:52,242 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:52,242 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:52,243 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 407166394, now seen corresponding path program 1 times [2018-07-23 20:27:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:52,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:52,246 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:52,770 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:52,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:27:52,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:52,773 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:27:52,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:27:52,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:52,774 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-07-23 20:27:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:54,394 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-07-23 20:27:54,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:27:54,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-07-23 20:27:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:54,400 INFO L225 Difference]: With dead ends: 901 [2018-07-23 20:27:54,400 INFO L226 Difference]: Without dead ends: 380 [2018-07-23 20:27:54,407 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-23 20:27:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-23 20:27:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-23 20:27:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-07-23 20:27:54,432 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 130 [2018-07-23 20:27:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:54,432 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-07-23 20:27:54,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:27:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-07-23 20:27:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-23 20:27:54,436 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:54,437 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:54,437 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 794699707, now seen corresponding path program 1 times [2018-07-23 20:27:54,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:54,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:54,704 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:54,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 20:27:54,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:54,705 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 20:27:54,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 20:27:54,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 20:27:54,706 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-07-23 20:27:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:55,569 INFO L93 Difference]: Finished difference Result 758 states and 1276 transitions. [2018-07-23 20:27:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 20:27:55,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-07-23 20:27:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:55,581 INFO L225 Difference]: With dead ends: 758 [2018-07-23 20:27:55,581 INFO L226 Difference]: Without dead ends: 384 [2018-07-23 20:27:55,583 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 20:27:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-07-23 20:27:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 370. [2018-07-23 20:27:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-07-23 20:27:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 593 transitions. [2018-07-23 20:27:55,615 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 593 transitions. Word has length 155 [2018-07-23 20:27:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:55,615 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 593 transitions. [2018-07-23 20:27:55,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 20:27:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 593 transitions. [2018-07-23 20:27:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 20:27:55,618 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:55,619 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:55,619 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 617541621, now seen corresponding path program 1 times [2018-07-23 20:27:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:55,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:55,774 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:55,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 20:27:55,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:55,775 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 20:27:55,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 20:27:55,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:55,776 INFO L87 Difference]: Start difference. First operand 370 states and 593 transitions. Second operand 3 states. [2018-07-23 20:27:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:57,949 INFO L93 Difference]: Finished difference Result 1030 states and 1713 transitions. [2018-07-23 20:27:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 20:27:57,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-07-23 20:27:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:57,960 INFO L225 Difference]: With dead ends: 1030 [2018-07-23 20:27:57,960 INFO L226 Difference]: Without dead ends: 666 [2018-07-23 20:27:57,963 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-07-23 20:27:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2018-07-23 20:27:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-07-23 20:27:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1029 transitions. [2018-07-23 20:27:57,995 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1029 transitions. Word has length 156 [2018-07-23 20:27:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1029 transitions. [2018-07-23 20:27:57,996 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 20:27:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1029 transitions. [2018-07-23 20:27:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 20:27:58,000 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:58,000 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:58,001 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1890546061, now seen corresponding path program 1 times [2018-07-23 20:27:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:58,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:58,122 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:58,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 20:27:58,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:58,123 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 20:27:58,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 20:27:58,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:58,124 INFO L87 Difference]: Start difference. First operand 663 states and 1029 transitions. Second operand 3 states. [2018-07-23 20:27:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:59,164 INFO L93 Difference]: Finished difference Result 1900 states and 3049 transitions. [2018-07-23 20:27:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 20:27:59,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-07-23 20:27:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:59,179 INFO L225 Difference]: With dead ends: 1900 [2018-07-23 20:27:59,180 INFO L226 Difference]: Without dead ends: 1243 [2018-07-23 20:27:59,184 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-07-23 20:27:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2018-07-23 20:27:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-07-23 20:27:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1894 transitions. [2018-07-23 20:27:59,223 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1894 transitions. Word has length 168 [2018-07-23 20:27:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:59,223 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1894 transitions. [2018-07-23 20:27:59,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 20:27:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1894 transitions. [2018-07-23 20:27:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-23 20:27:59,229 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:59,230 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:59,230 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1106991519, now seen corresponding path program 1 times [2018-07-23 20:27:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:59,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:59,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:59,485 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 20:27:59,486 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 20:27:59,487 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-07-23 20:27:59,489 INFO L201 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [196], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [637], [639], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-07-23 20:27:59,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-07-23 20:27:59,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-07-23 20:29:20,343 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-07-23 20:29:20,346 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-07-23 20:29:20,361 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-07-23 20:29:32,838 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 81.02% of their original sizes. [2018-07-23 20:29:32,838 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-07-23 20:29:36,989 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-07-23 20:29:36,990 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-23 20:29:36,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-07-23 20:29:36,991 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:36,992 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 20:29:36,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 20:29:36,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-07-23 20:29:36,993 INFO L87 Difference]: Start difference. First operand 1243 states and 1894 transitions. Second operand 16 states. [2018-07-23 20:29:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 20:29:38,241 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:148) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:86) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:370) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:141) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:309) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:343) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:240) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:641) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:570) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:367) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:119) 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-07-23 20:29:38,247 INFO L168 Benchmark]: Toolchain (without parser) took 113097.02 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -964.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-23 20:29:38,249 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 20:29:38,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:38,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 20:29:38,253 INFO L168 Benchmark]: Boogie Preprocessor took 226.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.0 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:38,255 INFO L168 Benchmark]: RCFGBuilder took 3324.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:38,256 INFO L168 Benchmark]: TraceAbstraction took 108706.40 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -297.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-23 20:29:38,263 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.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 226.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.0 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3324.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.6 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108706.40 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -297.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:148) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Taipan_Default-old.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_20-29-38-280.csv Received shutdown request...