/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:16:43,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:16:43,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:16:43,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:16:43,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:16:43,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:16:43,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:16:43,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:16:43,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:16:43,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:16:43,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:16:43,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:16:43,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:16:43,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:16:43,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:16:43,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:16:43,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:16:43,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:16:43,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:16:43,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:16:43,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:16:43,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:16:43,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:16:43,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:16:43,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:16:43,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:16:43,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:16:43,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:16:43,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:16:43,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:16:43,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:16:43,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:16:43,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:16:43,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:16:43,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:16:43,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:16:43,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:16:43,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:16:43,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:16:43,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:16:43,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:16:43,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:16:43,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:16:43,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:16:43,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:16:43,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:16:43,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:16:43,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:43,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:16:43,681 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:16:43,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:16:43,682 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:16:43,682 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:16:43,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:16:43,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:16:43,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:16:43,871 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:16:43,873 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:16:43,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-08 04:16:43,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0849aa74d/82dcfc2f00e74e4c8932b764e8943a6a/FLAGaafe2c6e3 [2022-04-08 04:16:44,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:16:44,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-08 04:16:44,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0849aa74d/82dcfc2f00e74e4c8932b764e8943a6a/FLAGaafe2c6e3 [2022-04-08 04:16:44,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0849aa74d/82dcfc2f00e74e4c8932b764e8943a6a [2022-04-08 04:16:44,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:16:44,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:16:44,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:44,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:16:44,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:16:44,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b02a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44, skipping insertion in model container [2022-04-08 04:16:44,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:16:44,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:16:44,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-08 04:16:44,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:44,430 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:16:44,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-08 04:16:44,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:44,456 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:16:44,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44 WrapperNode [2022-04-08 04:16:44,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:44,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:16:44,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:16:44,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:16:44,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:16:44,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:16:44,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:16:44,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:16:44,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (1/1) ... [2022-04-08 04:16:44,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:44,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:16:44,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:16:44,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:16:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:16:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:16:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:16:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:16:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:16:44,589 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:16:44,590 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:16:44,682 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:16:44,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:16:44,699 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 04:16:44,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:44 BoogieIcfgContainer [2022-04-08 04:16:44,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:16:44,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:16:44,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:16:44,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:16:44,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:16:44" (1/3) ... [2022-04-08 04:16:44,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa9674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:44, skipping insertion in model container [2022-04-08 04:16:44,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:44" (2/3) ... [2022-04-08 04:16:44,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa9674d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:44, skipping insertion in model container [2022-04-08 04:16:44,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:44" (3/3) ... [2022-04-08 04:16:44,720 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-08 04:16:44,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:16:44,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:16:44,751 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:16:44,755 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:16:44,755 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:16:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:16:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 04:16:44,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:44,772 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:44,772 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-08 04:16:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:44,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885760063] [2022-04-08 04:16:44,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-08 04:16:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980825769] [2022-04-08 04:16:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:44,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-08 04:16:44,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 04:16:44,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-08 04:16:44,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-08 04:16:44,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 04:16:44,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-08 04:16:44,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-08 04:16:44,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {23#true} is VALID [2022-04-08 04:16:44,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 04:16:44,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-08 04:16:44,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 04:16:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:16:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980825769] [2022-04-08 04:16:44,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980825769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:44,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:44,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:16:44,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:44,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885760063] [2022-04-08 04:16:44,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885760063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:44,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:44,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:16:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820828290] [2022-04-08 04:16:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:44,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 04:16:44,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:44,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:16:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:16:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:16:45,047 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,132 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-08 04:16:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:16:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 04:16:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 04:16:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 04:16:45,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-08 04:16:45,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,210 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:16:45,210 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 04:16:45,213 INFO L912 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 [2022-04-08 04:16:45,216 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:45,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:16:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 04:16:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 04:16:45,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:45,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,245 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,245 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,255 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 04:16:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 04:16:45,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:45,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:45,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 04:16:45,256 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 04:16:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,257 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 04:16:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 04:16:45,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:45,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:45,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:45,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-08 04:16:45,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-08 04:16:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:45,260 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-08 04:16:45,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-08 04:16:45,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 04:16:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 04:16:45,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:45,281 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:45,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:16:45,284 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-08 04:16:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:45,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851796012] [2022-04-08 04:16:45,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-08 04:16:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:45,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522708837] [2022-04-08 04:16:45,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:45,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-08 04:16:45,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 04:16:45,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-08 04:16:45,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:45,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-08 04:16:45,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 04:16:45,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-08 04:16:45,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-08 04:16:45,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {164#(= main_~a~0 0)} is VALID [2022-04-08 04:16:45,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-08 04:16:45,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-08 04:16:45,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-08 04:16:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:16:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522708837] [2022-04-08 04:16:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522708837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:45,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:45,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:45,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851796012] [2022-04-08 04:16:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851796012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:45,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959331385] [2022-04-08 04:16:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:45,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 04:16:45,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:45,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:16:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:45,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:16:45,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:16:45,388 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,456 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 04:16:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:16:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 04:16:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 04:16:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 04:16:45,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 04:16:45,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,485 INFO L225 Difference]: With dead ends: 24 [2022-04-08 04:16:45,485 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 04:16:45,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:16:45,488 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:45,489 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:16:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 04:16:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-08 04:16:45,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:45,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,520 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,521 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,524 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-08 04:16:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 04:16:45,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:45,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:45,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 04:16:45,526 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 04:16:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:45,528 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-08 04:16:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 04:16:45,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:45,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:45,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:45,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 04:16:45,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-08 04:16:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:45,531 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 04:16:45,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:45,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 04:16:45,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 04:16:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:16:45,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:45,572 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:45,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:16:45,573 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-08 04:16:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:45,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1170459824] [2022-04-08 04:16:45,674 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:16:45,675 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [v_main_~b~0_10, |v_main_#t~pre4_4|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:16:45,679 INFO L158 Benchmark]: Toolchain (without parser) took 1396.03ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 139.5MB in the beginning and 198.6MB in the end (delta: -59.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:45,679 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:45,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.45ms. Allocated memory is still 189.8MB. Free memory was 139.4MB in the beginning and 166.6MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:16:45,680 INFO L158 Benchmark]: Boogie Preprocessor took 17.70ms. Allocated memory is still 189.8MB. Free memory was 166.6MB in the beginning and 165.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:16:45,681 INFO L158 Benchmark]: RCFGBuilder took 224.53ms. Allocated memory is still 189.8MB. Free memory was 164.9MB in the beginning and 155.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 04:16:45,683 INFO L158 Benchmark]: TraceAbstraction took 975.78ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 154.5MB in the beginning and 198.6MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:45,689 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.45ms. Allocated memory is still 189.8MB. Free memory was 139.4MB in the beginning and 166.6MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.70ms. Allocated memory is still 189.8MB. Free memory was 166.6MB in the beginning and 165.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 224.53ms. Allocated memory is still 189.8MB. Free memory was 164.9MB in the beginning and 155.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 975.78ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 154.5MB in the beginning and 198.6MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [v_main_~b~0_10, |v_main_#t~pre4_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [v_main_~b~0_10, |v_main_#t~pre4_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:16:45,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...