/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/loops/heavy-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:34:56,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:34:56,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:34:56,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:34:56,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:34:56,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:34:56,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:34:56,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:34:56,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:34:56,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:34:56,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:34:56,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:34:56,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:34:56,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:34:56,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:34:56,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:34:56,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:34:56,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:34:56,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:34:56,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:34:56,478 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:34:56,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:34:56,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:34:56,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:34:56,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:34:56,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:34:56,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:34:56,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:34:56,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:34:56,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:34:56,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:34:56,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:34:56,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:34:56,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:34:56,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:34:56,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:34:56,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:34:56,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:34:56,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:34:56,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:34:56,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:34:56,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:34:56,493 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 03:34:56,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:34:56,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:34:56,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:34:56,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:34:56,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:34:56,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:56,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:34:56,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:34:56,505 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:34:56,505 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:34:56,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:34:56,505 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:34:56,505 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 03:34:56,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:34:56,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:34:56,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:34:56,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:34:56,692 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:34:56,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-1.c [2022-04-08 03:34:56,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff96fc6c/c3f42c3da6654b2192f66cb83ff0c0ef/FLAG410ee23b0 [2022-04-08 03:34:57,046 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:34:57,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-1.c [2022-04-08 03:34:57,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff96fc6c/c3f42c3da6654b2192f66cb83ff0c0ef/FLAG410ee23b0 [2022-04-08 03:34:57,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff96fc6c/c3f42c3da6654b2192f66cb83ff0c0ef [2022-04-08 03:34:57,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:34:57,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:34:57,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:57,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:34:57,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:34:57,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c862b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57, skipping insertion in model container [2022-04-08 03:34:57,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:34:57,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:34:57,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-1.c[600,613] [2022-04-08 03:34:57,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,671 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:34:57,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-1.c[600,613] [2022-04-08 03:34:57,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:34:57,728 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:34:57,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57 WrapperNode [2022-04-08 03:34:57,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:34:57,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:34:57,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:34:57,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:34:57,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:34:57,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:34:57,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:34:57,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (1/1) ... [2022-04-08 03:34:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:34:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:34:57,787 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 03:34:57,794 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 03:34:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:34:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:34:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:34:57,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:34:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:34:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:34:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 03:34:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:34:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:34:57,861 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:34:57,862 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:34:58,015 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:34:58,020 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:34:58,020 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 03:34:58,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:58 BoogieIcfgContainer [2022-04-08 03:34:58,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:34:58,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:34:58,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:34:58,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:34:58,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:34:57" (1/3) ... [2022-04-08 03:34:58,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1162d66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:58, skipping insertion in model container [2022-04-08 03:34:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:34:57" (2/3) ... [2022-04-08 03:34:58,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1162d66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:34:58, skipping insertion in model container [2022-04-08 03:34:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:34:58" (3/3) ... [2022-04-08 03:34:58,027 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-1.c [2022-04-08 03:34:58,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:34:58,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:34:58,064 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:34:58,069 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 03:34:58,069 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:34:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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 03:34:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 03:34:58,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,110 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 1 times [2022-04-08 03:34:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1058045716] [2022-04-08 03:34:58,134 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 2 times [2022-04-08 03:34:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:58,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095006029] [2022-04-08 03:34:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-08 03:34:58,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:34:58,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-08 03:34:58,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:58,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-08 03:34:58,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:34:58,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-08 03:34:58,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2022-04-08 03:34:58,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2022-04-08 03:34:58,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-08 03:34:58,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 != ~a~0 % 4294967296; {23#false} is VALID [2022-04-08 03:34:58,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 03:34:58,350 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 03:34:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:58,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095006029] [2022-04-08 03:34:58,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095006029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:58,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1058045716] [2022-04-08 03:34:58,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1058045716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:34:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958420522] [2022-04-08 03:34:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:58,362 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 03:34:58,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:58,365 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 03:34:58,382 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 03:34:58,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:34:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:34:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:34:58,403 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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 03:34:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,518 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-08 03:34:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:34:58,518 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 03:34:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:58,520 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 03:34:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 03:34:58,528 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 03:34:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 03:34:58,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 03:34:58,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,626 INFO L225 Difference]: With dead ends: 42 [2022-04-08 03:34:58,627 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 03:34:58,629 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 03:34:58,634 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:58,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:34:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 03:34:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2022-04-08 03:34:58,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:58,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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 03:34:58,661 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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 03:34:58,661 INFO L87 Difference]: Start difference. First operand 23 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 03:34:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,666 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 03:34:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 03:34:58,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,667 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 23 states. [2022-04-08 03:34:58,668 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 23 states. [2022-04-08 03:34:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,670 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 03:34:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 03:34:58,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:58,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:58,672 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 03:34:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-08 03:34:58,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-08 03:34:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:58,674 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-08 03:34:58,675 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 03:34:58,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-08 03:34:58,689 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 03:34:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 03:34:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 03:34:58,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,690 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:34:58,693 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 1 times [2022-04-08 03:34:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113054935] [2022-04-08 03:34:58,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:34:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 2 times [2022-04-08 03:34:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:34:58,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639207291] [2022-04-08 03:34:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:34:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:34:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:34:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:34:58,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-08 03:34:58,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-08 03:34:58,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-08 03:34:58,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:34:58,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#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(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-08 03:34:58,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-08 03:34:58,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-08 03:34:58,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {190#true} is VALID [2022-04-08 03:34:58,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {195#(= main_~i~0 0)} is VALID [2022-04-08 03:34:58,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 1048576); {191#false} is VALID [2022-04-08 03:34:58,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume 0 != ~a~0 % 4294967296; {191#false} is VALID [2022-04-08 03:34:58,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-08 03:34:58,788 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 03:34:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:34:58,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639207291] [2022-04-08 03:34:58,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639207291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:58,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:34:58,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113054935] [2022-04-08 03:34:58,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113054935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:34:58,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:34:58,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:34:58,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666649196] [2022-04-08 03:34:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:34:58,791 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 03:34:58,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:34:58,791 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 03:34:58,802 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 03:34:58,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:34:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:34:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:34:58,804 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 03:34:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,903 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-08 03:34:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:34:58,903 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 03:34:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:34:58,904 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 03:34:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 03:34:58,906 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 03:34:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 03:34:58,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-08 03:34:58,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:34:58,943 INFO L225 Difference]: With dead ends: 36 [2022-04-08 03:34:58,943 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 03:34:58,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:34:58,946 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:34:58,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:34:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 03:34:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-08 03:34:58,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:34:58,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 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 03:34:58,955 INFO L74 IsIncluded]: Start isIncluded. First operand 33 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 03:34:58,955 INFO L87 Difference]: Start difference. First operand 33 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 03:34:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,956 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-08 03:34:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-08 03:34:58,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,957 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 33 states. [2022-04-08 03:34:58,957 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 33 states. [2022-04-08 03:34:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:34:58,958 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-08 03:34:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-08 03:34:58,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:34:58,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:34:58,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:34:58,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:34:58,959 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 03:34:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 03:34:58,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-08 03:34:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:34:58,960 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 03:34:58,960 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 03:34:58,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 03:34:58,973 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 03:34:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:34:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:34:58,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:34:58,974 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:34:58,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:34:58,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:34:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:34:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1310776898, now seen corresponding path program 1 times [2022-04-08 03:34:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:34:58,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501066175] [2022-04-08 03:34:59,084 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 03:34:59,085 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post4_4|, v_main_~j~0_9] 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 03:34:59,096 INFO L158 Benchmark]: Toolchain (without parser) took 1606.07ms. Allocated memory was 170.9MB in the beginning and 237.0MB in the end (delta: 66.1MB). Free memory was 112.0MB in the beginning and 169.6MB in the end (delta: -57.6MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-08 03:34:59,097 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory was 129.0MB in the beginning and 128.9MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:34:59,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.99ms. Allocated memory was 170.9MB in the beginning and 237.0MB in the end (delta: 66.1MB). Free memory was 111.9MB in the beginning and 174.7MB in the end (delta: -62.8MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-08 03:34:59,097 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 237.0MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:34:59,099 INFO L158 Benchmark]: RCFGBuilder took 255.57ms. Allocated memory is still 237.0MB. Free memory was 173.2MB in the beginning and 160.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 03:34:59,101 INFO L158 Benchmark]: TraceAbstraction took 1072.15ms. Allocated memory is still 237.0MB. Free memory was 159.5MB in the beginning and 169.6MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:34:59,102 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.11ms. Allocated memory is still 170.9MB. Free memory was 129.0MB in the beginning and 128.9MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.99ms. Allocated memory was 170.9MB in the beginning and 237.0MB in the end (delta: 66.1MB). Free memory was 111.9MB in the beginning and 174.7MB in the end (delta: -62.8MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 237.0MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.57ms. Allocated memory is still 237.0MB. Free memory was 173.2MB in the beginning and 160.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1072.15ms. Allocated memory is still 237.0MB. Free memory was 159.5MB in the beginning and 169.6MB in the end (delta: -10.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_#t~post4_4|, v_main_~j~0_9] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post4_4|, v_main_~j~0_9]: 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 03:34:59,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...