./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e99d35828d6ed1833054a5795559b975d53140c1400b244d3e6935a75b4a1d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:24:12,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:24:12,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:24:12,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:24:12,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:24:12,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:24:12,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:24:12,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:24:12,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:24:12,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:24:12,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:24:12,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:24:12,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:24:12,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:24:12,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:24:12,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:24:12,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:24:12,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:24:12,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:24:12,570 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 -> 5e99d35828d6ed1833054a5795559b975d53140c1400b244d3e6935a75b4a1d6 [2025-03-08 10:24:12,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:24:12,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:24:12,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:24:12,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:24:12,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:24:12,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:13,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87935a5b0/f2308b79c78b48579a0e93b174ffdf57/FLAGbc2a7deaf [2025-03-08 10:24:14,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:24:14,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:14,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87935a5b0/f2308b79c78b48579a0e93b174ffdf57/FLAGbc2a7deaf [2025-03-08 10:24:14,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87935a5b0/f2308b79c78b48579a0e93b174ffdf57 [2025-03-08 10:24:14,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:24:14,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:24:14,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:24:14,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:24:14,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:24:14,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14, skipping insertion in model container [2025-03-08 10:24:14,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:24:14,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i[913,926] [2025-03-08 10:24:14,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:24:14,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:24:14,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i[913,926] [2025-03-08 10:24:14,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:24:14,724 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:24:14,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14 WrapperNode [2025-03-08 10:24:14,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:24:14,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:24:14,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:24:14,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:24:14,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,752 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-03-08 10:24:14,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:24:14,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:24:14,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:24:14,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:24:14,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,771 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:24:14,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:24:14,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:24:14,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:24:14,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:24:14,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (1/1) ... [2025-03-08 10:24:14,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:24:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:24:14,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:24:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:24:14,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:24:14,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:24:14,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:24:14,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:24:14,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:24:14,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:24:14,889 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:24:14,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:24:15,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~bitwise15#1; [2025-03-08 10:24:15,112 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:24:15,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:24:15,126 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:24:15,126 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:24:15,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:24:15 BoogieIcfgContainer [2025-03-08 10:24:15,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:24:15,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:24:15,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:24:15,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:24:15,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:24:14" (1/3) ... [2025-03-08 10:24:15,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:24:15, skipping insertion in model container [2025-03-08 10:24:15,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:14" (2/3) ... [2025-03-08 10:24:15,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:24:15, skipping insertion in model container [2025-03-08 10:24:15,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:24:15" (3/3) ... [2025-03-08 10:24:15,134 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:15,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:24:15,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-39.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:24:15,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:24:15,192 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;@67104c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:24:15,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:24:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 10:24:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 10:24:15,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:24:15,202 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:24:15,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:24:15,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:24:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1378637495, now seen corresponding path program 1 times [2025-03-08 10:24:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:24:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121606337] [2025-03-08 10:24:15,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:24:15,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 10:24:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 10:24:15,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:15,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:24:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 10:24:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:24:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121606337] [2025-03-08 10:24:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121606337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:24:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127179866] [2025-03-08 10:24:15,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:24:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:24:15,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:24:15,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:24:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 10:24:15,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 10:24:15,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:15,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:24:15,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:24:15,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:24:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 10:24:15,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:24:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127179866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:24:15,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:24:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:24:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060235808] [2025-03-08 10:24:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:24:15,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:24:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:24:15,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:24:15,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:24:15,610 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 10:24:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:24:15,634 INFO L93 Difference]: Finished difference Result 126 states and 207 transitions. [2025-03-08 10:24:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:24:15,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2025-03-08 10:24:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:24:15,642 INFO L225 Difference]: With dead ends: 126 [2025-03-08 10:24:15,642 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 10:24:15,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:24:15,649 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:24:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:24:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 10:24:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 10:24:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 10:24:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-03-08 10:24:15,679 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 111 [2025-03-08 10:24:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:24:15,679 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-03-08 10:24:15,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 10:24:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-03-08 10:24:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 10:24:15,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:24:15,681 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:24:15,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:24:15,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:24:15,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:24:15,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:24:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash 129337147, now seen corresponding path program 1 times [2025-03-08 10:24:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:24:15,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732649717] [2025-03-08 10:24:15,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:24:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 10:24:16,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 10:24:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:24:16,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:24:16,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 10:24:16,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 10:24:16,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:16,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:24:16,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:24:16,519 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:24:16,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:24:16,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:24:16,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 10:24:16,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:24:16,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:24:16 BoogieIcfgContainer [2025-03-08 10:24:16,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:24:16,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:24:16,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:24:16,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:24:16,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:24:15" (3/4) ... [2025-03-08 10:24:16,603 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:24:16,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:24:16,605 INFO L158 Benchmark]: Toolchain (without parser) took 2085.91ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 86.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.92ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: IcfgBuilder took 346.07ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 65.1MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:24:16,605 INFO L158 Benchmark]: TraceAbstraction took 1471.31ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 86.3MB in the end (delta: -22.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-03-08 10:24:16,606 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:24:16,606 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.76ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.92ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.25ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 346.07ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 65.1MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1471.31ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 86.3MB in the end (delta: -22.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] unsigned char var_1_6 = 0; [L24] signed short int var_1_7 = 8; [L25] signed short int var_1_8 = 4; [L26] unsigned long int var_1_9 = 256; [L27] unsigned long int var_1_10 = 10; [L28] unsigned long int var_1_11 = 3084274888; [L29] unsigned long int var_1_13 = 50; [L30] signed long int var_1_14 = -10; [L31] unsigned char var_1_16 = 0; [L32] float var_1_19 = 4.5; [L33] float var_1_20 = 15.375; [L34] float var_1_21 = 32.725; [L35] float var_1_22 = 63.5; [L36] float var_1_23 = 16.375; [L37] signed char var_1_24 = -32; [L38] signed char var_1_25 = 0; [L39] unsigned short int var_1_26 = 64; [L40] unsigned long int last_1_var_1_9 = 256; [L41] unsigned long int last_1_var_1_10 = 10; [L42] signed long int last_1_var_1_14 = -10; [L43] signed char last_1_var_1_24 = -32; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L120] last_1_var_1_9 = var_1_9 [L121] last_1_var_1_10 = var_1_10 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L133] RET updateLastVariables() [L134] CALL updateVariables() [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L95] var_1_7 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L96] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L97] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L97] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=4, var_1_9=256] [L98] var_1_8 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L100] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L100] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L102] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L103] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L103] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L104] var_1_16 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L105] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L106] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L106] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L107] var_1_20 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L108] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L110] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L111] var_1_22 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L112] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L113] var_1_23 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L114] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L115] var_1_25 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_25 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L116] RET assume_abort_if_not(var_1_25 >= -127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L117] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L117] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L134] RET updateVariables() [L135] CALL step() [L47] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L47] unsigned long int stepLocal_0 = (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10; [L48] COND TRUE stepLocal_0 < (last_1_var_1_24 | -4) [L49] var_1_1 = (var_1_7 - var_1_8) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=255, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L53] var_1_24 = var_1_25 [L54] var_1_26 = var_1_8 [L55] var_1_10 = ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26)))))) [L56] unsigned long int stepLocal_3 = var_1_8 / (1u + 16u); [L57] unsigned long int stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_3=14, var_1_10=254, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=255, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L58] COND FALSE !(var_1_26 < stepLocal_3) [L65] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=255, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L67] signed short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_4=254, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=255, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L68] COND TRUE stepLocal_4 <= var_1_13 [L69] var_1_19 = (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L73] unsigned long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_1=254, stepLocal_2=2147483647, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L74] COND FALSE !(stepLocal_1 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L79] COND FALSE !(var_1_26 >= var_1_7) [L88] var_1_14 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=0, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=0, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L126-L127] return ((((((((((last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10) < (last_1_var_1_24 | -4)) ? (var_1_1 == ((signed short int) (var_1_7 - var_1_8))) : (var_1_1 == ((signed short int) (last_1_var_1_10 + -16)))) && ((var_1_10 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) ? (var_1_6 ? (var_1_9 == ((unsigned long int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned long int) ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))))))) && ((var_1_26 < (var_1_8 / (1u + 16u))) ? ((var_1_11 > (var_1_26 + 5u)) ? (var_1_13 == ((unsigned long int) ((((var_1_26) > (var_1_11)) ? (var_1_26) : (var_1_11))))) : (var_1_13 == ((unsigned long int) 5u))) : (var_1_13 == ((unsigned long int) var_1_8)))) && ((var_1_26 >= var_1_7) ? ((var_1_1 > var_1_11) ? ((var_1_6 && var_1_16) ? (var_1_14 == ((signed long int) (var_1_7 - (var_1_26 + var_1_8)))) : (var_1_14 == ((signed long int) var_1_26))) : 1) : (var_1_14 == ((signed long int) var_1_24)))) && ((var_1_8 <= var_1_13) ? (var_1_19 == ((float) (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))))) : (var_1_19 == ((float) var_1_22)))) && (var_1_24 == ((signed char) var_1_25))) && (var_1_26 == ((unsigned short int) var_1_8)) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=0, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=254, var_1_11=2147483647, var_1_13=254, var_1_14=0, var_1_16=1, var_1_19=3084274893, var_1_1=255, var_1_23=3084274893, var_1_24=0, var_1_25=0, var_1_26=254, var_1_6=1, var_1_7=509, var_1_8=254, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 114 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 91 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:24:16,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e99d35828d6ed1833054a5795559b975d53140c1400b244d3e6935a75b4a1d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:24:18,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:24:18,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:24:18,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:24:18,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:24:18,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:24:18,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:24:18,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:24:18,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:24:18,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:24:18,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:24:18,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:24:18,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:24:18,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:24:18,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:24:18,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:24:18,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:24:18,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:24:18,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:24:18,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:24:18,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:24:18,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:24:18,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:24:18,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:24:18,573 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 -> 5e99d35828d6ed1833054a5795559b975d53140c1400b244d3e6935a75b4a1d6 [2025-03-08 10:24:18,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:24:18,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:24:18,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:24:18,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:24:18,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:24:18,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:20,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d367d399/812326efa06d4c659b916649ed225e60/FLAG9080e4879 [2025-03-08 10:24:20,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:24:20,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:20,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d367d399/812326efa06d4c659b916649ed225e60/FLAG9080e4879 [2025-03-08 10:24:20,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d367d399/812326efa06d4c659b916649ed225e60 [2025-03-08 10:24:20,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:24:20,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:24:20,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:24:20,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:24:20,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:24:20,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8a9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20, skipping insertion in model container [2025-03-08 10:24:20,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:24:20,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i[913,926] [2025-03-08 10:24:20,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:24:20,406 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:24:20,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-39.i[913,926] [2025-03-08 10:24:20,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:24:20,468 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:24:20,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20 WrapperNode [2025-03-08 10:24:20,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:24:20,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:24:20,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:24:20,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:24:20,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,510 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-08 10:24:20,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:24:20,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:24:20,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:24:20,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:24:20,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:24:20,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:24:20,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:24:20,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:24:20,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:24:20,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (1/1) ... [2025-03-08 10:24:20,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:24:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:24:20,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:24:20,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:24:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:24:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:24:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:24:20,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:24:20,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:24:20,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:24:20,662 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:24:20,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:24:21,048 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:24:21,048 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:24:21,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:24:21,057 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:24:21,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:24:21 BoogieIcfgContainer [2025-03-08 10:24:21,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:24:21,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:24:21,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:24:21,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:24:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:24:20" (1/3) ... [2025-03-08 10:24:21,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b33a8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:24:21, skipping insertion in model container [2025-03-08 10:24:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:24:20" (2/3) ... [2025-03-08 10:24:21,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b33a8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:24:21, skipping insertion in model container [2025-03-08 10:24:21,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:24:21" (3/3) ... [2025-03-08 10:24:21,065 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-39.i [2025-03-08 10:24:21,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:24:21,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-39.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:24:21,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:24:21,122 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;@700e5d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:24:21,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:24:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 10:24:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 10:24:21,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:24:21,133 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:24:21,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:24:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:24:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 70274413, now seen corresponding path program 1 times [2025-03-08 10:24:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:24:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383194583] [2025-03-08 10:24:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:24:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:24:21,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:24:21,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:24:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 10:24:21,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 10:24:21,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:21,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:24:21,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:24:21,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:24:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 10:24:21,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:24:21,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:24:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383194583] [2025-03-08 10:24:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383194583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:24:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:24:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:24:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217323226] [2025-03-08 10:24:21,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:24:21,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:24:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:24:21,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:24:21,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:24:21,397 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 10:24:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:24:21,414 INFO L93 Difference]: Finished difference Result 106 states and 175 transitions. [2025-03-08 10:24:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:24:21,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-03-08 10:24:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:24:21,420 INFO L225 Difference]: With dead ends: 106 [2025-03-08 10:24:21,421 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 10:24:21,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:24:21,425 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:24:21,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:24:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 10:24:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 10:24:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 10:24:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-03-08 10:24:21,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 107 [2025-03-08 10:24:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:24:21,456 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-03-08 10:24:21,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 10:24:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-03-08 10:24:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 10:24:21,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:24:21,459 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:24:21,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:24:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:24:21,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:24:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:24:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1278320655, now seen corresponding path program 1 times [2025-03-08 10:24:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:24:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306863588] [2025-03-08 10:24:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:24:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:24:21,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:24:21,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:24:21,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 10:24:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 10:24:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:24:21,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:24:21,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:24:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 10:24:22,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:24:22,446 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:24:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306863588] [2025-03-08 10:24:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306863588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:24:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:24:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:24:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480056551] [2025-03-08 10:24:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:24:22,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:24:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:24:22,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:24:22,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:24:22,448 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 10:24:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:24:22,780 INFO L93 Difference]: Finished difference Result 154 states and 226 transitions. [2025-03-08 10:24:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:24:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-08 10:24:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:24:22,787 INFO L225 Difference]: With dead ends: 154 [2025-03-08 10:24:22,787 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 10:24:22,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:24:22,788 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:24:22,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 282 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:24:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 10:24:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2025-03-08 10:24:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 10:24:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2025-03-08 10:24:22,805 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 107 [2025-03-08 10:24:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:24:22,806 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2025-03-08 10:24:22,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 10:24:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2025-03-08 10:24:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 10:24:22,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:24:22,814 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:24:22,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:24:23,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:24:23,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:24:23,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:24:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1407403374, now seen corresponding path program 1 times [2025-03-08 10:24:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:24:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446180575] [2025-03-08 10:24:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:24:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:24:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:24:23,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:24:23,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:24:23,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 10:24:23,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 10:24:23,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:24:23,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:24:23,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 10:24:23,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:24:54,787 WARN L286 SmtUtils]: Spent 8.03s 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-08 10:25:20,125 WARN L286 SmtUtils]: Spent 21.23s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 10:25:40,940 WARN L286 SmtUtils]: Spent 8.03s 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)