./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/ss4f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.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 ec849c99676c748abc5b9766c44a36d723f69a872b4d768d06c539c74569bdf4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:09:19,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:09:19,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:09:19,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:09:19,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:09:19,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:09:19,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:09:19,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:09:19,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:09:19,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:09:19,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:09:19,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:09:19,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:09:19,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:09:19,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:09:19,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:09:19,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:09:19,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:09:19,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:09:19,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:09:19,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:09:19,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:09:19,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:09:19,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:09:19,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:09:19,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:09:19,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:09:19,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:09:19,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:09:19,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:09:19,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:09:19,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:09:19,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:09:19,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:09:19,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:09:19,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:09:19,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:09:19,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:09:19,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:09:19,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:09:19,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:09:19,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:09:19,733 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 -> ec849c99676c748abc5b9766c44a36d723f69a872b4d768d06c539c74569bdf4 [2024-10-12 15:09:20,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:09:20,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:09:20,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:09:20,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:09:20,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:09:20,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.c [2024-10-12 15:09:21,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:09:21,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:09:21,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss4f.c [2024-10-12 15:09:21,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcba054ea/e06bee0ce40e4e4cbbdcb88c1cd2c7b0/FLAGbd8431d12 [2024-10-12 15:09:21,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcba054ea/e06bee0ce40e4e4cbbdcb88c1cd2c7b0 [2024-10-12 15:09:21,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:09:21,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:09:21,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:09:21,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:09:21,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:09:21,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac024a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21, skipping insertion in model container [2024-10-12 15:09:21,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:09:21,856 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/ss4f.c[587,600] [2024-10-12 15:09:21,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:09:21,894 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:09:21,907 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/ss4f.c[587,600] [2024-10-12 15:09:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:09:21,937 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:09:21,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21 WrapperNode [2024-10-12 15:09:21,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:09:21,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:09:21,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:09:21,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:09:21,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,976 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-10-12 15:09:21,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:09:21,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:09:21,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:09:21,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:09:21,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:21,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,008 INFO L175 MemorySlicer]: Split 22 memory accesses to 4 slices as follows [2, 7, 8, 5]. 36 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 4, 2]. [2024-10-12 15:09:22,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:09:22,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:09:22,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:09:22,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:09:22,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (1/1) ... [2024-10-12 15:09:22,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:09:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:09:22,057 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-10-12 15:09:22,064 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-10-12 15:09:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:09:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:09:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 15:09:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 15:09:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 15:09:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 15:09:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:09:22,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 15:09:22,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 15:09:22,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 15:09:22,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 15:09:22,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:09:22,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:09:22,422 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-12 15:09:22,422 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:09:22,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:09:22,473 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 15:09:22,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:09:22 BoogieIcfgContainer [2024-10-12 15:09:22,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:09:22,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:09:22,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:09:22,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:09:22,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:09:21" (1/3) ... [2024-10-12 15:09:22,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26edbc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:09:22, skipping insertion in model container [2024-10-12 15:09:22,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:09:21" (2/3) ... [2024-10-12 15:09:22,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26edbc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:09:22, skipping insertion in model container [2024-10-12 15:09:22,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:09:22" (3/3) ... [2024-10-12 15:09:22,485 INFO L112 eAbstractionObserver]: Analyzing ICFG ss4f.c [2024-10-12 15:09:22,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:09:22,505 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:09:22,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:09:22,582 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;@2ce3ebfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:09:22,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:09:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-12 15:09:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 15:09:22,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:09:22,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:09:22,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:09:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:09:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1804282323, now seen corresponding path program 1 times [2024-10-12 15:09:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:09:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866796727] [2024-10-12 15:09:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:09:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:09:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:09:22,806 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-12 15:09:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:09:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866796727] [2024-10-12 15:09:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866796727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:09:22,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:09:22,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:09:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856236471] [2024-10-12 15:09:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:09:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:09:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:09:22,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:09:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:09:22,839 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-12 15:09:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:09:22,871 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2024-10-12 15:09:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:09:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2024-10-12 15:09:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:09:22,881 INFO L225 Difference]: With dead ends: 33 [2024-10-12 15:09:22,881 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 15:09:22,885 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-12 15:09:22,891 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:09:22,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:09:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 15:09:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-12 15:09:22,917 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-12 15:09:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-12 15:09:22,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 14 [2024-10-12 15:09:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:09:22,918 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-12 15:09:22,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-12 15:09:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-12 15:09:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 15:09:22,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:09:22,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:09:22,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:09:22,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:09:22,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:09:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2062269015, now seen corresponding path program 1 times [2024-10-12 15:09:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:09:22,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876583917] [2024-10-12 15:09:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:09:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:09:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:09:23,119 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-12 15:09:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:09:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876583917] [2024-10-12 15:09:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876583917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:09:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:09:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:09:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993681606] [2024-10-12 15:09:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:09:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:09:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:09:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:09:23,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:09:23,126 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-12 15:09:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:09:23,190 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-10-12 15:09:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:09:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-10-12 15:09:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:09:23,191 INFO L225 Difference]: With dead ends: 29 [2024-10-12 15:09:23,191 INFO L226 Difference]: Without dead ends: 19 [2024-10-12 15:09:23,192 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-12 15:09:23,193 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:09:23,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:09:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-12 15:09:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 15:09:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-12 15:09:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-12 15:09:23,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2024-10-12 15:09:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:09:23,200 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-12 15:09:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-12 15:09:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-12 15:09:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 15:09:23,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:09:23,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:09:23,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:09:23,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:09:23,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:09:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2115685972, now seen corresponding path program 1 times [2024-10-12 15:09:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:09:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963836136] [2024-10-12 15:09:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:09:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:09:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:09:23,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91647021] [2024-10-12 15:09:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:09:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:09:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:09:23,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:09:23,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:09:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:09:23,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:09:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:09:23,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 15:09:23,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:09:23,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:09:23,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:09:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:09:23,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 15:09:23,696 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:09:23,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:09:23 BoogieIcfgContainer [2024-10-12 15:09:23,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:09:23,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:09:23,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:09:23,705 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:09:23,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:09:22" (3/4) ... [2024-10-12 15:09:23,709 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 15:09:23,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:09:23,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:09:23,764 INFO L158 Benchmark]: Toolchain (without parser) took 2154.97ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 53.3MB in the end (delta: 35.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,764 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:09:23,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.01ms. Allocated memory is still 157.3MB. Free memory was 89.0MB in the beginning and 124.5MB in the end (delta: -35.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 123.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,765 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,766 INFO L158 Benchmark]: RCFGBuilder took 451.30ms. Allocated memory is still 157.3MB. Free memory was 120.4MB in the beginning and 105.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,766 INFO L158 Benchmark]: TraceAbstraction took 1228.30ms. Allocated memory is still 157.3MB. Free memory was 104.8MB in the beginning and 56.0MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,767 INFO L158 Benchmark]: Witness Printer took 58.79ms. Allocated memory is still 157.3MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:09:23,769 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.15ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.01ms. Allocated memory is still 157.3MB. Free memory was 89.0MB in the beginning and 124.5MB in the end (delta: -35.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 123.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 121.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.30ms. Allocated memory is still 157.3MB. Free memory was 120.4MB in the beginning and 105.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1228.30ms. Allocated memory is still 157.3MB. Free memory was 104.8MB in the beginning and 56.0MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 58.79ms. Allocated memory is still 157.3MB. Free memory was 56.0MB in the beginning and 53.3MB in the end (delta: 2.7MB). 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] long long sum[1]; [L29] long long *a = malloc(sizeof(long long)*N); [L31] sum[0] = 0 [L32] i=0 VAL [N=1, a={-1:0}, i=0, sum={4:0}] [L32] COND TRUE i