./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condnf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condnf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:23:31,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:23:31,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:23:31,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:23:31,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:23:31,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:23:31,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:23:31,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:23:31,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:23:31,772 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:23:31,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:23:31,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:23:31,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:23:31,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:23:31,773 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:23:31,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:23:31,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:23:31,774 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:23:31,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:23:31,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:23:31,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:23:31,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:23:31,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:23:31,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:23:31,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:23:31,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:23:31,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:23:31,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:23:31,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:23:31,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:23:31,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:23:31,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:23:31,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:23:31,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:23:31,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:23:31,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:23:31,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:23:31,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:23:31,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:23:31,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:23:31,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:23:31,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:23:31,781 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/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/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-11-18 09:23:31,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:23:32,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:23:32,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:23:32,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:23:32,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:23:32,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condnf.c [2024-11-18 09:23:33,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:23:33,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:23:33,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condnf.c [2024-11-18 09:23:33,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bcdaaf0/aeddc8c79a5d41ae8ade6fa92f9a4478/FLAG704492f1d [2024-11-18 09:23:33,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bcdaaf0/aeddc8c79a5d41ae8ade6fa92f9a4478 [2024-11-18 09:23:33,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:23:33,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:23:33,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:23:33,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:23:33,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:23:33,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:23:33" (1/1) ... [2024-11-18 09:23:33,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c7f502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:33, skipping insertion in model container [2024-11-18 09:23:34,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:23:33" (1/1) ... [2024-11-18 09:23:34,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:23:34,171 WARN L250 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-11-18 09:23:34,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:23:34,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:23:34,208 WARN L250 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-11-18 09:23:34,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:23:34,233 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:23:34,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34 WrapperNode [2024-11-18 09:23:34,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:23:34,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:23:34,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:23:34,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:23:34,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,284 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-18 09:23:34,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:23:34,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:23:34,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:23:34,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:23:34,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,314 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-11-18 09:23:34,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:23:34,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:23:34,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:23:34,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:23:34,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (1/1) ... [2024-11-18 09:23:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:23:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:23:34,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:23:34,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 09:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 09:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 09:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 09:23:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:23:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:23:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 09:23:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 09:23:34,536 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:23:34,538 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:23:34,662 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 09:23:34,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:23:34,671 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:23:34,672 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 09:23:34,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:23:34 BoogieIcfgContainer [2024-11-18 09:23:34,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:23:34,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:23:34,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:23:34,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:23:34,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:23:33" (1/3) ... [2024-11-18 09:23:34,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:23:34, skipping insertion in model container [2024-11-18 09:23:34,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:23:34" (2/3) ... [2024-11-18 09:23:34,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:23:34, skipping insertion in model container [2024-11-18 09:23:34,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:23:34" (3/3) ... [2024-11-18 09:23:34,678 INFO L112 eAbstractionObserver]: Analyzing ICFG condnf.c [2024-11-18 09:23:34,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:23:34,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:23:34,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:23:34,742 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;@1db5ba38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:23:34,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:23:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-11-18 09:23:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:23:34,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:23:34,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:23:34,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:23:34,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:23:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2024-11-18 09:23:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:23:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329389258] [2024-11-18 09:23:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:23:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:23:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:23:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:23:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:23:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329389258] [2024-11-18 09:23:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329389258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:23:34,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:23:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:23:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010119626] [2024-11-18 09:23:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:23:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:23:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:23:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:23:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:23:34,909 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-18 09:23:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:23:34,920 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2024-11-18 09:23:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:23:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-18 09:23:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:23:34,927 INFO L225 Difference]: With dead ends: 40 [2024-11-18 09:23:34,928 INFO L226 Difference]: Without dead ends: 18 [2024-11-18 09:23:34,930 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-11-18 09:23:34,933 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:23:34,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:23:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-18 09:23:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-18 09:23:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11-18 09:23:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-18 09:23:34,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-11-18 09:23:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:23:34,958 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-18 09:23:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-18 09:23:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-18 09:23:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:23:34,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:23:34,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:23:34,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:23:34,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:23:34,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:23:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2024-11-18 09:23:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:23:34,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049762714] [2024-11-18 09:23:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:23:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:23:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:23:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:23:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:23:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049762714] [2024-11-18 09:23:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049762714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:23:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:23:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:23:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710700741] [2024-11-18 09:23:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:23:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:23:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:23:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:23:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:23:35,115 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-18 09:23:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:23:35,188 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-18 09:23:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:23:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-18 09:23:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:23:35,190 INFO L225 Difference]: With dead ends: 40 [2024-11-18 09:23:35,190 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 09:23:35,191 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-11-18 09:23:35,191 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:23:35,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:23:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 09:23:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2024-11-18 09:23:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-11-18 09:23:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-18 09:23:35,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2024-11-18 09:23:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:23:35,204 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-18 09:23:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-18 09:23:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-18 09:23:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 09:23:35,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:23:35,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:23:35,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:23:35,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:23:35,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:23:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2024-11-18 09:23:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:23:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731111288] [2024-11-18 09:23:35,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:23:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:23:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:23:35,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:23:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:23:35,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:23:35,336 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:23:35,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:23:35,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:23:35,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 09:23:35,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:23:35,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:23:35 BoogieIcfgContainer [2024-11-18 09:23:35,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:23:35,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:23:35,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:23:35,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:23:35,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:23:34" (3/4) ... [2024-11-18 09:23:35,407 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 09:23:35,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:23:35,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:23:35,480 INFO L158 Benchmark]: Toolchain (without parser) took 1488.77ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 71.3MB in the beginning and 172.6MB in the end (delta: -101.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:23:35,480 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:23:35,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 58.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.52ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 113.8MB in the end (delta: -55.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,487 INFO L158 Benchmark]: Boogie Preprocessor took 64.88ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 113.8MB in the beginning and 179.4MB in the end (delta: -65.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,488 INFO L158 Benchmark]: RCFGBuilder took 319.68ms. Allocated memory is still 207.6MB. Free memory was 179.4MB in the beginning and 166.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,488 INFO L158 Benchmark]: TraceAbstraction took 731.67ms. Allocated memory is still 207.6MB. Free memory was 165.7MB in the beginning and 175.0MB in the end (delta: -9.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,488 INFO L158 Benchmark]: Witness Printer took 73.56ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 172.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:23:35,490 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.17ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 58.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.52ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 113.8MB in the end (delta: -55.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.88ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 113.8MB in the beginning and 179.4MB in the end (delta: -65.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * RCFGBuilder took 319.68ms. Allocated memory is still 207.6MB. Free memory was 179.4MB in the beginning and 166.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 731.67ms. Allocated memory is still 207.6MB. Free memory was 165.7MB in the beginning and 175.0MB in the end (delta: -9.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 73.56ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 172.6MB in the end (delta: 2.3MB). 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; VAL [N=0] [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