./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -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 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:22:15,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:22:15,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:22:15,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:22:15,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:22:15,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:22:15,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:22:15,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:22:15,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:22:15,924 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:22:15,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:22:15,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:22:15,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:22:15,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:22:15,925 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:22:15,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:22:15,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:22:15,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:22:15,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:22:15,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:22:15,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:22:15,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:22:15,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:22:15,929 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/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 -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2025-03-08 14:22:16,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:22:16,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:22:16,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:22:16,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:22:16,155 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:22:16,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:17,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b82ec86d/2c6789164d264a73bd15679ec4cd90dc/FLAG52e46f17f [2025-03-08 14:22:17,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:22:17,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:17,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b82ec86d/2c6789164d264a73bd15679ec4cd90dc/FLAG52e46f17f [2025-03-08 14:22:17,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b82ec86d/2c6789164d264a73bd15679ec4cd90dc [2025-03-08 14:22:17,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:22:17,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:22:17,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:22:17,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:22:17,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:22:17,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:17" (1/1) ... [2025-03-08 14:22:17,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:17, skipping insertion in model container [2025-03-08 14:22:17,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:17" (1/1) ... [2025-03-08 14:22:17,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:22:17,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-03-08 14:22:18,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:22:18,037 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:22:18,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-03-08 14:22:18,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:22:18,078 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:22:18,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18 WrapperNode [2025-03-08 14:22:18,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:22:18,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:22:18,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:22:18,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:22:18,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,108 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-08 14:22:18,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:22:18,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:22:18,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:22:18,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:22:18,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,132 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-03-08 14:22:18,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:22:18,139 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:22:18,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:22:18,139 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:22:18,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (1/1) ... [2025-03-08 14:22:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:22:18,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:22:18,164 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) [2025-03-08 14:22:18,167 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 [2025-03-08 14:22:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:22:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:22:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:22:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:22:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:22:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:22:18,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:22:18,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:22:18,362 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:22:18,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:22:18,369 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:22:18,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:22:18,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:18 BoogieIcfgContainer [2025-03-08 14:22:18,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:22:18,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:22:18,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:22:18,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:22:18,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:22:17" (1/3) ... [2025-03-08 14:22:18,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bb3ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:18, skipping insertion in model container [2025-03-08 14:22:18,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:18" (2/3) ... [2025-03-08 14:22:18,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bb3ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:18, skipping insertion in model container [2025-03-08 14:22:18,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:18" (3/3) ... [2025-03-08 14:22:18,376 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:18,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:22:18,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:22:18,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:22:18,429 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;@7b5c7d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:22:18,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:22:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:22:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 14:22:18,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:22:18,441 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-08 14:22:18,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:22:18,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:22:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash -40983436, now seen corresponding path program 1 times [2025-03-08 14:22:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:22:18,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173572662] [2025-03-08 14:22:18,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:22:18,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:18,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:18,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:18,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:22:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 14:22:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:22:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173572662] [2025-03-08 14:22:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173572662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:22:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079090840] [2025-03-08 14:22:18,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:22:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:22:18,626 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) [2025-03-08 14:22:18,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:22:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:18,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:18,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:18,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:22:18,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:22:18,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:22:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 14:22:18,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:22:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079090840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:22:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:22:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:22:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847796493] [2025-03-08 14:22:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:22:18,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:22:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:22:18,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:22:18,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:22:18,767 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:22:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:22:18,780 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2025-03-08 14:22:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:22:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-08 14:22:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:22:18,786 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:22:18,786 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:22:18,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:22:18,790 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:22:18,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:22:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:22:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:22:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:22:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-08 14:22:18,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-03-08 14:22:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:22:18,816 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-08 14:22:18,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:22:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-08 14:22:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 14:22:18,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:22:18,818 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-08 14:22:18,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:22:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:22:19,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:22:19,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:22:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1735903982, now seen corresponding path program 1 times [2025-03-08 14:22:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:22:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487727577] [2025-03-08 14:22:19,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:22:19,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:19,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:22:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5176297] [2025-03-08 14:22:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:22:19,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:22:19,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:22:19,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:22:19,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:19,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:22:19,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:22:19,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:19,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:19,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:19,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:22:19,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:22:19,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:22:19,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:22:19,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:22:19,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 14:22:19,576 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:22:19,624 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:22:19,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:22:19 BoogieIcfgContainer [2025-03-08 14:22:19,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:22:19,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:22:19,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:22:19,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:22:19,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:18" (3/4) ... [2025-03-08 14:22:19,633 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:22:19,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:22:19,634 INFO L158 Benchmark]: Toolchain (without parser) took 1746.55ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 92.2MB in the end (delta: 19.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-03-08 14:22:19,635 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:22:19,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.95ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 99.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:22:19,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.90ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:22:19,638 INFO L158 Benchmark]: Boogie Preprocessor took 28.90ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:22:19,638 INFO L158 Benchmark]: IcfgBuilder took 230.78ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:22:19,638 INFO L158 Benchmark]: TraceAbstraction took 1258.10ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 92.3MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:22:19,638 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:22:19,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.95ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 99.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.90ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.90ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 230.78ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1258.10ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 92.3MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 41.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = -16; [L25] double var_1_6 = 100.01; [L26] unsigned short int var_1_7 = 50; [L27] signed short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = -100; [L30] unsigned long int var_1_12 = 10000000; [L31] unsigned short int var_1_13 = 2; [L32] unsigned short int var_1_14 = 4; [L33] double var_1_15 = 4.5; VAL [isInitial=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L92] COND TRUE k_loop < 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L66] var_1_5 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L67] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=5, var_1_9=256] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=5, var_1_9=256] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L73] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L74] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=256] [L75] var_1_9 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3] [L77] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L77] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L78] var_1_14 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L80] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L80] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=50, var_1_8=3, var_1_9=-65536] [L94] RET updateVariables() [L95] CALL step() [L37] COND TRUE ! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))) [L38] var_1_7 = (var_1_9 + 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L40] var_1_12 = var_1_9 [L41] var_1_13 = var_1_14 [L42] var_1_15 = var_1_6 [L43] unsigned long int stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=54/5, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L53] unsigned char stepLocal_1 = (var_1_6 * var_1_15) >= var_1_1; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L54] COND FALSE !(stepLocal_1 || var_1_2) [L59] var_1_10 = -1 VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return (((((var_1_2 ? ((var_1_12 >= (var_1_12 / var_1_5)) ? (var_1_1 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) : (var_1_1 == ((double) var_1_6))) : (var_1_1 == ((double) var_1_6))) && ((! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7 == ((unsigned short int) (var_1_9 + 1))) : 1)) && ((((var_1_6 * var_1_15) >= var_1_1) || var_1_2) ? ((var_1_6 <= var_1_1) ? (var_1_10 == ((signed long int) var_1_9)) : 1) : (var_1_10 == ((signed long int) -1)))) && (var_1_12 == ((unsigned long int) var_1_9))) && (var_1_13 == ((unsigned short int) var_1_14))) && (var_1_15 == ((double) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=2, var_1_6=2, var_1_7=1, var_1_8=3, var_1_9=-65536] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 73 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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 could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:22:19,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:22:21,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:22:21,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:22:21,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:22:21,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:22:21,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:22:21,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:22:21,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:22:21,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:22:21,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:22:21,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:22:21,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:22:21,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:22:21,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:22:21,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:22:21,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:22:21,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:22:21,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:22:21,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:22:21,537 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/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 -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2025-03-08 14:22:21,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:22:21,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:22:21,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:22:21,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:22:21,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:22:21,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:23,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c54deb5/307b8ca3c11b47e2812a02ed4dd7a435/FLAG1e7c92935 [2025-03-08 14:22:23,192 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:22:23,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:23,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c54deb5/307b8ca3c11b47e2812a02ed4dd7a435/FLAG1e7c92935 [2025-03-08 14:22:23,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c54deb5/307b8ca3c11b47e2812a02ed4dd7a435 [2025-03-08 14:22:23,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:22:23,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:22:23,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:22:23,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:22:23,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:22:23,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b0aa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23, skipping insertion in model container [2025-03-08 14:22:23,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:22:23,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-03-08 14:22:23,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:22:23,757 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:22:23,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2025-03-08 14:22:23,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:22:23,803 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:22:23,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23 WrapperNode [2025-03-08 14:22:23,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:22:23,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:22:23,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:22:23,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:22:23,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,834 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-08 14:22:23,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:22:23,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:22:23,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:22:23,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:22:23,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,860 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-03-08 14:22:23,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:22:23,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:22:23,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:22:23,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:22:23,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (1/1) ... [2025-03-08 14:22:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:22:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:22:23,908 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) [2025-03-08 14:22:23,911 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 [2025-03-08 14:22:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:22:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:22:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:22:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:22:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:22:23,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:22:23,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:22:23,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:22:26,723 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:22:26,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:22:26,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:22:26,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:22:26,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:26 BoogieIcfgContainer [2025-03-08 14:22:26,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:22:26,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:22:26,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:22:26,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:22:26,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:22:23" (1/3) ... [2025-03-08 14:22:26,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ea4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:26, skipping insertion in model container [2025-03-08 14:22:26,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:22:23" (2/3) ... [2025-03-08 14:22:26,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ea4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:26, skipping insertion in model container [2025-03-08 14:22:26,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:26" (3/3) ... [2025-03-08 14:22:26,739 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2025-03-08 14:22:26,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:22:26,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:22:26,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:22:26,793 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;@3693d98c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:22:26,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:22:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:22:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 14:22:26,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:22:26,802 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-08 14:22:26,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:22:26,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:22:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -40983436, now seen corresponding path program 1 times [2025-03-08 14:22:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:22:26,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022593394] [2025-03-08 14:22:26,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:22:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:22:26,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:22:26,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:22:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:27,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:27,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:27,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:22:27,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:22:27,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:22:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 14:22:27,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:22:27,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:22:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022593394] [2025-03-08 14:22:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022593394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:22:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:22:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:22:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100928845] [2025-03-08 14:22:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:22:27,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:22:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:22:27,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:22:27,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:22:27,127 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:22:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:22:27,141 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2025-03-08 14:22:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:22:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-08 14:22:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:22:27,147 INFO L225 Difference]: With dead ends: 83 [2025-03-08 14:22:27,147 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 14:22:27,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:22:27,150 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:22:27,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:22:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 14:22:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 14:22:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 14:22:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-08 14:22:27,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-03-08 14:22:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:22:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-08 14:22:27,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 14:22:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-08 14:22:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 14:22:27,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:22:27,175 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-08 14:22:27,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:22:27,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:22:27,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:22:27,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:22:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1735903982, now seen corresponding path program 1 times [2025-03-08 14:22:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:22:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833074887] [2025-03-08 14:22:27,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:22:27,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:22:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:22:27,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:22:27,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:22:27,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 14:22:27,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 14:22:27,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:22:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:22:27,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:22:27,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:23:04,420 WARN L286 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:23:53,281 WARN L286 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)