/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:32:48,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:32:48,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:32:48,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:32:48,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:32:48,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:32:48,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:32:48,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:32:48,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:32:48,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:32:48,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:32:48,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:32:48,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:32:48,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:32:48,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:32:48,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:32:48,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:32:48,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:32:48,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:32:48,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:32:49,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:32:49,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:32:49,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:32:49,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:32:49,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:32:49,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:32:49,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:32:49,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:32:49,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:32:49,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:32:49,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:32:49,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:32:49,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:32:49,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:32:49,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:32:49,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:32:49,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:32:49,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:32:49,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:32:49,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:32:49,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:32:49,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:32:49,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:32:49,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:32:49,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:32:49,048 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:32:49,048 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:32:49,049 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:32:49,050 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:32:49,050 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:32:49,050 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:32:49,050 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:32:49,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:32:49,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:32:49,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:32:49,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:32:49,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:32:49,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:32:49,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:32:49,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:32:49,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:32:49,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:32:49,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:32:49,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:32:49,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:32:49,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:32:49,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:32:49,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:32:49,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:32:49,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:32:49,055 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:32:49,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:32:49,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:32:49,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:32:49,055 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:32:49,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:32:49,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:32:49,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:32:49,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:32:49,336 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:32:49,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-11-24 00:32:49,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd4b3a3/96158e063ce6408a867dad3b62869455/FLAG40d375e63 [2019-11-24 00:32:49,899 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:32:49,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-11-24 00:32:49,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd4b3a3/96158e063ce6408a867dad3b62869455/FLAG40d375e63 [2019-11-24 00:32:50,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd4b3a3/96158e063ce6408a867dad3b62869455 [2019-11-24 00:32:50,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:32:50,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:32:50,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:32:50,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:32:50,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:32:50,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e54d529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50, skipping insertion in model container [2019-11-24 00:32:50,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:32:50,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:32:50,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:32:50,764 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:32:50,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:32:50,857 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:32:50,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50 WrapperNode [2019-11-24 00:32:50,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:32:50,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:32:50,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:32:50,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:32:50,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:32:50,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:32:50,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:32:50,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:32:50,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (1/1) ... [2019-11-24 00:32:50,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:32:50,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:32:50,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:32:50,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:32:50,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (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 [2019-11-24 00:32:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:32:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:32:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:32:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:32:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:32:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:32:51,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:32:51,474 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:32:51,475 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-24 00:32:51,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:32:51 BoogieIcfgContainer [2019-11-24 00:32:51,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:32:51,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:32:51,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:32:51,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:32:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:32:50" (1/3) ... [2019-11-24 00:32:51,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178e6497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:32:51, skipping insertion in model container [2019-11-24 00:32:51,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:32:50" (2/3) ... [2019-11-24 00:32:51,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178e6497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:32:51, skipping insertion in model container [2019-11-24 00:32:51,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:32:51" (3/3) ... [2019-11-24 00:32:51,485 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-11-24 00:32:51,495 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:32:51,502 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-24 00:32:51,514 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-24 00:32:51,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:32:51,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:32:51,539 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:32:51,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:32:51,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:32:51,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:32:51,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:32:51,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:32:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-24 00:32:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:32:51,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:51,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:32:51,568 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:32:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 147457697, now seen corresponding path program 1 times [2019-11-24 00:32:51,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:51,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129767037] [2019-11-24 00:32:51,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:51,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129767037] [2019-11-24 00:32:51,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:51,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:32:51,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045491903] [2019-11-24 00:32:51,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:32:51,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:32:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:32:51,747 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-24 00:32:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:51,768 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2019-11-24 00:32:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:32:51,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:32:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:51,777 INFO L225 Difference]: With dead ends: 57 [2019-11-24 00:32:51,777 INFO L226 Difference]: Without dead ends: 24 [2019-11-24 00:32:51,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:32:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-24 00:32:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-24 00:32:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-24 00:32:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-24 00:32:51,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 5 [2019-11-24 00:32:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:51,813 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-24 00:32:51,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:32:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-24 00:32:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:32:51,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:51,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:32:51,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:32:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 235252948, now seen corresponding path program 1 times [2019-11-24 00:32:51,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:51,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511209777] [2019-11-24 00:32:51,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:51,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511209777] [2019-11-24 00:32:51,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:51,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:32:51,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792019377] [2019-11-24 00:32:51,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:32:51,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:32:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:32:51,964 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2019-11-24 00:32:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:52,057 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-24 00:32:52,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:32:52,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:32:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:52,059 INFO L225 Difference]: With dead ends: 39 [2019-11-24 00:32:52,059 INFO L226 Difference]: Without dead ends: 35 [2019-11-24 00:32:52,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:32:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-24 00:32:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-11-24 00:32:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-24 00:32:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-24 00:32:52,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2019-11-24 00:32:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:52,068 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-24 00:32:52,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:32:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-11-24 00:32:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 00:32:52,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:52,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:32:52,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:32:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -286379292, now seen corresponding path program 1 times [2019-11-24 00:32:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:52,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601991749] [2019-11-24 00:32:52,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:52,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601991749] [2019-11-24 00:32:52,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:52,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:32:52,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722068515] [2019-11-24 00:32:52,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:32:52,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:32:52,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:52,144 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-11-24 00:32:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:52,188 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-24 00:32:52,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:32:52,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 00:32:52,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:52,193 INFO L225 Difference]: With dead ends: 67 [2019-11-24 00:32:52,194 INFO L226 Difference]: Without dead ends: 46 [2019-11-24 00:32:52,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:32:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-24 00:32:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2019-11-24 00:32:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 00:32:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-24 00:32:52,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 9 [2019-11-24 00:32:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:52,211 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-24 00:32:52,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:32:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-24 00:32:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:32:52,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:52,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:32:52,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:32:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1137918744, now seen corresponding path program 1 times [2019-11-24 00:32:52,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:52,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216763939] [2019-11-24 00:32:52,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:52,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216763939] [2019-11-24 00:32:52,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:32:52,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:32:52,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854738048] [2019-11-24 00:32:52,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:32:52,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:32:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:32:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:32:52,475 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 5 states. [2019-11-24 00:32:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:32:52,628 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-11-24 00:32:52,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:32:52,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:32:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:32:52,630 INFO L225 Difference]: With dead ends: 42 [2019-11-24 00:32:52,630 INFO L226 Difference]: Without dead ends: 31 [2019-11-24 00:32:52,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:32:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-24 00:32:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-24 00:32:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 00:32:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-24 00:32:52,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 11 [2019-11-24 00:32:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:32:52,640 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-24 00:32:52,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:32:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-24 00:32:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 00:32:52,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:32:52,642 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:32:52,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:32:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:32:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 950804425, now seen corresponding path program 1 times [2019-11-24 00:32:52,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:32:52,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732827001] [2019-11-24 00:32:52,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:32:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:52,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732827001] [2019-11-24 00:32:52,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401371304] [2019-11-24 00:32:52,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:32:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:32:52,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 00:32:52,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:32:52,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:52,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 00:32:52,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:52,932 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-24 00:32:52,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:32:52,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:21 [2019-11-24 00:32:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:53,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:53,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 126 [2019-11-24 00:32:53,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:53,021 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2019-11-24 00:32:53,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:53,078 INFO L567 ElimStorePlain]: treesize reduction 109, result has 49.1 percent of original size [2019-11-24 00:32:53,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:32:53,148 INFO L343 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-11-24 00:32:53,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-11-24 00:32:53,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:53,181 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-11-24 00:32:53,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:32:53,183 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:231, output treesize:32 [2019-11-24 00:32:55,239 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-24 00:32:55,294 INFO L343 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-11-24 00:32:55,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-11-24 00:32:55,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:55,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:55,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:32:55,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-11-24 00:32:57,373 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_26|]} [2019-11-24 00:32:57,381 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:32:57,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:57,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:57,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-11-24 00:32:57,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:57,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:57,435 INFO L567 ElimStorePlain]: treesize reduction 11, result has 45.0 percent of original size [2019-11-24 00:32:57,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:32:57,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-11-24 00:32:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:57,439 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:32:57,452 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:32:57,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:57,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:32:57,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-11-24 00:32:57,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:32:57,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:32:57,483 INFO L496 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. [2019-11-24 00:32:57,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-11-24 00:32:57,499 INFO L377 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 7508 treesize of output 7476 [2019-11-24 00:32:57,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-24 00:32:58,115 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 44 [2019-11-24 00:32:58,118 INFO L567 ElimStorePlain]: treesize reduction 7356, result has 1.1 percent of original size [2019-11-24 00:32:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:32:58,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-24 00:32:58,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:143, output treesize:43 [2019-11-24 00:32:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:32:58,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [760112566] [2019-11-24 00:32:58,260 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-11-24 00:32:58,260 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:32:58,267 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:32:58,276 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:32:58,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:32:58,803 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:58,813 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:32:59,267 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-24 00:33:00,454 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-24 00:33:00,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-24 00:33:01,737 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-24 00:33:06,716 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-24 00:33:07,088 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-24 00:33:07,626 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-24 00:33:07,939 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-24 00:33:11,315 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:33:11,538 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-24 00:33:11,706 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-24 00:33:38,863 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-24 00:33:38,864 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: SMTLIBException [2019-11-24 00:33:39,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:33:39,066 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:92) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:53) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:393) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.generateInterpolants(SifaRunner.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2019-11-24 00:33:39,073 INFO L168 Benchmark]: Toolchain (without parser) took 48797.19 ms. Allocated memory was 139.5 MB in the beginning and 485.0 MB in the end (delta: 345.5 MB). Free memory was 101.9 MB in the beginning and 113.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 333.5 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,073 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 139.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 00:33:39,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.92 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 170.5 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.52 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 168.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,077 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 203.9 MB. Free memory was 168.6 MB in the beginning and 166.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,078 INFO L168 Benchmark]: RCFGBuilder took 525.45 ms. Allocated memory is still 203.9 MB. Free memory was 166.6 MB in the beginning and 139.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,078 INFO L168 Benchmark]: TraceAbstraction took 47592.20 ms. Allocated memory was 203.9 MB in the beginning and 485.0 MB in the end (delta: 281.0 MB). Free memory was 138.8 MB in the beginning and 113.8 MB in the end (delta: 24.9 MB). Peak memory consumption was 305.9 MB. Max. memory is 7.1 GB. [2019-11-24 00:33:39,081 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 139.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 582.92 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 170.5 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.52 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 168.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 203.9 MB. Free memory was 168.6 MB in the beginning and 166.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 525.45 ms. Allocated memory is still 203.9 MB. Free memory was 166.6 MB in the beginning and 139.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47592.20 ms. Allocated memory was 203.9 MB in the beginning and 485.0 MB in the end (delta: 281.0 MB). Free memory was 138.8 MB in the beginning and 113.8 MB in the end (delta: 24.9 MB). Peak memory consumption was 305.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...