./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:45:12,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:45:12,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:45:12,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:45:12,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:45:12,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:45:12,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:45:12,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:45:12,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:45:12,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:45:12,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:45:12,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:45:12,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:45:12,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:45:12,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:45:12,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:45:12,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:45:12,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:45:12,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:45:12,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:45:12,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:45:12,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:45:12,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:45:12,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:45:12,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:45:12,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:45:12,414 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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2025-03-08 13:45:12,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:45:12,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:45:12,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:45:12,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:45:12,675 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:45:12,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:13,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cd69285/11b44fe9862544e5a3ce3466105174a0/FLAGf407f5fdb [2025-03-08 13:45:14,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:45:14,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:14,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cd69285/11b44fe9862544e5a3ce3466105174a0/FLAGf407f5fdb [2025-03-08 13:45:14,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cd69285/11b44fe9862544e5a3ce3466105174a0 [2025-03-08 13:45:14,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:45:14,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:45:14,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:45:14,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:45:14,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:45:14,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3885fb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14, skipping insertion in model container [2025-03-08 13:45:14,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:45:14,532 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-08 13:45:14,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:45:14,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:45:14,598 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-08 13:45:14,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:45:14,643 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:45:14,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14 WrapperNode [2025-03-08 13:45:14,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:45:14,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:45:14,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:45:14,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:45:14,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,684 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-08 13:45:14,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:45:14,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:45:14,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:45:14,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:45:14,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,714 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:45:14,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:45:14,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:45:14,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:45:14,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:45:14,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (1/1) ... [2025-03-08 13:45:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:45:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:45:14,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:45:14,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:45:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:45:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:45:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:45:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:45:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:45:14,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:45:14,839 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:45:14,841 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:45:15,001 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:45:15,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:45:15,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:45:15,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:45:15,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:45:15 BoogieIcfgContainer [2025-03-08 13:45:15,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:45:15,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:45:15,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:45:15,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:45:15,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:45:14" (1/3) ... [2025-03-08 13:45:15,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bec2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:45:15, skipping insertion in model container [2025-03-08 13:45:15,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:14" (2/3) ... [2025-03-08 13:45:15,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bec2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:45:15, skipping insertion in model container [2025-03-08 13:45:15,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:45:15" (3/3) ... [2025-03-08 13:45:15,017 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:15,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:45:15,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-25.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:45:15,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:45:15,076 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;@421c028f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:45:15,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:45:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 13:45:15,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:15,087 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:15,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -203264193, now seen corresponding path program 1 times [2025-03-08 13:45:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:45:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123823802] [2025-03-08 13:45:15,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:45:15,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:15,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:15,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:15,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:45:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:45:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123823802] [2025-03-08 13:45:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123823802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:45:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538245132] [2025-03-08 13:45:15,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:45:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:45:15,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:45:15,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:45:15,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:15,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:15,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:15,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:45:15,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:45:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 13:45:15,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:45:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538245132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:45:15,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:45:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:45:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024598159] [2025-03-08 13:45:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:45:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:45:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:45:15,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:45:15,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:45:15,476 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:45:15,500 INFO L93 Difference]: Finished difference Result 108 states and 185 transitions. [2025-03-08 13:45:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:45:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 13:45:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:45:15,505 INFO L225 Difference]: With dead ends: 108 [2025-03-08 13:45:15,506 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 13:45:15,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:45:15,512 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:45:15,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:45:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 13:45:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 13:45:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-03-08 13:45:15,558 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 125 [2025-03-08 13:45:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:45:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-03-08 13:45:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-03-08 13:45:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 13:45:15,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:15,565 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:15,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:45:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:45:15,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1705106625, now seen corresponding path program 1 times [2025-03-08 13:45:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:45:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766025655] [2025-03-08 13:45:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:45:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:15,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:15,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 13:45:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:45:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766025655] [2025-03-08 13:45:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766025655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:45:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170810091] [2025-03-08 13:45:16,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:45:16,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:45:16,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:45:16,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:45:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:16,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:16,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:16,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:16,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 13:45:16,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:45:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 13:45:16,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:45:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170810091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:45:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:45:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-03-08 13:45:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266564983] [2025-03-08 13:45:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:45:16,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:45:16,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:45:16,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:45:16,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:45:16,522 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:45:16,862 INFO L93 Difference]: Finished difference Result 115 states and 165 transitions. [2025-03-08 13:45:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:45:16,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 13:45:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:45:16,864 INFO L225 Difference]: With dead ends: 115 [2025-03-08 13:45:16,864 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:45:16,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:45:16,865 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 113 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:45:16,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 149 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:45:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:45:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-08 13:45:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-08 13:45:16,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 125 [2025-03-08 13:45:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:45:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-08 13:45:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-08 13:45:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 13:45:16,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:16,883 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:16,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:45:17,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 13:45:17,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:17,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash 507167077, now seen corresponding path program 1 times [2025-03-08 13:45:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:45:17,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840666883] [2025-03-08 13:45:17,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:45:17,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 13:45:17,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 13:45:17,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:17,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:45:17,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:45:17,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 13:45:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 13:45:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:45:17,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:45:17,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:45:17,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:45:17,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:45:17,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:45:17,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:45:17,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:45:17 BoogieIcfgContainer [2025-03-08 13:45:17,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:45:17,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:45:17,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:45:17,371 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:45:17,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:45:15" (3/4) ... [2025-03-08 13:45:17,373 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:45:17,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:45:17,374 INFO L158 Benchmark]: Toolchain (without parser) took 2967.19ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 95.2MB in the end (delta: 12.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-03-08 13:45:17,374 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:45:17,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.45ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:45:17,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.36ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:45:17,374 INFO L158 Benchmark]: Boogie Preprocessor took 45.16ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:45:17,375 INFO L158 Benchmark]: IcfgBuilder took 278.69ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 73.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:45:17,375 INFO L158 Benchmark]: TraceAbstraction took 2358.52ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 95.2MB in the end (delta: -22.9MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2025-03-08 13:45:17,375 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 95.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:45:17,376 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.72ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.45ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.36ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.16ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.69ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 73.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2358.52ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 95.2MB in the end (delta: -22.9MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 95.2MB in the end (delta: 37.0kB). 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 to_int at line 58, overapproximation of to_int at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; VAL [isInitial=0, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=10, var_1_8=128, var_1_9=63] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_8=128, var_1_9=63] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L97] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L97] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L99] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L100] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L100] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=4, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=4, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_9=-1] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_9=-1] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1509114202, var_1_9=-1] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1509114202, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=1, var_1_14=-255, var_1_1=4, var_1_2=1, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-3221225473, var_1_7=-3221225473, var_1_8=1509114202, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 132 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2999/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:45:17,390 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_floatingpointinfluence_no-floats_file-25.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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:45:19,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:45:19,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:45:19,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:45:19,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:45:19,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:45:19,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:45:19,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:45:19,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:45:19,297 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:45:19,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:45:19,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:45:19,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:45:19,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:45:19,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:45:19,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:45:19,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:45:19,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:45:19,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:45:19,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:45:19,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:45:19,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:45:19,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:45:19,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:45:19,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:45:19,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:45:19,303 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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2025-03-08 13:45:19,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:45:19,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:45:19,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:45:19,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:45:19,527 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:45:19,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:20,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d6d2cdc/a4572133b05b4e03b87afc273006c813/FLAG0d2121957 [2025-03-08 13:45:20,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:45:20,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:20,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d6d2cdc/a4572133b05b4e03b87afc273006c813/FLAG0d2121957 [2025-03-08 13:45:21,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d6d2cdc/a4572133b05b4e03b87afc273006c813 [2025-03-08 13:45:21,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:45:21,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:45:21,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:45:21,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:45:21,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:45:21,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e265e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21, skipping insertion in model container [2025-03-08 13:45:21,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:45:21,338 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-08 13:45:21,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:45:21,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:45:21,391 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_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-08 13:45:21,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:45:21,418 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:45:21,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21 WrapperNode [2025-03-08 13:45:21,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:45:21,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:45:21,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:45:21,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:45:21,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,457 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-08 13:45:21,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:45:21,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:45:21,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:45:21,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:45:21,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:45:21,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:45:21,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:45:21,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:45:21,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:45:21,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (1/1) ... [2025-03-08 13:45:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:45:21,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:45:21,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:45:21,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:45:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:45:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:45:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:45:21,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:45:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:45:21,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:45:21,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:45:21,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:45:23,693 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:45:23,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:45:23,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:45:23,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:45:23,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:45:23 BoogieIcfgContainer [2025-03-08 13:45:23,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:45:23,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:45:23,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:45:23,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:45:23,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:45:21" (1/3) ... [2025-03-08 13:45:23,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5595c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:45:23, skipping insertion in model container [2025-03-08 13:45:23,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:45:21" (2/3) ... [2025-03-08 13:45:23,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5595c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:45:23, skipping insertion in model container [2025-03-08 13:45:23,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:45:23" (3/3) ... [2025-03-08 13:45:23,712 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-08 13:45:23,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:45:23,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-25.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:45:23,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:45:23,767 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;@70a10f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:45:23,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:45:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 13:45:23,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:23,778 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:23,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -203264193, now seen corresponding path program 1 times [2025-03-08 13:45:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:45:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614848686] [2025-03-08 13:45:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:23,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:45:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:45:23,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:45:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:45:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:23,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:23,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:23,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:23,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:45:23,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:45:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 13:45:23,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:45:23,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:45:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614848686] [2025-03-08 13:45:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614848686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:45:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:45:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:45:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366513467] [2025-03-08 13:45:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:45:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:45:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:45:24,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:45:24,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:45:24,016 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:45:24,031 INFO L93 Difference]: Finished difference Result 108 states and 185 transitions. [2025-03-08 13:45:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:45:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 13:45:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:45:24,037 INFO L225 Difference]: With dead ends: 108 [2025-03-08 13:45:24,037 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 13:45:24,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:45:24,041 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:45:24,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:45:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 13:45:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 13:45:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-03-08 13:45:24,071 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 125 [2025-03-08 13:45:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:45:24,071 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-03-08 13:45:24,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-03-08 13:45:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 13:45:24,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:24,077 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:24,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:45:24,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:45:24,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:24,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1705106625, now seen corresponding path program 1 times [2025-03-08 13:45:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:45:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112309921] [2025-03-08 13:45:24,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:24,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:45:24,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:45:24,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:45:24,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:45:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 13:45:24,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 13:45:24,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:24,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:24,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 13:45:24,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:45:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 13:45:24,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:45:24,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:45:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112309921] [2025-03-08 13:45:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112309921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:45:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:45:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:45:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594235948] [2025-03-08 13:45:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:45:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:45:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:45:24,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:45:24,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:45:24,651 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:45:25,824 INFO L93 Difference]: Finished difference Result 115 states and 165 transitions. [2025-03-08 13:45:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:45:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-08 13:45:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:45:25,841 INFO L225 Difference]: With dead ends: 115 [2025-03-08 13:45:25,841 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:45:25,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:45:25,843 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:45:25,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 181 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 13:45:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:45:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-08 13:45:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:45:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-08 13:45:25,852 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 125 [2025-03-08 13:45:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:45:25,874 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-08 13:45:25,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 13:45:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-08 13:45:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 13:45:25,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:45:25,875 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:45:25,881 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 13:45:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:45:26,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:45:26,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:45:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 507167077, now seen corresponding path program 1 times [2025-03-08 13:45:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:45:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243003679] [2025-03-08 13:45:26,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:26,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:45:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:45:26,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:45:26,081 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 (4)] Waiting until timeout for monitored process [2025-03-08 13:45:26,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 13:45:26,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 13:45:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:26,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:45:26,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:45:26,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 13:45:26,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 13:45:26,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:26,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:45:26,274 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-08 13:45:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [114262516] [2025-03-08 13:45:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:45:26,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 13:45:26,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 13:45:26,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 13:45:26,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 13:45:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 13:45:26,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 13:45:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:45:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:45:26,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 13:45:26,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:46:15,208 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)