./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:25,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:25,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:18:25,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:25,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:25,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:25,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:25,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:25,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:25,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:25,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:25,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:25,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:25,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:25,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:25,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:25,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:25,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:25,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:25,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 [2025-03-17 05:18:25,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:25,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:25,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:25,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:25,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:25,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-17 05:18:27,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cafba35/fd2fb4753d9f43e29ee94475349b3d85/FLAG94efc811c [2025-03-17 05:18:27,291 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:27,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-17 05:18:27,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cafba35/fd2fb4753d9f43e29ee94475349b3d85/FLAG94efc811c [2025-03-17 05:18:27,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cafba35/fd2fb4753d9f43e29ee94475349b3d85 [2025-03-17 05:18:27,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:27,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:27,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:27,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:27,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:27,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6bd627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27, skipping insertion in model container [2025-03-17 05:18:27,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:27,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-17 05:18:27,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:27,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:27,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-17 05:18:27,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:27,560 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:27,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27 WrapperNode [2025-03-17 05:18:27,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:27,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:27,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:27,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:27,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,598 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 05:18:27,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:27,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:27,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:27,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:27,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:18:27,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:27,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:27,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:27,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:27,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (1/1) ... [2025-03-17 05:18:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:27,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:27,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:18:27,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:18:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:18:27,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:27,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:27,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:27,775 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:27,992 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:27,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:28,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:28,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:28,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:28 BoogieIcfgContainer [2025-03-17 05:18:28,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:28,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:28,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:28,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:28,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:27" (1/3) ... [2025-03-17 05:18:28,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1819d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:28, skipping insertion in model container [2025-03-17 05:18:28,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:27" (2/3) ... [2025-03-17 05:18:28,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1819d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:28, skipping insertion in model container [2025-03-17 05:18:28,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:28" (3/3) ... [2025-03-17 05:18:28,021 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-93.i [2025-03-17 05:18:28,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:28,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-93.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:28,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:28,099 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;@49b8ba1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:28,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:18:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:18:28,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:28,111 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:18:28,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:28,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1869243307, now seen corresponding path program 1 times [2025-03-17 05:18:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958740772] [2025-03-17 05:18:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:18:28,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:18:28,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:18:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958740772] [2025-03-17 05:18:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958740772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814548663] [2025-03-17 05:18:28,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:28,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:18:28,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:18:28,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:18:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:18:28,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:28,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:18:28,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:18:28,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:18:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814548663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:18:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:18:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642288533] [2025-03-17 05:18:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:28,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:18:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:28,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:18:28,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:28,574 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:18:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:28,596 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2025-03-17 05:18:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:18:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2025-03-17 05:18:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:28,604 INFO L225 Difference]: With dead ends: 79 [2025-03-17 05:18:28,604 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 05:18:28,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:28,610 INFO L435 NwaCegarLoop]: 57 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, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:28,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:18:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 05:18:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 05:18:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:18:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-03-17 05:18:28,652 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 87 [2025-03-17 05:18:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:28,653 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-17 05:18:28,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:18:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2025-03-17 05:18:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:18:28,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:28,657 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:18:28,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:18:28,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:18:28,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:28,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1881353785, now seen corresponding path program 1 times [2025-03-17 05:18:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:28,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026281496] [2025-03-17 05:18:28,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:18:28,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:18:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:28,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:18:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:18:29,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:18:29,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:29,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:29,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:18:29,089 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:18:29,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:18:29,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:18:29,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:18:29,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:18:29,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:18:29 BoogieIcfgContainer [2025-03-17 05:18:29,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:18:29,154 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:18:29,154 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:18:29,154 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:18:29,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:28" (3/4) ... [2025-03-17 05:18:29,157 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:18:29,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:18:29,159 INFO L158 Benchmark]: Toolchain (without parser) took 1838.40ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.8MB in the end (delta: 11.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:29,159 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:29,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:29,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:29,161 INFO L158 Benchmark]: Boogie Preprocessor took 32.94ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:29,161 INFO L158 Benchmark]: IcfgBuilder took 373.14ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.8MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:29,161 INFO L158 Benchmark]: TraceAbstraction took 1140.45ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 100.8MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:29,161 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 100.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:29,163 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.94ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 373.14ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.8MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1140.45ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 100.8MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 100.8MB in the end (delta: 27.1kB). 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 74, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someUnaryDOUBLEoperation at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_5 = 128.5; [L25] double var_1_6 = 9.186; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 9.6; [L28] float var_1_9 = 499.2; [L29] float var_1_10 = 1.5; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float last_1_var_1_10 = 1.5; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L62] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L63] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L63] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L64] var_1_5 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L65] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L66] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L66] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L67] var_1_6 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L68] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L69] var_1_7 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L70] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L71] var_1_8 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L72] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L73] var_1_9 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L74] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L75] var_1_12 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L76] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L77] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L77] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L80] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L80] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L82] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L97] RET updateVariables() [L98] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 1.00000000000004E13f VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((float) var_1_9)) : (var_1_1 == ((float) var_1_9))) : (var_1_1 == ((float) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((float) 1.00000000000004E13f)) : (var_1_10 == ((float) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 75 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, 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, 57 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, 57 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 206 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:18:29,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:31,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:31,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:18:31,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:31,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:31,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:31,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:31,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:31,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:31,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:31,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:31,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:31,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:31,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:31,479 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:31,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:31,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:31,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:31,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:31,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 [2025-03-17 05:18:31,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:31,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:31,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:31,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:31,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:31,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-17 05:18:33,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4230ce83/a2defa8533e24fbc85cf307c5ef8c4ba/FLAG0f567a2de [2025-03-17 05:18:33,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:33,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-17 05:18:33,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4230ce83/a2defa8533e24fbc85cf307c5ef8c4ba/FLAG0f567a2de [2025-03-17 05:18:33,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4230ce83/a2defa8533e24fbc85cf307c5ef8c4ba [2025-03-17 05:18:33,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:33,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:33,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:33,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:33,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:33,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d4970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33, skipping insertion in model container [2025-03-17 05:18:33,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:33,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-17 05:18:33,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:33,546 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:33,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-17 05:18:33,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:33,602 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:33,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33 WrapperNode [2025-03-17 05:18:33,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:33,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:33,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:33,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:33,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,650 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 05:18:33,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:33,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:33,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:33,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:33,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:18:33,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:33,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:33,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:33,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:33,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (1/1) ... [2025-03-17 05:18:33,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:33,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:33,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:18:33,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:18:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:18:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:33,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:33,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:33,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:33,878 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:33,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:19:07,838 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:19:07,838 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:19:07,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:19:07,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:19:07,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:07 BoogieIcfgContainer [2025-03-17 05:19:07,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:19:07,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:19:07,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:19:07,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:19:07,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:33" (1/3) ... [2025-03-17 05:19:07,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175b58d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:07, skipping insertion in model container [2025-03-17 05:19:07,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:33" (2/3) ... [2025-03-17 05:19:07,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175b58d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:07, skipping insertion in model container [2025-03-17 05:19:07,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:07" (3/3) ... [2025-03-17 05:19:07,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-93.i [2025-03-17 05:19:07,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:19:07,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-93.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:19:07,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:19:07,934 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;@46bd7cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:19:07,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:19:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:19:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:19:07,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:07,945 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:07,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:07,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1869243307, now seen corresponding path program 1 times [2025-03-17 05:19:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:19:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410216579] [2025-03-17 05:19:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:19:07,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:19:07,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:19:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:19:10,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:19:10,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:10,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:10,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:19:10,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-17 05:19:10,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:10,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:19:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410216579] [2025-03-17 05:19:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410216579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:19:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:19:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325817168] [2025-03-17 05:19:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:10,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:19:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:19:10,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:19:10,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:10,544 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:19:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:19:10,557 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2025-03-17 05:19:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:19:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2025-03-17 05:19:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:19:10,563 INFO L225 Difference]: With dead ends: 79 [2025-03-17 05:19:10,564 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 05:19:10,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:10,569 INFO L435 NwaCegarLoop]: 57 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, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:19:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:19:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 05:19:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 05:19:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:19:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-03-17 05:19:10,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 87 [2025-03-17 05:19:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:19:10,613 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-17 05:19:10,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:19:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2025-03-17 05:19:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:19:10,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:10,618 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:10,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:19:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:10,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:10,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1881353785, now seen corresponding path program 1 times [2025-03-17 05:19:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:19:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275232863] [2025-03-17 05:19:10,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:19:10,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:19:10,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:19:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:19:13,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:19:13,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:13,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:13,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:19:13,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:31,927 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:19:40,668 WARN L286 SmtUtils]: Spent 8.74s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:19:49,996 WARN L286 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:19:54,191 WARN L851 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~last_1_var_1_10~0)) c_~var_1_3~0) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_10~0) c_~var_1_5~0)) (= c_~var_1_1~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-03-17 05:19:58,488 WARN L873 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~last_1_var_1_10~0)) c_~var_1_3~0) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_10~0) c_~var_1_5~0)) (= c_~var_1_1~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-03-17 05:20:06,999 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)