./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_has-floats_file-23.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 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:22:19,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:22:19,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:22:20,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:22:20,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:22:20,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:22:20,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:22:20,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:22:20,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:22:20,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:22:20,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:22:20,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:22:20,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:22:20,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:22:20,055 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:22:20,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:22:20,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:22:20,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:22:20,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:22:20,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:22:20,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:22:20,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:22:20,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:22:20,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:22:20,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:22:20,058 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 -> 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 [2025-03-03 22:22:20,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:22:20,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:22:20,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:22:20,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:22:20,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:22:20,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:21,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2b94f45/0f6208174b6143aea5245320dadfe410/FLAG222f050c6 [2025-03-03 22:22:21,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:22:21,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:21,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2b94f45/0f6208174b6143aea5245320dadfe410/FLAG222f050c6 [2025-03-03 22:22:21,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2b94f45/0f6208174b6143aea5245320dadfe410 [2025-03-03 22:22:21,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:22:21,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:22:21,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:22:21,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:22:21,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:22:21,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:22:21" (1/1) ... [2025-03-03 22:22:21,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:21, skipping insertion in model container [2025-03-03 22:22:21,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:22:21" (1/1) ... [2025-03-03 22:22:22,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:22:22,098 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_has-floats_file-23.i[917,930] [2025-03-03 22:22:22,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:22:22,155 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:22:22,165 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_has-floats_file-23.i[917,930] [2025-03-03 22:22:22,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:22:22,200 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:22:22,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22 WrapperNode [2025-03-03 22:22:22,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:22:22,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:22:22,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:22:22,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:22:22,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,240 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-03 22:22:22,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:22:22,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:22:22,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:22:22,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:22:22,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,267 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-03 22:22:22,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:22:22,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:22:22,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:22:22,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:22:22,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (1/1) ... [2025-03-03 22:22:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:22:22,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:22:22,317 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-03 22:22:22,320 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-03 22:22:22,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:22:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:22:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:22:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:22:22,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:22:22,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:22:22,393 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:22:22,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:22:22,584 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:22:22,584 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:22:22,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:22:22,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:22:22,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:22:22 BoogieIcfgContainer [2025-03-03 22:22:22,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:22:22,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:22:22,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:22:22,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:22:22,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:22:21" (1/3) ... [2025-03-03 22:22:22,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73453594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:22:22, skipping insertion in model container [2025-03-03 22:22:22,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:22" (2/3) ... [2025-03-03 22:22:22,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73453594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:22:22, skipping insertion in model container [2025-03-03 22:22:22,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:22:22" (3/3) ... [2025-03-03 22:22:22,601 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:22,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:22:22,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-23.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:22:22,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:22:22,659 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;@4a8da0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:22:22,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:22:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 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-03 22:22:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:22,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:22,671 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-03 22:22:22,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 551176962, now seen corresponding path program 1 times [2025-03-03 22:22:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:22:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090450267] [2025-03-03 22:22:22,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:22:22,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:22,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:22,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:22,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:22,902 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-03 22:22:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:22:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090450267] [2025-03-03 22:22:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090450267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:22:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783568250] [2025-03-03 22:22:22,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:22,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:22:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:22:22,906 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-03 22:22:22,908 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-03 22:22:22,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:23,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:23,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:23,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:23,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:22:23,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:22:23,069 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-03 22:22:23,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:22:23,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783568250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:22:23,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:22:23,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:22:23,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648270493] [2025-03-03 22:22:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:22:23,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:22:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:22:23,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:22:23,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:22:23,091 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 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-03 22:22:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:22:23,112 INFO L93 Difference]: Finished difference Result 106 states and 179 transitions. [2025-03-03 22:22:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:22:23,114 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-03 22:22:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:22:23,120 INFO L225 Difference]: With dead ends: 106 [2025-03-03 22:22:23,121 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 22:22:23,124 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-03 22:22:23,127 INFO L435 NwaCegarLoop]: 77 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, 77 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-03 22:22:23,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:22:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 22:22:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 22:22:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-03 22:22:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-03-03 22:22:23,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2025-03-03 22:22:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:22:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-03-03 22:22:23,165 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-03 22:22:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-03-03 22:22:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:23,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:23,168 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-03 22:22:23,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:22:23,373 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-03 22:22:23,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2118254620, now seen corresponding path program 1 times [2025-03-03 22:22:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:22:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573331283] [2025-03-03 22:22:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:22:23,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:23,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:23,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:22:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:22:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573331283] [2025-03-03 22:22:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573331283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:22:24,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:22:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:22:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789446182] [2025-03-03 22:22:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:22:24,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:22:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:22:24,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:22:24,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:22:24,056 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:22:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:22:24,359 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2025-03-03 22:22:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:22:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-03-03 22:22:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:22:24,361 INFO L225 Difference]: With dead ends: 157 [2025-03-03 22:22:24,361 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 22:22:24,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:22:24,362 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 102 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:22:24,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 211 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:22:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 22:22:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2025-03-03 22:22:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:22:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-03-03 22:22:24,382 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2025-03-03 22:22:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:22:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-03-03 22:22:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:22:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-03-03 22:22:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:24,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:24,386 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-03 22:22:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:22:24,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2089625469, now seen corresponding path program 1 times [2025-03-03 22:22:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:22:24,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820147581] [2025-03-03 22:22:24,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:22:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:24,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:24,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:24,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:22:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024610814] [2025-03-03 22:22:24,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:24,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:22:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:22:24,497 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-03 22:22:24,499 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-03 22:22:24,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:22:24,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:22:24,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:24,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:22:24,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:22:24,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:22:24,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:22:24,683 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-03 22:22:24,876 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,SelfDestructingSolverStorable2 [2025-03-03 22:22:24,879 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:22:24,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:22:24,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:22:24 BoogieIcfgContainer [2025-03-03 22:22:24,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:22:24,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:22:24,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:22:24,945 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:22:24,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:22:22" (3/4) ... [2025-03-03 22:22:24,947 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:22:24,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:22:24,948 INFO L158 Benchmark]: Toolchain (without parser) took 2962.49ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 58.8MB in the end (delta: 72.4MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2025-03-03 22:22:24,948 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:22:24,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.84ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 118.2MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:22:24,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.76ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:22:24,949 INFO L158 Benchmark]: Boogie Preprocessor took 39.92ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:22:24,949 INFO L158 Benchmark]: IcfgBuilder took 312.73ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 98.4MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:22:24,949 INFO L158 Benchmark]: TraceAbstraction took 2347.80ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 58.8MB in the end (delta: 39.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-03-03 22:22:24,949 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:22:24,950 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.84ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 118.2MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.76ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.92ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.73ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 98.4MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2347.80ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 58.8MB in the end (delta: 39.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int var_1_2 = 16; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 25; [L26] float var_1_5 = 1.2; [L27] float var_1_6 = 999.7; [L28] float var_1_7 = 1.4; [L29] float var_1_8 = 9.75; [L30] float var_1_9 = 1.75; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 1277342739; [L33] unsigned long int var_1_12 = 1394088949; [L34] unsigned long int var_1_13 = 0; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_17 = 0; [L37] unsigned char var_1_18 = 0; [L38] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=16, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L65] var_1_3 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L68] var_1_5 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L69] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L70] var_1_6 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L73] var_1_7 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L74] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L75] var_1_8 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L76] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L77] var_1_9 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L79] var_1_11 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L80] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L82] var_1_12 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L83] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L85] var_1_13 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L88] var_1_17 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L89] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L91] var_1_19 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L106] RET updateVariables() [L107] CALL step() [L42] var_1_1 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L43] COND TRUE (var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9)) [L44] var_1_4 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L46] var_1_10 = ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13)))) [L47] unsigned char stepLocal_0 = (- var_1_5) != 1.9f; VAL [isInitial=1, stepLocal_0=0, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L48] COND FALSE !(stepLocal_0 || ((var_1_4 * var_1_13) < var_1_3)) [L51] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L53] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_1 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) && (((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) ? (var_1_4 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1)) && (var_1_10 == ((unsigned long int) ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13))))))) && (var_1_18 ? ((! ((var_1_5 / var_1_6) < (var_1_8 - var_1_9))) ? (var_1_18 ? (var_1_14 == ((unsigned char) (! var_1_17))) : 1) : 1) : 1)) && ((((- var_1_5) != 1.9f) || ((var_1_4 * var_1_13) < var_1_3)) ? (var_1_18 == ((unsigned char) (! var_1_19))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 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, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 164 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2242/2280 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-03 22:22:24,964 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_has-floats_file-23.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 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:22:26,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:22:26,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:22:26,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:22:26,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:22:26,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:22:26,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:22:26,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:22:26,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:22:26,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:22:26,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:22:26,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:22:26,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:22:26,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:22:26,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:22:26,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:22:26,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:22:26,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:22:26,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:22:26,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:22:26,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:22:26,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:22:26,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:22:26,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:22:26,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:22:26,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:22:26,844 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 -> 7e20287594d7bda057cc8987462fe4bc20fb41928eadfc70690547ace3b60f57 [2025-03-03 22:22:27,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:22:27,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:22:27,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:22:27,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:22:27,091 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:22:27,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:28,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9651582/f3deaf112e894ce7850d59a55b4f4121/FLAG658856251 [2025-03-03 22:22:28,579 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:22:28,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:28,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9651582/f3deaf112e894ce7850d59a55b4f4121/FLAG658856251 [2025-03-03 22:22:28,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9651582/f3deaf112e894ce7850d59a55b4f4121 [2025-03-03 22:22:28,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:22:28,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:22:28,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:22:28,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:22:28,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:22:28,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28, skipping insertion in model container [2025-03-03 22:22:28,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:22:28,736 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_has-floats_file-23.i[917,930] [2025-03-03 22:22:28,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:22:28,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:22:28,809 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_has-floats_file-23.i[917,930] [2025-03-03 22:22:28,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:22:28,840 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:22:28,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28 WrapperNode [2025-03-03 22:22:28,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:22:28,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:22:28,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:22:28,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:22:28,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,883 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-03 22:22:28,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:22:28,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:22:28,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:22:28,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:22:28,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,912 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-03 22:22:28,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:22:28,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:22:28,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:22:28,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:22:28,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (1/1) ... [2025-03-03 22:22:28,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:22:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:22:28,961 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-03 22:22:28,964 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-03 22:22:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:22:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:22:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:22:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:22:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:22:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:22:29,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:22:29,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:22:37,818 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:22:37,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:22:37,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:22:37,828 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:22:37,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:22:37 BoogieIcfgContainer [2025-03-03 22:22:37,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:22:37,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:22:37,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:22:37,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:22:37,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:22:28" (1/3) ... [2025-03-03 22:22:37,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212d730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:22:37, skipping insertion in model container [2025-03-03 22:22:37,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:22:28" (2/3) ... [2025-03-03 22:22:37,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212d730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:22:37, skipping insertion in model container [2025-03-03 22:22:37,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:22:37" (3/3) ... [2025-03-03 22:22:37,835 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-23.i [2025-03-03 22:22:37,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:22:37,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-23.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:22:37,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:22:37,902 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;@1cc4acb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:22:37,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:22:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 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-03 22:22:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:37,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:37,917 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-03 22:22:37,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 551176962, now seen corresponding path program 1 times [2025-03-03 22:22:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:22:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880498136] [2025-03-03 22:22:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:37,935 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-03 22:22:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:22:37,938 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-03 22:22:37,941 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-03 22:22:38,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:38,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:22:38,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:22:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 22:22:38,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:22:38,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:22:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880498136] [2025-03-03 22:22:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880498136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:22:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:22:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:22:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666690939] [2025-03-03 22:22:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:22:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:22:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:22:38,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:22:38,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:22:38,360 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 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-03 22:22:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:22:38,380 INFO L93 Difference]: Finished difference Result 106 states and 179 transitions. [2025-03-03 22:22:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:22:38,382 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-03 22:22:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:22:38,387 INFO L225 Difference]: With dead ends: 106 [2025-03-03 22:22:38,388 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 22:22:38,391 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-03 22:22:38,394 INFO L435 NwaCegarLoop]: 77 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, 77 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-03 22:22:38,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:22:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 22:22:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 22:22:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-03 22:22:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-03-03 22:22:38,429 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2025-03-03 22:22:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:22:38,429 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-03-03 22:22:38,430 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-03 22:22:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-03-03 22:22:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:38,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:38,432 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-03 22:22:38,444 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-03 22:22:38,632 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-03 22:22:38,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:38,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2118254620, now seen corresponding path program 1 times [2025-03-03 22:22:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:22:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718901398] [2025-03-03 22:22:38,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:38,634 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-03 22:22:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:22:38,637 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-03 22:22:38,638 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-03 22:22:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:38,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:38,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:38,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:38,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:22:38,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:22:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 22:22:39,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:22:39,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:22:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718901398] [2025-03-03 22:22:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718901398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:22:39,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:22:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:22:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298290141] [2025-03-03 22:22:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:22:39,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:22:39,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:22:39,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:22:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:22:39,181 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:22:41,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:22:44,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:22:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:22:44,682 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2025-03-03 22:22:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 22:22:44,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-03-03 22:22:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:22:44,685 INFO L225 Difference]: With dead ends: 169 [2025-03-03 22:22:44,686 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 22:22:44,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:22:44,687 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 97 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:22:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 246 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 22:22:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 22:22:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2025-03-03 22:22:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:22:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-03-03 22:22:44,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2025-03-03 22:22:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:22:44,703 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-03-03 22:22:44,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:22:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-03-03 22:22:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:22:44,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:22:44,707 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-03 22:22:44,718 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 (3)] Ended with exit code 0 [2025-03-03 22:22:44,907 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-03 22:22:44,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:22:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:22:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2089625469, now seen corresponding path program 1 times [2025-03-03 22:22:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:22:44,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989970950] [2025-03-03 22:22:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:22:44,909 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-03 22:22:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:22:44,911 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-03 22:22:44,912 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-03 22:22:44,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:22:45,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:22:45,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:22:45,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:22:45,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 22:22:45,195 INFO L279 TraceCheckSpWp]: Computing forward predicates...