./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-006.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-006.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:02:24,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:02:24,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:02:24,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:02:24,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:02:24,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:02:24,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:02:24,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:02:24,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:02:24,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:02:24,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:02:24,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:02:24,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:02:24,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:02:24,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:02:24,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:02:24,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:02:24,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:02:24,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:24,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:24,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:24,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:24,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:02:24,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:24,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:02:24,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:02:24,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:02:24,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:02:24,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:02:24,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:02:24,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 5db620ad631bbb2b4f2f184a6694f3d470d0214c96a5cb4b6c65ad330c77841f [2025-01-09 05:02:25,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:02:25,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:02:25,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:02:25,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:02:25,136 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:02:25,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-006.c [2025-01-09 05:02:26,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613bfdb58/e3dc722e8e514bb4b2778971c4119ed6/FLAGe3b1b6881 [2025-01-09 05:02:26,742 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:02:26,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-006.c [2025-01-09 05:02:26,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613bfdb58/e3dc722e8e514bb4b2778971c4119ed6/FLAGe3b1b6881 [2025-01-09 05:02:26,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/613bfdb58/e3dc722e8e514bb4b2778971c4119ed6 [2025-01-09 05:02:26,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:02:26,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:02:26,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:26,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:02:26,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:02:26,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:26" (1/1) ... [2025-01-09 05:02:26,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ec56b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:26, skipping insertion in model container [2025-01-09 05:02:26,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:26" (1/1) ... [2025-01-09 05:02:26,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:02:26,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-006.c[3098,3111] [2025-01-09 05:02:26,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:26,961 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:02:26,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-006.c[3098,3111] [2025-01-09 05:02:26,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:27,006 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:02:27,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27 WrapperNode [2025-01-09 05:02:27,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:27,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:27,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:02:27,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:02:27,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,052 INFO L138 Inliner]: procedures = 13, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2025-01-09 05:02:27,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:27,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:02:27,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:02:27,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:02:27,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,077 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:02:27,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:02:27,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:02:27,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:02:27,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:02:27,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (1/1) ... [2025-01-09 05:02:27,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:27,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:02:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:02:27,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:02:27,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:02:27,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:02:27,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:02:27,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-01-09 05:02:27,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-01-09 05:02:27,203 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:02:27,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:02:27,442 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 05:02:27,442 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:02:27,456 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:02:27,458 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:02:27,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:27 BoogieIcfgContainer [2025-01-09 05:02:27,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:02:27,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:02:27,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:02:27,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:02:27,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:02:26" (1/3) ... [2025-01-09 05:02:27,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3ca4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:27, skipping insertion in model container [2025-01-09 05:02:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:27" (2/3) ... [2025-01-09 05:02:27,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3ca4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:27, skipping insertion in model container [2025-01-09 05:02:27,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:27" (3/3) ... [2025-01-09 05:02:27,470 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-006.c [2025-01-09 05:02:27,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:02:27,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-006.c that has 2 procedures, 79 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 05:02:27,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:02:27,550 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;@54a05ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:02:27,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:02:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 05:02:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 05:02:27,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:27,574 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:02:27,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:27,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1686358427, now seen corresponding path program 1 times [2025-01-09 05:02:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251546774] [2025-01-09 05:02:27,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:27,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 05:02:28,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 05:02:28,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:28,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:02:28,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 05:02:28,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 05:02:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 05:02:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 05:02:28,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 05:02:28,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 05:02:28,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 05:02:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:02:28,358 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 05:02:28,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 05:02:28,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 05:02:28 BoogieIcfgContainer [2025-01-09 05:02:28,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 05:02:28,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 05:02:28,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 05:02:28,457 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 05:02:28,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:27" (3/4) ... [2025-01-09 05:02:28,458 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 05:02:28,564 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 157. [2025-01-09 05:02:28,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 05:02:28,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 05:02:28,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 05:02:28,661 INFO L158 Benchmark]: Toolchain (without parser) took 1885.17ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 86.1MB in the end (delta: 35.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,663 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:02:28,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.40ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,664 INFO L158 Benchmark]: Boogie Preprocessor took 34.07ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 106.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 05:02:28,664 INFO L158 Benchmark]: RCFGBuilder took 367.61ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 91.2MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,664 INFO L158 Benchmark]: TraceAbstraction took 994.87ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 100.8MB in the end (delta: -9.9MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,665 INFO L158 Benchmark]: Witness Printer took 203.75ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 86.1MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 05:02:28,666 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.27ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.40ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.07ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 106.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.61ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 91.2MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 994.87ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 100.8MB in the end (delta: -9.9MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 203.75ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 86.1MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. 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: 113]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=1] [L30] CALL assume(var0 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 5) VAL [var0=1] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=1, var1=5] [L34] CALL assume(var1 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 5) VAL [var0=1, var1=5] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=1, var1=5, var2=0] [L38] CALL assume(var2 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 5) VAL [var0=1, var1=5, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=1, var1=5, var2=0, var3=3] [L42] CALL assume(var3 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 5) VAL [var0=1, var1=5, var2=0, var3=3] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=1, var1=5, var2=0, var3=3, var4=2] [L46] CALL assume(var4 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4] [L50] CALL assume(var5 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 1) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4] [L54] CALL assume(var6 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 1) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5] [L58] CALL assume(var7 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3] [L62] CALL assume(var8 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 1) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L66] CALL assume(var9 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 5) VAL [var0=1, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L70] CALL assume(var10 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L71] int myvar0 = 1; VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L72] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L72] RET assume(var0 != var1) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L73] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var0 != var2) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L74] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var0 != var3) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L75] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L75] RET assume(var0 != var4) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L76] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L76] RET assume(var0 != var5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L77] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var1 != var2) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L78] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var1 != var3) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L79] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L79] RET assume(var1 != var4) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L80] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L80] RET assume(var1 != var5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L81] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var2 != var3) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L82] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var2 != var4) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L83] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L83] RET assume(var2 != var5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L84] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L84] RET assume(var3 != var4) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L85] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var3 != var5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L86] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var4 != var5) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L87] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L87] RET assume(var6 != var7) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L88] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var6 != var8) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L89] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var6 != var9) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L90] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var6 != var10) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L91] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var7 != var8) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L92] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var7 != var9) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L93] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var7 != var10) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L94] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var8 != var9) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L95] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var8 != var10) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L96] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var9 != var10) VAL [var0=1, var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1] [L97] int var_for_abs; [L98] var_for_abs = var0 - var1 [L99] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=4] [L100] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var6 == var_for_abs) VAL [var10=2, var1=5, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=4] [L101] var_for_abs = var1 - var2 [L102] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=5] [L103] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var7 == var_for_abs) VAL [var10=2, var2=0, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=5] [L104] var_for_abs = var2 - var3 [L105] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=3] [L106] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var8 == var_for_abs) VAL [var10=2, var3=3, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=3] [L107] var_for_abs = var3 - var4 [L108] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=1] [L109] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var9 == var_for_abs) VAL [var10=2, var4=2, var5=4, var6=4, var7=5, var8=3, var9=1, var_for_abs=1] [L110] var_for_abs = var4 - var5 [L111] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=2, var6=4, var7=5, var8=3, var9=1, var_for_abs=2] [L112] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var10 == var_for_abs) VAL [var10=2, var6=4, var7=5, var8=3, var9=1, var_for_abs=2] [L113] reach_error() VAL [var10=2, var6=4, var7=5, var8=3, var9=1, var_for_abs=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 52, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 05:02:28,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE