./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/indp5f.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/indp5f.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 1aa1c5eebe5698e757084bc14ffc6aa65975acfbbb2e3cd0916dc71d3907dd29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:04:02,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:04:02,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:04:02,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:04:02,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:04:02,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:04:02,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:04:02,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:04:02,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:04:02,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:04:02,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:04:02,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:04:02,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:04:02,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:04:02,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:04:02,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:04:02,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:04:02,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:04:02,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:04:02,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:04:02,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:04:02,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:04:02,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:04:02,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:04:02,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:04:02,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:04:02,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:04:02,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:04:02,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:04:02,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:04:02,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:04:02,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:04:02,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:04:02,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:04:02,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:04:02,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:04:02,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:04:02,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:04:02,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:04:02,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:04:02,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:04:02,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:04:02,821 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 -> 1aa1c5eebe5698e757084bc14ffc6aa65975acfbbb2e3cd0916dc71d3907dd29 [2024-10-12 15:04:03,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:04:03,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:04:03,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:04:03,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:04:03,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:04:03,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5f.c [2024-10-12 15:04:04,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:04:04,656 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:04:04,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5f.c [2024-10-12 15:04:04,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56370b9d3/5b515a832a3b4ca59d57d6af3274554c/FLAGbaf3f68b5 [2024-10-12 15:04:04,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56370b9d3/5b515a832a3b4ca59d57d6af3274554c [2024-10-12 15:04:04,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:04:04,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:04:04,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:04:04,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:04:04,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:04:04,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:04,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78751408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04, skipping insertion in model container [2024-10-12 15:04:04,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:04,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:04:04,896 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/indp5f.c[589,602] [2024-10-12 15:04:04,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:04:04,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:04:04,945 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/indp5f.c[589,602] [2024-10-12 15:04:04,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:04:04,967 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:04:04,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04 WrapperNode [2024-10-12 15:04:04,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:04:04,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:04:04,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:04:04,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:04:04,976 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:04:04" (1/1) ... [2024-10-12 15:04:04,983 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:04:04" (1/1) ... [2024-10-12 15:04:05,005 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-10-12 15:04:05,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:04:05,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:04:05,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:04:05,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:04:05,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,041 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 8, 4]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 4, 2]. [2024-10-12 15:04:05,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:04:05,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:04:05,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:04:05,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:04:05,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (1/1) ... [2024-10-12 15:04:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:04:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:05,089 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:04:05,092 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:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 15:04:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 15:04:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 15:04:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:04:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:04:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 15:04:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 15:04:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 15:04:05,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 15:04:05,200 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:04:05,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:04:05,338 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 15:04:05,338 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:04:05,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:04:05,371 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 15:04:05,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:04:05 BoogieIcfgContainer [2024-10-12 15:04:05,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:04:05,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:04:05,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:04:05,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:04:05,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:04:04" (1/3) ... [2024-10-12 15:04:05,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2d47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:04:05, skipping insertion in model container [2024-10-12 15:04:05,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:04" (2/3) ... [2024-10-12 15:04:05,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2d47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:04:05, skipping insertion in model container [2024-10-12 15:04:05,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:04:05" (3/3) ... [2024-10-12 15:04:05,382 INFO L112 eAbstractionObserver]: Analyzing ICFG indp5f.c [2024-10-12 15:04:05,399 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:04:05,399 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:04:05,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:04:05,487 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;@3bfc976d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:04:05,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:04:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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:04:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 15:04:05,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:05,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:05,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:05,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash 191260487, now seen corresponding path program 1 times [2024-10-12 15:04:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029071630] [2024-10-12 15:04:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:05,688 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:04:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:05,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029071630] [2024-10-12 15:04:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029071630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:04:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:04:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:04:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908180751] [2024-10-12 15:04:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:04:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:04:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:04:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:04:05,722 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:04:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:05,764 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2024-10-12 15:04:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:04:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2024-10-12 15:04:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:05,774 INFO L225 Difference]: With dead ends: 37 [2024-10-12 15:04:05,774 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 15:04:05,777 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:04:05,782 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:05,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:04:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 15:04:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 15:04:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-10-12 15:04:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 15:04:05,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2024-10-12 15:04:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:05,818 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 15:04:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:04:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-12 15:04:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 15:04:05,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:05,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:04:05,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -991810415, now seen corresponding path program 1 times [2024-10-12 15:04:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502576518] [2024-10-12 15:04:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:06,027 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:04:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502576518] [2024-10-12 15:04:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502576518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:04:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:04:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:04:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808583923] [2024-10-12 15:04:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:04:06,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:04:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:04:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:04:06,032 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:04:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:06,097 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-10-12 15:04:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:04:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-10-12 15:04:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:06,098 INFO L225 Difference]: With dead ends: 34 [2024-10-12 15:04:06,098 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 15:04:06,099 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:04:06,100 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:06,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 15:04:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 15:04:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:04:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-12 15:04:06,109 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2024-10-12 15:04:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-12 15:04:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:04:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-12 15:04:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:04:06,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:06,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:06,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:04:06,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1464563934, now seen corresponding path program 1 times [2024-10-12 15:04:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905723353] [2024-10-12 15:04:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:04:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229694595] [2024-10-12 15:04:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:06,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:06,214 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:04:06,216 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:04:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:04:06,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:04:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:04:06,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 15:04:06,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:04:06,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:04:06,412 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:04:06,597 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:04:06,600 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 15:04:06,636 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:04:06,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:04:06 BoogieIcfgContainer [2024-10-12 15:04:06,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:04:06,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:04:06,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:04:06,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:04:06,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:04:05" (3/4) ... [2024-10-12 15:04:06,644 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 15:04:06,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:04:06,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:04:06,704 INFO L158 Benchmark]: Toolchain (without parser) took 2017.59ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 125.3MB in the beginning and 204.1MB in the end (delta: -78.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:04:06,704 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 147.4MB in the end (delta: 277.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:04:06,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.10ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 112.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:04:06,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.64ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 110.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:04:06,705 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 182.5MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:04:06,706 INFO L158 Benchmark]: RCFGBuilder took 310.21ms. Allocated memory is still 182.5MB. Free memory was 108.5MB in the beginning and 93.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:04:06,706 INFO L158 Benchmark]: TraceAbstraction took 1266.93ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 93.0MB in the beginning and 207.2MB in the end (delta: -114.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:04:06,706 INFO L158 Benchmark]: Witness Printer took 61.83ms. Allocated memory is still 243.3MB. Free memory was 207.2MB in the beginning and 204.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:04:06,712 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory was 147.7MB in the beginning and 147.4MB in the end (delta: 277.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.10ms. Allocated memory is still 182.5MB. Free memory was 125.3MB in the beginning and 112.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.64ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 110.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 182.5MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.21ms. Allocated memory is still 182.5MB. Free memory was 108.5MB in the beginning and 93.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1266.93ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 93.0MB in the beginning and 207.2MB in the end (delta: -114.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.83ms. Allocated memory is still 243.3MB. Free memory was 207.2MB in the beginning and 204.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long sum[1]; [L31] sum[0] = 1 [L32] i=0 VAL [N=1, a={-1:0}, i=0, sum={4:0}] [L32] COND TRUE i