./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:20:16,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:20:16,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:20:16,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:20:16,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:20:16,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:20:16,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:20:16,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:20:16,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:20:16,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:20:16,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:20:16,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:20:16,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:20:16,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:20:16,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:20:16,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:20:16,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:20:16,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:20:16,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:20:16,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:20:16,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:20:16,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:20:16,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:20:16,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:20:16,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:20:16,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:20:16,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:20:16,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:20:16,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:20:16,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:20:16,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:20:16,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:20:16,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:20:16,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:20:16,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:20:16,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:20:16,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:20:16,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f71f01dc38efbcea276a0ff799d485cde0ac6c564de665d7efc24977838eb82a [2024-10-10 22:20:16,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:20:16,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:20:16,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:20:16,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:20:16,958 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:20:16,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c [2024-10-10 22:20:18,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:20:18,643 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:20:18,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c [2024-10-10 22:20:18,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ada4c6c45/6893180eb3374c3fa9e16328459ef8d8/FLAG1aad6bdf1 [2024-10-10 22:20:18,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ada4c6c45/6893180eb3374c3fa9e16328459ef8d8 [2024-10-10 22:20:18,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:20:18,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:20:18,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:20:18,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:20:18,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:20:18,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b6e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18, skipping insertion in model container [2024-10-10 22:20:18,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:20:18,887 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c[589,602] [2024-10-10 22:20:18,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:20:18,918 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:20:18,929 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c[589,602] [2024-10-10 22:20:18,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:20:18,949 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:20:18,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18 WrapperNode [2024-10-10 22:20:18,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:20:18,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:20:18,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:20:18,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:20:18,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,981 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-10-10 22:20:18,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:20:18,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:20:18,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:20:18,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:20:18,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:18,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,011 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-10 22:20:19,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:20:19,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:20:19,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:20:19,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:20:19,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (1/1) ... [2024-10-10 22:20:19,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:20:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:20:19,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:20:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-10 22:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:20:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:20:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:20:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:20:19,155 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:20:19,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:20:19,348 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-10 22:20:19,348 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:20:19,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:20:19,371 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 22:20:19,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:20:19 BoogieIcfgContainer [2024-10-10 22:20:19,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:20:19,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:20:19,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:20:19,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:20:19,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:20:18" (1/3) ... [2024-10-10 22:20:19,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4542690d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:20:19, skipping insertion in model container [2024-10-10 22:20:19,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:20:18" (2/3) ... [2024-10-10 22:20:19,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4542690d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:20:19, skipping insertion in model container [2024-10-10 22:20:19,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:20:19" (3/3) ... [2024-10-10 22:20:19,379 INFO L112 eAbstractionObserver]: Analyzing ICFG condnf.c [2024-10-10 22:20:19,392 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:20:19,392 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:20:19,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:20:19,457 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@603e77fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:20:19,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:20:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-10 22:20:19,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:20:19,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:20:19,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:20:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:20:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1236320892, now seen corresponding path program 1 times [2024-10-10 22:20:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:20:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339210564] [2024-10-10 22:20:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:20:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:20:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:20:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:20:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:20:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339210564] [2024-10-10 22:20:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339210564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:20:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:20:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:20:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935805420] [2024-10-10 22:20:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:20:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:20:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:20:19,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:20:19,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:20:19,671 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:20:19,695 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2024-10-10 22:20:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:20:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-10 22:20:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:20:19,704 INFO L225 Difference]: With dead ends: 33 [2024-10-10 22:20:19,704 INFO L226 Difference]: Without dead ends: 15 [2024-10-10 22:20:19,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:20:19,709 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:20:19,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:20:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-10 22:20:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-10 22:20:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-10 22:20:19,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2024-10-10 22:20:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:20:19,737 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-10 22:20:19,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-10 22:20:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-10 22:20:19,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:20:19,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:20:19,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:20:19,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:20:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:20:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -556262522, now seen corresponding path program 1 times [2024-10-10 22:20:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:20:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365681627] [2024-10-10 22:20:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:20:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:20:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:20:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:20:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:20:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365681627] [2024-10-10 22:20:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365681627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:20:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:20:19,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:20:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131266285] [2024-10-10 22:20:19,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:20:19,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:20:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:20:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:20:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:20:19,905 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:20:19,975 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-10 22:20:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:20:19,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-10 22:20:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:20:19,976 INFO L225 Difference]: With dead ends: 34 [2024-10-10 22:20:19,976 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:20:19,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:20:19,978 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:20:19,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:20:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:20:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2024-10-10 22:20:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-10 22:20:19,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-10-10 22:20:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:20:19,987 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-10 22:20:19,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:20:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-10 22:20:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:20:19,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:20:19,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:20:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:20:19,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:20:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:20:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash -157564324, now seen corresponding path program 1 times [2024-10-10 22:20:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:20:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673418913] [2024-10-10 22:20:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:20:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:20:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:20:20,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:20:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:20:20,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:20:20,110 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:20:20,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:20:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:20:20,119 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-10 22:20:20,148 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:20:20,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:20:20 BoogieIcfgContainer [2024-10-10 22:20:20,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:20:20,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:20:20,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:20:20,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:20:20,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:20:19" (3/4) ... [2024-10-10 22:20:20,161 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 22:20:20,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:20:20,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:20:20,199 INFO L158 Benchmark]: Toolchain (without parser) took 1533.61ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 88.1MB in the end (delta: 454.1kB). Peak memory consumption was 796.4kB. Max. memory is 16.1GB. [2024-10-10 22:20:20,200 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:20:20,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 75.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 163.6MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,201 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 163.6MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,201 INFO L158 Benchmark]: RCFGBuilder took 348.13ms. Allocated memory is still 163.6MB. Free memory was 71.9MB in the beginning and 129.2MB in the end (delta: -57.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,202 INFO L158 Benchmark]: TraceAbstraction took 783.51ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 90.2MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,202 INFO L158 Benchmark]: Witness Printer took 41.20ms. Allocated memory is still 163.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:20:20,204 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 75.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 163.6MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 163.6MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.13ms. Allocated memory is still 163.6MB. Free memory was 71.9MB in the beginning and 129.2MB in the end (delta: -57.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 783.51ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 90.2MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 41.20ms. Allocated memory is still 163.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] int *a = malloc(sizeof(int)*N); [L30] i=0 VAL [N=1, a={-1:0}, i=0] [L30] COND TRUE i N [L38] EXPR a[i] [L38] a[i] = a[i] [L35] i++ VAL [N=1, a={-1:0}, i=1] [L35] COND FALSE !(i