./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter2_alt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter2_alt.c -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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:53:55,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:53:55,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:53:55,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:53:55,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:53:55,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:53:55,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:53:55,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:53:55,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:53:55,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:53:55,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:53:55,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:53:55,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:53:55,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:53:55,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:53:55,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:53:55,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:53:55,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:53:55,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:53:55,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:53:55,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:53:55,707 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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2025-03-16 15:53:55,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:53:55,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:53:55,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:53:55,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:53:55,924 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:53:55,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter2_alt.c [2025-03-16 15:53:57,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c68591e/fc2414a235ad4942adca3d5688927cd0/FLAGfb6e8547a [2025-03-16 15:53:57,278 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:53:57,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2025-03-16 15:53:57,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c68591e/fc2414a235ad4942adca3d5688927cd0/FLAGfb6e8547a [2025-03-16 15:53:57,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c68591e/fc2414a235ad4942adca3d5688927cd0 [2025-03-16 15:53:57,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:53:57,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:53:57,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:53:57,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:53:57,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:53:57,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ea479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57, skipping insertion in model container [2025-03-16 15:53:57,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:53:57,729 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/float-benchs/filter2_alt.c[631,644] [2025-03-16 15:53:57,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:53:57,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:53:57,754 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/float-benchs/filter2_alt.c[631,644] [2025-03-16 15:53:57,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:53:57,767 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:53:57,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57 WrapperNode [2025-03-16 15:53:57,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:53:57,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:53:57,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:53:57,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:53:57,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,787 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2025-03-16 15:53:57,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:53:57,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:53:57,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:53:57,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:53:57,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,806 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2025-03-16 15:53:57,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:53:57,822 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:53:57,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:53:57,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:53:57,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (1/1) ... [2025-03-16 15:53:57,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:53:57,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:53:57,847 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-16 15:53:57,849 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-16 15:53:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:53:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2025-03-16 15:53:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2025-03-16 15:53:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:53:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-16 15:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-16 15:53:57,938 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:53:57,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:53:58,047 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 15:53:58,047 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:53:58,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:53:58,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:53:58,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:53:58 BoogieIcfgContainer [2025-03-16 15:53:58,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:53:58,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:53:58,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:53:58,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:53:58,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:53:57" (1/3) ... [2025-03-16 15:53:58,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aeca03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:53:58, skipping insertion in model container [2025-03-16 15:53:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:53:57" (2/3) ... [2025-03-16 15:53:58,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aeca03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:53:58, skipping insertion in model container [2025-03-16 15:53:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:53:58" (3/3) ... [2025-03-16 15:53:58,064 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2025-03-16 15:53:58,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:53:58,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_alt.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:53:58,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:53:58,117 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;@181ac48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:53:58,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:53:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 15:53:58,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:53:58,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:53:58,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:53:58,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:53:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1999589059, now seen corresponding path program 1 times [2025-03-16 15:53:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:53:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590277217] [2025-03-16 15:53:58,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:53:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:53:58,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 15:53:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 15:53:58,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:53:58,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:53:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:53:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:53:58,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590277217] [2025-03-16 15:53:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590277217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:53:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775265761] [2025-03-16 15:53:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:53:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:53:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:53:58,236 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-16 15:53:58,237 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-16 15:53:58,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 15:53:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 15:53:58,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:53:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:53:58,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 15:53:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:53:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 15:53:58,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:53:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775265761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:53:58,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:53:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 15:53:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182905453] [2025-03-16 15:53:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:53:58,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:53:58,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:53:58,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:53:58,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:53:58,338 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:53:58,346 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-16 15:53:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:53:58,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-16 15:53:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:53:58,354 INFO L225 Difference]: With dead ends: 32 [2025-03-16 15:53:58,354 INFO L226 Difference]: Without dead ends: 16 [2025-03-16 15:53:58,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-16 15:53:58,358 INFO L435 NwaCegarLoop]: 18 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, 18 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-16 15:53:58,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:53:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-16 15:53:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-16 15:53:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-16 15:53:58,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 18 [2025-03-16 15:53:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:53:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-16 15:53:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-16 15:53:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 15:53:58,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:53:58,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:53:58,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:53:58,581 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-16 15:53:58,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:53:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:53:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1250773085, now seen corresponding path program 1 times [2025-03-16 15:53:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:53:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742127157] [2025-03-16 15:53:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:53:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:53:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 15:53:58,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 15:53:58,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:53:58,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:53:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 15:53:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:53:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742127157] [2025-03-16 15:53:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742127157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:53:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:53:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:53:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048197752] [2025-03-16 15:53:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:53:58,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:53:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:53:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:53:58,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:53:58,666 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:53:58,682 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-16 15:53:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:53:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-16 15:53:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:53:58,683 INFO L225 Difference]: With dead ends: 38 [2025-03-16 15:53:58,683 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 15:53:58,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:53:58,684 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:53:58,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:53:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 15:53:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-16 15:53:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 15:53:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-16 15:53:58,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2025-03-16 15:53:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:53:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-16 15:53:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:53:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-16 15:53:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:53:58,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:53:58,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:53:58,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:53:58,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:53:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:53:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1285528662, now seen corresponding path program 1 times [2025-03-16 15:53:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:53:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002734840] [2025-03-16 15:53:58,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:53:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:53:58,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:53:58,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:53:58,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:53:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:53:58,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 15:53:58,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:53:58,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:53:58,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:53:58,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:53:58,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 15:53:58,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 15:53:58,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:53:58,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:53:58,774 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 15:53:58,795 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:53:58,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:53:58 BoogieIcfgContainer [2025-03-16 15:53:58,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:53:58,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:53:58,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:53:58,798 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:53:58,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:53:58" (3/4) ... [2025-03-16 15:53:58,800 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 15:53:58,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:53:58,801 INFO L158 Benchmark]: Toolchain (without parser) took 1172.02ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 39.3MB in the end (delta: 66.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 15:53:58,801 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:53:58,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.46ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:53:58,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.78ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:53:58,801 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:53:58,801 INFO L158 Benchmark]: IcfgBuilder took 233.77ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 79.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:53:58,802 INFO L158 Benchmark]: TraceAbstraction took 739.59ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 39.3MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:53:58,802 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 142.6MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:53:58,804 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.46ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.78ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 233.77ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 79.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 739.59ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 39.3MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 142.6MB. Free memory is still 39.3MB. 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: 14]: 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 26, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float P, X; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L52] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0, \result=55] [L52] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L52] X = RANDOM_INPUT() [L53] INIT = TRUE VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=55] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=55] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=55] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=55, \result=57] [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=55] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND TRUE \read(INIT) [L34] S[0] = X [L35] P = X [L36] E[0] = X VAL [E={4:0}, INIT=1, P=57, S={5:0}, X=57] [L46] EXPR E[0] [L46] E[1] = E[0] [L46] E[0] = X [L47] EXPR S[0] [L47] S[1] = S[0] [L47] S[0] = P [L56] RET filter2 () [L57] INIT = FALSE VAL [E={4:0}, INIT=0, P=57, S={5:0}, X=57] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=57, S={5:0}, X=57] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=57, S={5:0}, X=57] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; VAL [E={4:0}, INIT=0, P=57, S={5:0}, X=57, \result=56] [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=57, S={5:0}, X=57] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND FALSE !(\read(INIT)) [L39] EXPR E[0] [L40] EXPR E[1] [L41] EXPR S[0] [L42] EXPR S[1] [L38-L42] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L43] CALL __VERIFIER_assert(P >= -15.f && P <= 15.f) [L14] COND TRUE !(cond) VAL [E={4:0}, INIT=0, S={5:0}, X=56] [L14] reach_error() VAL [E={4:0}, INIT=0, S={5:0}, X=56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 24 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 12/15 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-16 15:53:58,817 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/float-benchs/filter2_alt.c -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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:54:00,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:54:00,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 15:54:00,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:54:00,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:54:00,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:54:00,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:54:00,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:54:00,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:54:00,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:54:00,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:54:00,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:54:00,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:54:00,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:54:00,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:54:00,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:54:00,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:54:00,663 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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2025-03-16 15:54:00,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:54:00,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:54:00,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:54:00,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:54:00,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:54:00,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter2_alt.c [2025-03-16 15:54:02,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af862b7d7/17db22cde0b34b4c862ad9a86a07bcc8/FLAG17daad73b [2025-03-16 15:54:02,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:54:02,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_alt.c [2025-03-16 15:54:02,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af862b7d7/17db22cde0b34b4c862ad9a86a07bcc8/FLAG17daad73b [2025-03-16 15:54:02,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af862b7d7/17db22cde0b34b4c862ad9a86a07bcc8 [2025-03-16 15:54:02,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:54:02,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:54:02,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:54:02,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:54:02,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:54:02,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65affddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02, skipping insertion in model container [2025-03-16 15:54:02,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:54:02,760 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/float-benchs/filter2_alt.c[631,644] [2025-03-16 15:54:02,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:54:02,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:54:02,801 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/float-benchs/filter2_alt.c[631,644] [2025-03-16 15:54:02,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:54:02,817 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:54:02,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02 WrapperNode [2025-03-16 15:54:02,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:54:02,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:54:02,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:54:02,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:54:02,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,841 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2025-03-16 15:54:02,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:54:02,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:54:02,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:54:02,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:54:02,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,856 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2025-03-16 15:54:02,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:54:02,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:54:02,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:54:02,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:54:02,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (1/1) ... [2025-03-16 15:54:02,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:54:02,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:54:02,918 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-16 15:54:02,923 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-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2025-03-16 15:54:02,938 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2025-03-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-16 15:54:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 15:54:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 15:54:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-16 15:54:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:54:02,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-16 15:54:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-16 15:54:03,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:54:03,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:54:07,234 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 15:54:07,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:54:07,240 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:54:07,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:54:07,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:54:07 BoogieIcfgContainer [2025-03-16 15:54:07,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:54:07,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:54:07,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:54:07,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:54:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:54:02" (1/3) ... [2025-03-16 15:54:07,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690f0236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:54:07, skipping insertion in model container [2025-03-16 15:54:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:54:02" (2/3) ... [2025-03-16 15:54:07,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690f0236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:54:07, skipping insertion in model container [2025-03-16 15:54:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:54:07" (3/3) ... [2025-03-16 15:54:07,248 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2025-03-16 15:54:07,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:54:07,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_alt.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:54:07,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:54:07,308 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;@a2e657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:54:07,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:54:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 15:54:07,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:54:07,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:54:07,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:54:07,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:54:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1999589059, now seen corresponding path program 1 times [2025-03-16 15:54:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:54:07,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184810634] [2025-03-16 15:54:07,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:54:07,325 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-16 15:54:07,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:54:07,328 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-16 15:54:07,330 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-16 15:54:07,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 15:54:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 15:54:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:54:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:54:07,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 15:54:07,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:54:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 15:54:07,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:54:07,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:54:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184810634] [2025-03-16 15:54:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184810634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:54:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:54:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:54:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581724428] [2025-03-16 15:54:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:54:07,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:54:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:54:07,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:54:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:54:07,716 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:54:07,726 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-16 15:54:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:54:07,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-16 15:54:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:54:07,733 INFO L225 Difference]: With dead ends: 32 [2025-03-16 15:54:07,733 INFO L226 Difference]: Without dead ends: 16 [2025-03-16 15:54:07,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-16 15:54:07,737 INFO L435 NwaCegarLoop]: 18 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, 18 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-16 15:54:07,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:54:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-16 15:54:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-16 15:54:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-16 15:54:07,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 18 [2025-03-16 15:54:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:54:07,765 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-16 15:54:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-16 15:54:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 15:54:07,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:54:07,767 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:54:07,778 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-16 15:54:07,968 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-16 15:54:07,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:54:07,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:54:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1250773085, now seen corresponding path program 1 times [2025-03-16 15:54:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:54:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613185127] [2025-03-16 15:54:07,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:54:07,969 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-16 15:54:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:54:07,971 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-16 15:54:07,973 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-16 15:54:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 15:54:08,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 15:54:08,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:54:08,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:54:08,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:54:08,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:54:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:54:08,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:54:08,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:54:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613185127] [2025-03-16 15:54:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613185127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:54:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:54:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:54:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329656638] [2025-03-16 15:54:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:54:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:54:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:54:08,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:54:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:54:08,376 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:12,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 15:54:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:54:12,519 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-16 15:54:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:54:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-16 15:54:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:54:12,557 INFO L225 Difference]: With dead ends: 38 [2025-03-16 15:54:12,557 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 15:54:12,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:54:12,558 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:54:12,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:54:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 15:54:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-16 15:54:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 15:54:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-16 15:54:12,568 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2025-03-16 15:54:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:54:12,568 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-16 15:54:12,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 15:54:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-16 15:54:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:54:12,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:54:12,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:54:12,578 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-16 15:54:12,769 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-16 15:54:12,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:54:12,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:54:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1285528662, now seen corresponding path program 1 times [2025-03-16 15:54:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:54:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396234321] [2025-03-16 15:54:12,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:54:12,771 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-16 15:54:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:54:12,774 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-16 15:54:12,784 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-16 15:54:12,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:54:17,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:54:17,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:54:17,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:54:17,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 15:54:17,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:54:17,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 15:54:17,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 15:54:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 138 [2025-03-16 15:54:18,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 49 [2025-03-16 15:54:20,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 15:54:20,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 579 treesize of output 429 [2025-03-16 15:54:21,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 15:54:21,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 309 [2025-03-16 15:54:29,140 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:54:37,207 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:54:45,327 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:54:53,393 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:01,505 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:09,659 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:17,806 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:25,954 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:34,077 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 15:55:42,234 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)