./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:10:21,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:10:21,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:10:21,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:10:21,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:10:21,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:10:21,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:10:21,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:10:21,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:10:21,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:10:21,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:10:21,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:10:21,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:10:21,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:21,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:21,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:21,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:10:21,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b [2025-01-09 15:10:21,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:10:21,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:10:21,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:10:21,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:10:21,833 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:10:21,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:23,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201531450/30a35e23357c4bb2a1ac04538a3c94cb/FLAG9f1185b2a [2025-01-09 15:10:23,313 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:10:23,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:23,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201531450/30a35e23357c4bb2a1ac04538a3c94cb/FLAG9f1185b2a [2025-01-09 15:10:23,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/201531450/30a35e23357c4bb2a1ac04538a3c94cb [2025-01-09 15:10:23,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:10:23,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:10:23,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:23,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:10:23,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:10:23,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23, skipping insertion in model container [2025-01-09 15:10:23,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:10:23,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i[913,926] [2025-01-09 15:10:23,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:23,825 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:10:23,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i[913,926] [2025-01-09 15:10:23,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:23,871 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:10:23,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23 WrapperNode [2025-01-09 15:10:23,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:23,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:23,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:10:23,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:10:23,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,913 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 15:10:23,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:23,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:10:23,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:10:23,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:10:23,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:10:23,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:10:23,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:10:23,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:10:23,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:10:23,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (1/1) ... [2025-01-09 15:10:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:23,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:10:23,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:10:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:10:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:10:23,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:10:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:10:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:10:23,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:10:24,045 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:10:24,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:10:24,264 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 15:10:24,264 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:10:24,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:10:24,276 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:10:24,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:24 BoogieIcfgContainer [2025-01-09 15:10:24,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:10:24,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:10:24,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:10:24,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:10:24,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:23" (1/3) ... [2025-01-09 15:10:24,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca9accf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:24, skipping insertion in model container [2025-01-09 15:10:24,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:23" (2/3) ... [2025-01-09 15:10:24,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca9accf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:24, skipping insertion in model container [2025-01-09 15:10:24,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:24" (3/3) ... [2025-01-09 15:10:24,284 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:24,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:10:24,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-44.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:10:24,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:10:24,338 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;@dd65ad2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:10:24,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:10:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:10:24,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:24,348 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:10:24,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1407169223, now seen corresponding path program 1 times [2025-01-09 15:10:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:10:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896045933] [2025-01-09 15:10:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:10:24,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:24,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:10:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:10:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896045933] [2025-01-09 15:10:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896045933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:10:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058101367] [2025-01-09 15:10:24,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:10:24,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:24,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:10:24,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:10:24,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:24,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:24,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:24,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:24,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:10:24,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:10:24,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058101367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:24,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:10:24,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:10:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636449810] [2025-01-09 15:10:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:24,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:10:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:10:24,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:10:24,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:10:24,732 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:24,754 INFO L93 Difference]: Finished difference Result 110 states and 188 transitions. [2025-01-09 15:10:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:10:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-01-09 15:10:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:24,761 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:10:24,762 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 15:10:24,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-01-09 15:10:24,768 INFO L435 NwaCegarLoop]: 81 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, 81 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-01-09 15:10:24,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:10:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 15:10:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 15:10:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-01-09 15:10:24,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-01-09 15:10:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-01-09 15:10:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-01-09 15:10:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:10:24,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:24,811 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:10:24,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:10:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:10:25,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:25,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1455987273, now seen corresponding path program 1 times [2025-01-09 15:10:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:10:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587342902] [2025-01-09 15:10:25,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:10:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:25,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:25,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:25,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:10:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596122910] [2025-01-09 15:10:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:25,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:10:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:25,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:10:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:10:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:10:25,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:10:25,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:25,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:25,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:25,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:10:25,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:10:25,325 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:10:25,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:10:25,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:10:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:10:25,530 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:10:25,593 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:10:25,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:10:25 BoogieIcfgContainer [2025-01-09 15:10:25,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:10:25,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:10:25,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:10:25,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:10:25,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:24" (3/4) ... [2025-01-09 15:10:25,603 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:10:25,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:10:25,608 INFO L158 Benchmark]: Toolchain (without parser) took 1964.54ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 63.9MB in the end (delta: 42.1MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-01-09 15:10:25,608 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:25,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.87ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:10:25,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.10ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:10:25,609 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:25,609 INFO L158 Benchmark]: RCFGBuilder took 325.40ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 70.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:10:25,609 INFO L158 Benchmark]: TraceAbstraction took 1322.06ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 63.9MB in the end (delta: 5.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-01-09 15:10:25,610 INFO L158 Benchmark]: Witness Printer took 6.70ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:10:25,610 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.87ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.10ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.40ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 70.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1322.06ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 63.9MB in the end (delta: 5.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 6.70ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 63.9MB 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 someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed char var_1_3 = -25; [L24] signed char var_1_4 = -64; [L25] signed char var_1_5 = -1; [L26] signed char var_1_6 = 50; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 10.5; [L32] unsigned char var_1_15 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 50.75; [L36] float var_1_19 = 32.6; VAL [isInitial=0, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=-25, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L106] isInitial = 1 [L107] FCALL initially() [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L66] var_1_3 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L67] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L68] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L69] var_1_4 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L71] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L72] var_1_5 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L73] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L74] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L75] var_1_6 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L77] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_7 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L79] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_7 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L80] RET assume_abort_if_not(var_1_7 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L81] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L86] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L87] var_1_15 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L88] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L89] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L91] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L92] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L94] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L95] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L95] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L96] var_1_19 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L97] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L110] RET updateVariables() [L111] CALL step() [L40] signed long int stepLocal_1 = ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) / var_1_7; [L41] signed long int stepLocal_0 = var_1_5 - var_1_6; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L42] COND FALSE !(var_1_4 > stepLocal_0) [L47] var_1_1 = var_1_3 VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L49] var_1_18 = var_1_19 VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L50] COND TRUE (var_1_12 - ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) >= var_1_18 [L51] var_1_11 = (((var_1_6 < var_1_1) && var_1_15) || (var_1_16 || var_1_17)) VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L53] signed long int stepLocal_3 = var_1_1; [L54] signed long int stepLocal_2 = var_1_1 * (var_1_1 * var_1_6); VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L55] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_4 > (var_1_5 - var_1_6)) ? (((((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) / var_1_7) <= var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : 1) : (var_1_1 == ((signed long int) var_1_3))) && (var_1_11 ? ((var_1_1 > var_1_1) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (((var_1_1 % var_1_7) < (var_1_1 * (var_1_1 * var_1_6))) ? (var_1_8 == ((unsigned char) var_1_10)) : 1)) : 1)) && (((var_1_12 - ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) >= var_1_18) ? (var_1_11 == ((unsigned char) (((var_1_6 < var_1_1) && var_1_15) || (var_1_16 || var_1_17)))) : 1)) && (var_1_18 == ((float) var_1_19)) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 81 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, 81 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1640/1680 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-01-09 15:10:25,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:10:27,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:10:27,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:10:27,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:10:27,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:10:27,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:10:27,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:10:27,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:10:27,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:10:27,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:10:27,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:10:27,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:10:27,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:10:27,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:10:27,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:10:27,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:27,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:27,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:10:27,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:10:27,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:10:27,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b [2025-01-09 15:10:28,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:10:28,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:10:28,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:10:28,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:10:28,089 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:10:28,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:29,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a8d36d89/0b79c2ebe8c84f13a3838778233c8010/FLAG5797fa1c2 [2025-01-09 15:10:29,593 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:10:29,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:29,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a8d36d89/0b79c2ebe8c84f13a3838778233c8010/FLAG5797fa1c2 [2025-01-09 15:10:29,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a8d36d89/0b79c2ebe8c84f13a3838778233c8010 [2025-01-09 15:10:29,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:10:29,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:10:29,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:29,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:10:29,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:10:29,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:29" (1/1) ... [2025-01-09 15:10:29,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c6d113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:29, skipping insertion in model container [2025-01-09 15:10:29,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:29" (1/1) ... [2025-01-09 15:10:29,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:10:30,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i[913,926] [2025-01-09 15:10:30,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:30,154 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:10:30,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i[913,926] [2025-01-09 15:10:30,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:10:30,201 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:10:30,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30 WrapperNode [2025-01-09 15:10:30,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:10:30,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:30,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:10:30,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:10:30,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,234 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 15:10:30,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:10:30,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:10:30,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:10:30,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:10:30,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,257 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 15:10:30,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:10:30,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:10:30,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:10:30,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:10:30,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (1/1) ... [2025-01-09 15:10:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:10:30,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:10:30,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:10:30,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:10:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:10:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:10:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:10:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:10:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:10:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:10:30,400 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:10:30,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:10:32,204 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 15:10:32,204 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:10:32,220 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:10:32,221 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:10:32,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:32 BoogieIcfgContainer [2025-01-09 15:10:32,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:10:32,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:10:32,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:10:32,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:10:32,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:29" (1/3) ... [2025-01-09 15:10:32,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d9742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:32, skipping insertion in model container [2025-01-09 15:10:32,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:30" (2/3) ... [2025-01-09 15:10:32,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d9742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:32, skipping insertion in model container [2025-01-09 15:10:32,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:32" (3/3) ... [2025-01-09 15:10:32,230 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-44.i [2025-01-09 15:10:32,242 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:10:32,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-44.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:10:32,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:10:32,299 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;@5755d001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:10:32,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:10:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:10:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:32,312 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:10:32,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1407169223, now seen corresponding path program 1 times [2025-01-09 15:10:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089135553] [2025-01-09 15:10:32,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:32,324 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-01-09 15:10:32,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:32,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:10:32,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:10:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:32,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:32,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:32,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:10:32,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 15:10:32,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:32,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:10:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089135553] [2025-01-09 15:10:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089135553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:10:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:10:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491321748] [2025-01-09 15:10:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:32,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:10:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:10:32,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:10:32,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:10:32,671 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:10:32,692 INFO L93 Difference]: Finished difference Result 110 states and 188 transitions. [2025-01-09 15:10:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:10:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-01-09 15:10:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:10:32,700 INFO L225 Difference]: With dead ends: 110 [2025-01-09 15:10:32,701 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 15:10:32,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-01-09 15:10:32,707 INFO L435 NwaCegarLoop]: 81 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, 81 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-01-09 15:10:32,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:10:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 15:10:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 15:10:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:10:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-01-09 15:10:32,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-01-09 15:10:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:10:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-01-09 15:10:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:10:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-01-09 15:10:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:10:32,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:10:32,747 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:10:32,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:10:32,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:10:32,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:32,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1455987273, now seen corresponding path program 1 times [2025-01-09 15:10:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469317827] [2025-01-09 15:10:32,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:32,951 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-01-09 15:10:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:32,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:10:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:10:33,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:10:33,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:10:33,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:33,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:33,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 15:10:33,259 INFO L279 TraceCheckSpWp]: Computing forward predicates...