./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.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 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:40:19,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:40:19,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:40:19,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:40:19,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:40:19,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:40:19,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:40:19,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:40:19,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:40:19,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:40:19,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:40:19,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:40:19,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:40:19,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:40:19,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:40:19,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:40:19,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:40:19,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:40:19,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:40:19,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:40:19,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:40:19,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:40:19,562 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 -> 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 [2025-03-17 04:40:19,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:40:19,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:40:19,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:40:19,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:40:19,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:40:19,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:20,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d99b3433/41b23957d2424a70b9148f2043871849/FLAG7b61b78d7 [2025-03-17 04:40:21,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:40:21,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:21,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d99b3433/41b23957d2424a70b9148f2043871849/FLAG7b61b78d7 [2025-03-17 04:40:21,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d99b3433/41b23957d2424a70b9148f2043871849 [2025-03-17 04:40:21,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:40:21,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:40:21,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:40:21,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:40:21,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:40:21,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5824e600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21, skipping insertion in model container [2025-03-17 04:40:21,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:40:21,402 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_operatoramount_amount25_file-47.i[915,928] [2025-03-17 04:40:21,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:40:21,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:40:21,460 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_operatoramount_amount25_file-47.i[915,928] [2025-03-17 04:40:21,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:40:21,492 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:40:21,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21 WrapperNode [2025-03-17 04:40:21,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:40:21,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:40:21,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:40:21,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:40:21,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,527 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-03-17 04:40:21,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:40:21,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:40:21,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:40:21,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:40:21,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,549 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:40:21,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:40:21,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:40:21,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:40:21,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:40:21,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (1/1) ... [2025-03-17 04:40:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:40:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:40:21,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:40:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:40:21,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:40:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:40:21,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:40:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:40:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:40:21,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:40:21,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:40:21,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:40:21,869 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:40:21,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:40:21,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:40:21,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:40:21,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:40:21 BoogieIcfgContainer [2025-03-17 04:40:21,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:40:21,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:40:21,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:40:21,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:40:21,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:40:21" (1/3) ... [2025-03-17 04:40:21,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933e682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:40:21, skipping insertion in model container [2025-03-17 04:40:21,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:21" (2/3) ... [2025-03-17 04:40:21,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933e682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:40:21, skipping insertion in model container [2025-03-17 04:40:21,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:40:21" (3/3) ... [2025-03-17 04:40:21,891 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:21,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:40:21,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-47.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:40:21,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:40:21,965 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;@78158b6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:40:21,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:40:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:40:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 04:40:21,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:40:21,977 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:40:21,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:40:21,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:40:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1759579799, now seen corresponding path program 1 times [2025-03-17 04:40:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:40:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378773218] [2025-03-17 04:40:21,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:40:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:40:22,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:22,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:22,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:40:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:40:22,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:40:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378773218] [2025-03-17 04:40:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378773218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:40:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160191327] [2025-03-17 04:40:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:40:22,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:40:22,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:40:22,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:40:22,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:40:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:22,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:22,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:22,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:40:22,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:40:22,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:40:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:40:22,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:40:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160191327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:40:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:40:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:40:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296699662] [2025-03-17 04:40:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:40:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:40:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:40:22,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:40:22,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:40:22,344 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:40:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:40:22,362 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2025-03-17 04:40:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:40:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2025-03-17 04:40:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:40:22,369 INFO L225 Difference]: With dead ends: 67 [2025-03-17 04:40:22,370 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 04:40:22,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:40:22,376 INFO L435 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:40:22,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:40:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 04:40:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 04:40:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:40:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2025-03-17 04:40:22,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2025-03-17 04:40:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:40:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2025-03-17 04:40:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:40:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2025-03-17 04:40:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 04:40:22,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:40:22,411 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:40:22,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:40:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:40:22,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:40:22,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:40:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1389797163, now seen corresponding path program 1 times [2025-03-17 04:40:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:40:22,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550977367] [2025-03-17 04:40:22,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:40:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:40:22,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:22,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:22,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:40:22,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:40:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:22,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:40:22,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:40:22,929 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:40:22,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:40:22,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:40:22,934 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:40:22,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:40:22,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:40:22 BoogieIcfgContainer [2025-03-17 04:40:22,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:40:22,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:40:22,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:40:22,979 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:40:22,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:40:21" (3/4) ... [2025-03-17 04:40:22,982 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:40:22,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:40:22,983 INFO L158 Benchmark]: Toolchain (without parser) took 1716.88ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 83.6MB in the end (delta: 21.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-03-17 04:40:22,984 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:40:22,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.96ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:40:22,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.81ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.6MB in the end (delta: 948.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:40:22,985 INFO L158 Benchmark]: Boogie Preprocessor took 37.75ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:40:22,985 INFO L158 Benchmark]: IcfgBuilder took 315.42ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 75.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:40:22,986 INFO L158 Benchmark]: TraceAbstraction took 1093.90ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 83.6MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:40:22,988 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:40:22,989 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.96ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.81ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.6MB in the end (delta: 948.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.75ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.42ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 75.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1093.90ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 83.6MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someUnaryFLOAToperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 128.5; [L24] float var_1_9 = -0.5; [L25] float var_1_10 = 200.4; [L26] unsigned long int var_1_11 = 4; [L27] unsigned char var_1_12 = 1; [L28] unsigned long int var_1_13 = 3607105345; [L29] signed char var_1_14 = 0; [L30] signed char var_1_15 = 0; [L31] signed char var_1_16 = 16; [L32] double last_1_var_1_1 = 24.575; [L33] float last_1_var_1_9 = -0.5; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_1 = var_1_1 [L78] last_1_var_1_9 = var_1_9 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L59] var_1_8 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L60] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L62] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L63] var_1_12 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L64] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L65] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L65] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L66] var_1_13 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L67] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L68] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L68] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L69] var_1_15 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L70] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L71] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L71] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L72] var_1_16 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L74] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L74] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L89] RET updateVariables() [L90] CALL step() [L37] COND FALSE !(((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) [L42] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L44] COND TRUE \read(var_1_12) [L45] var_1_11 = ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=126, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L49] var_1_9 = ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=126, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967299] [L50] COND FALSE !(var_1_9 <= var_1_9) [L55] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=126, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_9 <= var_1_9) ? (((var_1_11 + var_1_11) >= (var_1_14 + var_1_14)) ? (var_1_1 == ((double) var_1_8)) : 1) : (var_1_1 == ((double) var_1_8))) && (var_1_9 == ((float) ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f))))))))) && (var_1_12 ? (var_1_11 == ((unsigned long int) ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))))) : (var_1_11 == ((unsigned long int) ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))))))) && ((((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) ? (var_1_12 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : 1) : (var_1_14 == ((signed char) var_1_15))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=126, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=126, var_1_12=1, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 61 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 10, 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, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 47 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:40:23,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.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 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:40:24,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:40:25,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:40:25,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:40:25,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:40:25,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:40:25,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:40:25,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:40:25,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:40:25,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:40:25,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:40:25,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:40:25,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:40:25,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:40:25,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:40:25,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:40:25,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:40:25,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:40:25,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:40:25,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:40:25,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:40:25,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:40:25,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:40:25,073 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 -> 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 [2025-03-17 04:40:25,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:40:25,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:40:25,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:40:25,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:40:25,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:40:25,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:26,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b72e2ff/283f84afdce64580b704e5ed3aa180d9/FLAGe3e1a07c3 [2025-03-17 04:40:26,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:40:26,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:26,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b72e2ff/283f84afdce64580b704e5ed3aa180d9/FLAGe3e1a07c3 [2025-03-17 04:40:27,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b72e2ff/283f84afdce64580b704e5ed3aa180d9 [2025-03-17 04:40:27,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:40:27,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:40:27,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:40:27,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:40:27,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:40:27,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c3d3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27, skipping insertion in model container [2025-03-17 04:40:27,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:40:27,151 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_operatoramount_amount25_file-47.i[915,928] [2025-03-17 04:40:27,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:40:27,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:40:27,208 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_operatoramount_amount25_file-47.i[915,928] [2025-03-17 04:40:27,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:40:27,236 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:40:27,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27 WrapperNode [2025-03-17 04:40:27,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:40:27,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:40:27,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:40:27,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:40:27,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,268 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-17 04:40:27,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:40:27,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:40:27,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:40:27,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:40:27,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:40:27,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:40:27,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:40:27,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:40:27,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:40:27,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (1/1) ... [2025-03-17 04:40:27,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:40:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:40:27,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:40:27,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:40:27,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:40:27,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:40:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:40:27,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:40:27,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:40:27,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:40:27,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:40:27,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:40:28,003 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:40:28,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:40:28,013 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:40:28,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:40:28,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:40:28 BoogieIcfgContainer [2025-03-17 04:40:28,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:40:28,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:40:28,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:40:28,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:40:28,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:40:27" (1/3) ... [2025-03-17 04:40:28,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:40:28, skipping insertion in model container [2025-03-17 04:40:28,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:40:27" (2/3) ... [2025-03-17 04:40:28,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:40:28, skipping insertion in model container [2025-03-17 04:40:28,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:40:28" (3/3) ... [2025-03-17 04:40:28,023 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-47.i [2025-03-17 04:40:28,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:40:28,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-47.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:40:28,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:40:28,086 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;@34ca04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:40:28,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:40:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:40:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 04:40:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:40:28,098 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:40:28,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:40:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:40:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1759579799, now seen corresponding path program 1 times [2025-03-17 04:40:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:40:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298711352] [2025-03-17 04:40:28,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:40:28,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:40:28,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:40:28,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:40:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 04:40:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:28,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:28,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:28,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:40:28,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:40:28,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:40:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 04:40:28,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:40:28,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:40:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298711352] [2025-03-17 04:40:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298711352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:40:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:40:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:40:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972200476] [2025-03-17 04:40:28,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:40:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:40:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:40:28,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:40:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:40:28,347 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:40:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:40:28,363 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2025-03-17 04:40:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:40:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2025-03-17 04:40:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:40:28,369 INFO L225 Difference]: With dead ends: 67 [2025-03-17 04:40:28,369 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 04:40:28,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:40:28,375 INFO L435 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:40:28,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:40:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 04:40:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 04:40:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:40:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2025-03-17 04:40:28,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2025-03-17 04:40:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:40:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2025-03-17 04:40:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 04:40:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2025-03-17 04:40:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 04:40:28,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:40:28,411 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:40:28,418 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:40:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:40:28,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:40:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:40:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1389797163, now seen corresponding path program 1 times [2025-03-17 04:40:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:40:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892684911] [2025-03-17 04:40:28,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:40:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:40:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:40:28,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:40:28,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 04:40:28,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 04:40:28,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 04:40:28,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:40:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:40:28,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:40:28,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:40:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-17 04:40:31,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:40:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 04:40:40,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:40:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892684911] [2025-03-17 04:40:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892684911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:40:40,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:40:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 04:40:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404464381] [2025-03-17 04:40:40,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:40:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:40:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:40:40,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:40:40,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:40:40,844 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 04:40:53,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:03,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:07,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:09,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:11,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:13,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:14,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:16,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 04:41:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:41:22,821 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2025-03-17 04:41:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 04:41:22,834 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 65 [2025-03-17 04:41:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:41:22,835 INFO L225 Difference]: With dead ends: 102 [2025-03-17 04:41:22,835 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 04:41:22,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2025-03-17 04:41:22,836 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 69 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:41:22,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 26.2s Time] [2025-03-17 04:41:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 04:41:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2025-03-17 04:41:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 04:41:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-17 04:41:22,844 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 65 [2025-03-17 04:41:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:41:22,845 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-17 04:41:22,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-17 04:41:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-03-17 04:41:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 04:41:22,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:41:22,846 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:41:22,853 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-17 04:41:23,047 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-17 04:41:23,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:41:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:41:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 134994361, now seen corresponding path program 1 times [2025-03-17 04:41:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:41:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787140934] [2025-03-17 04:41:23,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:41:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:41:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:41:23,050 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-17 04:41:23,051 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-17 04:41:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 04:41:23,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 04:41:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:41:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:41:23,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 04:41:23,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:42:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 04:42:00,485 INFO L312 TraceCheckSpWp]: Computing backward predicates...