./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.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_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:25:36,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:25:37,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:25:37,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:25:37,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:25:37,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:25:37,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:25:37,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:25:37,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:25:37,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:25:37,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:25:37,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:25:37,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:25:37,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:25:37,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:25:37,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:25:37,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:37,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:25:37,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:25:37,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:25:37,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:25:37,071 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-03-17 03:25:37,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:25:37,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:25:37,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:25:37,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:25:37,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:25:37,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:38,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e4679bf/5be1de7d0d12437cb9abced282f63b81/FLAGfa7ed7622 [2025-03-17 03:25:38,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:25:38,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:38,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e4679bf/5be1de7d0d12437cb9abced282f63b81/FLAGfa7ed7622 [2025-03-17 03:25:38,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e4679bf/5be1de7d0d12437cb9abced282f63b81 [2025-03-17 03:25:38,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:25:38,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:25:38,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:38,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:25:38,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:25:38,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407dfde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38, skipping insertion in model container [2025-03-17 03:25:38,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:25:39,058 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-17 03:25:39,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:39,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:25:39,101 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-17 03:25:39,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:39,141 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:25:39,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39 WrapperNode [2025-03-17 03:25:39,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:39,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:39,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:25:39,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:25:39,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,171 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-17 03:25:39,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:39,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:25:39,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:25:39,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:25:39,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,192 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 03:25:39,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:25:39,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:25:39,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:25:39,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:25:39,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (1/1) ... [2025-03-17 03:25:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:39,233 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 03:25:39,247 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 03:25:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:25:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:25:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:25:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:25:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:25:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:25:39,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:25:39,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:25:39,518 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:25:39,519 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:25:39,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:25:39,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:25:39,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:39 BoogieIcfgContainer [2025-03-17 03:25:39,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:25:39,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:25:39,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:25:39,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:25:39,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:25:38" (1/3) ... [2025-03-17 03:25:39,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:39, skipping insertion in model container [2025-03-17 03:25:39,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:39" (2/3) ... [2025-03-17 03:25:39,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:39, skipping insertion in model container [2025-03-17 03:25:39,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:39" (3/3) ... [2025-03-17 03:25:39,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:39,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:25:39,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:25:39,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:25:39,614 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;@127cd5a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:25:39,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:25:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:25:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:25:39,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:39,626 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:25:39,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:39,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2095553244, now seen corresponding path program 1 times [2025-03-17 03:25:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252688288] [2025-03-17 03:25:39,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:39,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:39,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 03:25:39,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252688288] [2025-03-17 03:25:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252688288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:25:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557605334] [2025-03-17 03:25:39,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:25:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:39,812 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 03:25:39,814 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 03:25:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:39,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:39,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:39,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:39,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:25:39,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 03:25:39,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557605334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:25:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:25:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208248458] [2025-03-17 03:25:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:25:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:39,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:25:39,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:25:39,960 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 03:25:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:39,976 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2025-03-17 03:25:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:25:39,978 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-03-17 03:25:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:39,982 INFO L225 Difference]: With dead ends: 59 [2025-03-17 03:25:39,983 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 03:25:39,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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 03:25:39,988 INFO L435 NwaCegarLoop]: 41 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, 41 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 03:25:39,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 03:25:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 03:25:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:25:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-17 03:25:40,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 45 [2025-03-17 03:25:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 03:25:40,022 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 03:25:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-17 03:25:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:25:40,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:40,025 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:25:40,032 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 03:25:40,229 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 03:25:40,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1290373760, now seen corresponding path program 1 times [2025-03-17 03:25:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783977009] [2025-03-17 03:25:40,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:40,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:40,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:40,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:40,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 03:25:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783977009] [2025-03-17 03:25:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783977009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:25:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787681327] [2025-03-17 03:25:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:25:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:40,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:25:40,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:25:40,348 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 03:25:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:40,389 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-03-17 03:25:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:25:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-03-17 03:25:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:40,393 INFO L225 Difference]: With dead ends: 64 [2025-03-17 03:25:40,393 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 03:25:40,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:25:40,394 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:40,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 03:25:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2025-03-17 03:25:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:25:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 03:25:40,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 45 [2025-03-17 03:25:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:40,400 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 03:25:40,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 03:25:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 03:25:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:25:40,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:40,401 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:25:40,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:25:40,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash 402870079, now seen corresponding path program 1 times [2025-03-17 03:25:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058384356] [2025-03-17 03:25:40,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:40,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:40,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:40,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:40,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:25:40,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:25:40,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:40,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:40,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:25:40,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:25:40,501 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:25:40,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:25:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:25:40,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:25:40,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:25:40,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:25:40 BoogieIcfgContainer [2025-03-17 03:25:40,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:25:40,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:25:40,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:25:40,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:25:40,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:39" (3/4) ... [2025-03-17 03:25:40,540 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:25:40,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:25:40,542 INFO L158 Benchmark]: Toolchain (without parser) took 1642.01ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 57.2MB in the end (delta: 76.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 03:25:40,542 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:40,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.61ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 121.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:25:40,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:40,543 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:25:40,543 INFO L158 Benchmark]: IcfgBuilder took 331.87ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 105.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:25:40,544 INFO L158 Benchmark]: TraceAbstraction took 1002.47ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 57.5MB in the end (delta: 47.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 03:25:40,544 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 167.8MB. Free memory was 57.5MB in the beginning and 57.2MB in the end (delta: 277.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:40,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.61ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 121.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 331.87ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 105.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1002.47ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 57.5MB in the end (delta: 47.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 167.8MB. Free memory was 57.5MB in the beginning and 57.2MB in the end (delta: 277.5kB). 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 someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 36, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 [L83] RET updateLastVariables() [L84] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L84] RET updateVariables() [L85] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 49 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 78 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 170/180 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 03:25:40,567 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_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:25:42,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:25:42,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:25:42,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:25:42,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:25:42,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:25:42,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:25:42,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:25:42,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:25:42,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:25:42,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:25:42,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:25:42,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:25:42,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:42,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:25:42,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:25:42,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:25:42,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:25:42,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:25:42,937 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-03-17 03:25:43,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:25:43,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:25:43,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:25:43,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:25:43,247 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:25:43,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:44,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe4afe7/090e08729c1945a58acfb2357c425e1c/FLAG30a061e3e [2025-03-17 03:25:44,863 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:25:44,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:44,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe4afe7/090e08729c1945a58acfb2357c425e1c/FLAG30a061e3e [2025-03-17 03:25:44,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe4afe7/090e08729c1945a58acfb2357c425e1c [2025-03-17 03:25:44,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:25:44,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:25:44,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:44,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:25:44,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:25:44,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:44" (1/1) ... [2025-03-17 03:25:44,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d45283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:44, skipping insertion in model container [2025-03-17 03:25:44,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:44" (1/1) ... [2025-03-17 03:25:44,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:25:45,032 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-17 03:25:45,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:45,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:25:45,100 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-03-17 03:25:45,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:45,137 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:25:45,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45 WrapperNode [2025-03-17 03:25:45,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:45,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:45,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:25:45,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:25:45,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,181 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-17 03:25:45,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:45,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:25:45,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:25:45,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:25:45,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,205 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 03:25:45,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:25:45,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:25:45,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:25:45,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:25:45,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (1/1) ... [2025-03-17 03:25:45,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:45,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:45,266 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 03:25:45,270 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 03:25:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:25:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:25:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:25:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:25:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:25:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:25:45,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:25:45,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:25:55,300 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:25:55,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:25:55,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:25:55,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:25:55,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:55 BoogieIcfgContainer [2025-03-17 03:25:55,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:25:55,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:25:55,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:25:55,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:25:55,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:25:44" (1/3) ... [2025-03-17 03:25:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41955608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:55, skipping insertion in model container [2025-03-17 03:25:55,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:45" (2/3) ... [2025-03-17 03:25:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41955608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:55, skipping insertion in model container [2025-03-17 03:25:55,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:55" (3/3) ... [2025-03-17 03:25:55,323 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-03-17 03:25:55,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:25:55,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:25:55,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:25:55,391 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;@15f20416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:25:55,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:25:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:25:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:25:55,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:55,406 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:25:55,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:55,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2095553244, now seen corresponding path program 1 times [2025-03-17 03:25:55,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615533214] [2025-03-17 03:25:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:55,426 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 03:25:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:55,430 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 03:25:55,433 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 03:25:55,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:55,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:55,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:25:55,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 03:25:55,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:55,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615533214] [2025-03-17 03:25:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615533214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:55,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:25:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855443768] [2025-03-17 03:25:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:25:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:55,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:25:55,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:25:55,924 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 03:25:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:55,937 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2025-03-17 03:25:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:25:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-03-17 03:25:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:55,942 INFO L225 Difference]: With dead ends: 59 [2025-03-17 03:25:55,942 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 03:25:55,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 03:25:55,947 INFO L435 NwaCegarLoop]: 41 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, 41 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 03:25:55,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 03:25:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 03:25:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:25:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-17 03:25:55,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 45 [2025-03-17 03:25:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:55,975 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 03:25:55,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 03:25:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-17 03:25:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:25:55,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:55,981 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:25:55,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:25:56,181 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 03:25:56,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:56,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1290373760, now seen corresponding path program 1 times [2025-03-17 03:25:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120009075] [2025-03-17 03:25:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:56,184 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 03:25:56,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:56,186 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 03:25:56,187 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 03:25:56,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:25:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:25:56,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:56,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:56,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 03:25:56,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 03:25:56,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:56,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120009075] [2025-03-17 03:25:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120009075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:56,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:56,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:25:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847920957] [2025-03-17 03:25:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:56,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:25:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:56,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:25:56,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:25:56,586 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 03:25:59,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:26:03,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:26:07,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:26:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:26:07,760 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-03-17 03:26:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:26:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-03-17 03:26:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:26:07,763 INFO L225 Difference]: With dead ends: 64 [2025-03-17 03:26:07,763 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 03:26:07,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:26:07,764 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:26:07,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2025-03-17 03:26:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 03:26:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2025-03-17 03:26:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 03:26:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-17 03:26:07,771 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 45 [2025-03-17 03:26:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:26:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-17 03:26:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 03:26:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-17 03:26:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 03:26:07,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:26:07,773 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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 03:26:07,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:26:07,974 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 03:26:07,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:26:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:26:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 402870079, now seen corresponding path program 1 times [2025-03-17 03:26:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:26:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822171596] [2025-03-17 03:26:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:26:07,976 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 03:26:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:26:07,980 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 03:26:07,981 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 03:26:08,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 03:26:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 03:26:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:26:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:26:08,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 03:26:08,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:26:29,470 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 03:26:37,639 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:26:45,771 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:26:53,919 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:27:02,094 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:27:10,249 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 03:27:18,386 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)