./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:02,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:02,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:18:02,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:02,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:02,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:02,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:02,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:02,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:02,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:02,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:02,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:02,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:02,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:02,172 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:02,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:02,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:02,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:02,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:02,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:02,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:02,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:02,175 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2025-03-08 14:18:02,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:02,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:02,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:02,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:02,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:02,402 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-15.i [2025-03-08 14:18:03,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee4375b/beec08fb43294791b2e45b1ebb23288d/FLAG5199c202c [2025-03-08 14:18:03,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:03,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2025-03-08 14:18:03,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee4375b/beec08fb43294791b2e45b1ebb23288d/FLAG5199c202c [2025-03-08 14:18:03,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee4375b/beec08fb43294791b2e45b1ebb23288d [2025-03-08 14:18:03,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:03,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:03,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:03,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:03,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:03,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:03,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd6631c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03, skipping insertion in model container [2025-03-08 14:18:03,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:03,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:03,915 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-15.i[915,928] [2025-03-08 14:18:03,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:03,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:03,965 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-15.i[915,928] [2025-03-08 14:18:03,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:03,993 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:03,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03 WrapperNode [2025-03-08 14:18:03,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:03,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:03,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:03,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:03,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,025 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2025-03-08 14:18:04,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:04,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:04,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:04,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:04,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:18:04,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:04,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:04,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:04,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:04,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (1/1) ... [2025-03-08 14:18:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:04,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:04,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:04,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:18:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:04,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:04,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:04,312 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:04,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:04,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:04,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:04,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:04 BoogieIcfgContainer [2025-03-08 14:18:04,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:04,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:04,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:04,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:04,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:03" (1/3) ... [2025-03-08 14:18:04,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:04, skipping insertion in model container [2025-03-08 14:18:04,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:03" (2/3) ... [2025-03-08 14:18:04,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:04, skipping insertion in model container [2025-03-08 14:18:04,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:04" (3/3) ... [2025-03-08 14:18:04,330 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2025-03-08 14:18:04,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:04,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:04,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:04,394 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;@477546bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:04,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:18:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 14:18:04,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:04,405 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:04,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:04,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1886458263, now seen corresponding path program 1 times [2025-03-08 14:18:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771859926] [2025-03-08 14:18:04,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:04,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 14:18:04,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 14:18:04,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:18:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:18:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771859926] [2025-03-08 14:18:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771859926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:18:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690293973] [2025-03-08 14:18:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:18:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:04,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:18:04,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:18:04,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 14:18:04,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 14:18:04,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:04,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:04,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:18:04,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690293973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:18:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:18:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205984746] [2025-03-08 14:18:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:18:04,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:04,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:04,696 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:04,709 INFO L93 Difference]: Finished difference Result 75 states and 116 transitions. [2025-03-08 14:18:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:04,711 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-03-08 14:18:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:04,715 INFO L225 Difference]: With dead ends: 75 [2025-03-08 14:18:04,715 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 14:18:04,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:04,720 INFO L435 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:04,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 14:18:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 14:18:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:18:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 14:18:04,751 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2025-03-08 14:18:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:04,751 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 14:18:04,752 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 14:18:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 14:18:04,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:04,754 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:04,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:18:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:18:04,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 288839978, now seen corresponding path program 1 times [2025-03-08 14:18:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116329636] [2025-03-08 14:18:04,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 14:18:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 14:18:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 14:18:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:18:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116329636] [2025-03-08 14:18:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116329636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:05,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:05,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:18:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134978932] [2025-03-08 14:18:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:05,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:18:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:18:05,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:18:05,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:18:05,214 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:05,311 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-08 14:18:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:18:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2025-03-08 14:18:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:05,314 INFO L225 Difference]: With dead ends: 102 [2025-03-08 14:18:05,314 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 14:18:05,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:18:05,315 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:05,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:18:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 14:18:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2025-03-08 14:18:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:18:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-03-08 14:18:05,326 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2025-03-08 14:18:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:05,326 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-03-08 14:18:05,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-03-08 14:18:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 14:18:05,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:05,329 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:05,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:18:05,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:05,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2013116350, now seen corresponding path program 1 times [2025-03-08 14:18:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316635555] [2025-03-08 14:18:05,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 14:18:05,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 14:18:05,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:05,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:18:05,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 14:18:05,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 14:18:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:05,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:05,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:18:05,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:18:05,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:18:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:18:05,436 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:18:05,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:18:05,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:18:05 BoogieIcfgContainer [2025-03-08 14:18:05,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:18:05,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:18:05,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:18:05,471 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:18:05,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:04" (3/4) ... [2025-03-08 14:18:05,473 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:18:05,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:18:05,475 INFO L158 Benchmark]: Toolchain (without parser) took 1681.60ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 77.7MB in the end (delta: 34.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-08 14:18:05,475 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:05,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:05,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:05,476 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:05,476 INFO L158 Benchmark]: IcfgBuilder took 262.56ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 82.6MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:05,477 INFO L158 Benchmark]: TraceAbstraction took 1145.84ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 77.7MB in the end (delta: 4.4MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-08 14:18:05,477 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 77.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:05,478 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.56ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 82.6MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1145.84ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 77.7MB in the end (delta: 4.4MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 77.7MB in the end (delta: 27.1kB). 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 someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L87] isInitial = 1 [L88] FCALL initially() [L89] int k_loop; [L90] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L90] COND TRUE k_loop < 1 [L91] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=126, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=126, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=126, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=126, var_1_9=2] [L92] RET updateVariables() [L93] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=126, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=126, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=126, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L93] RET step() [L94] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=126, var_1_3=0, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=126, var_1_3=0, var_1_7=4294967293, var_1_8=126, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=126, var_1_3=0, var_1_7=4294967293, var_1_8=126, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 64 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 97 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 416/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:18:05,490 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-15.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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:07,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:07,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:18:07,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:07,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:07,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:07,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:07,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:07,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:07,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:07,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:07,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:07,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:07,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:07,338 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:07,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:07,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:07,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:07,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:07,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:07,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:07,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:07,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:07,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:07,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:07,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:07,341 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2025-03-08 14:18:07,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:07,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:07,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:07,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:07,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:07,604 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-15.i [2025-03-08 14:18:08,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9aace52/d62235cb325e4e7793ed1e5e24b203b2/FLAG7567e1015 [2025-03-08 14:18:08,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:08,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2025-03-08 14:18:08,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9aace52/d62235cb325e4e7793ed1e5e24b203b2/FLAG7567e1015 [2025-03-08 14:18:09,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9aace52/d62235cb325e4e7793ed1e5e24b203b2 [2025-03-08 14:18:09,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:09,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:09,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:09,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:09,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:09,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c5d0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09, skipping insertion in model container [2025-03-08 14:18:09,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:09,435 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-15.i[915,928] [2025-03-08 14:18:09,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:09,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:09,495 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-15.i[915,928] [2025-03-08 14:18:09,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:09,529 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:09,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09 WrapperNode [2025-03-08 14:18:09,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:09,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:09,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:09,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:09,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,554 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-03-08 14:18:09,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:09,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:09,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:09,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:09,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,571 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:18:09,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:09,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:09,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:09,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:09,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (1/1) ... [2025-03-08 14:18:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:09,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:09,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:18:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:09,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:09,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:09,875 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:09,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:09,889 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:09,889 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:09,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:09 BoogieIcfgContainer [2025-03-08 14:18:09,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:09,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:09,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:09,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:09,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:09" (1/3) ... [2025-03-08 14:18:09,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b8bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:09, skipping insertion in model container [2025-03-08 14:18:09,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:09" (2/3) ... [2025-03-08 14:18:09,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b8bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:09, skipping insertion in model container [2025-03-08 14:18:09,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:09" (3/3) ... [2025-03-08 14:18:09,898 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2025-03-08 14:18:09,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:09,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:09,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:09,970 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;@58fb8ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:09,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:18:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 14:18:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:09,983 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:09,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:09,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1886458263, now seen corresponding path program 1 times [2025-03-08 14:18:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201790984] [2025-03-08 14:18:09,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:10,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:10,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:18:10,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 14:18:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 14:18:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:10,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 14:18:10,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:10,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:10,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201790984] [2025-03-08 14:18:10,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201790984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:10,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:10,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:18:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605004388] [2025-03-08 14:18:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:10,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:10,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:10,165 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:10,180 INFO L93 Difference]: Finished difference Result 75 states and 116 transitions. [2025-03-08 14:18:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-03-08 14:18:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:10,185 INFO L225 Difference]: With dead ends: 75 [2025-03-08 14:18:10,185 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 14:18:10,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:10,189 INFO L435 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:10,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 14:18:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 14:18:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:18:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 14:18:10,219 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2025-03-08 14:18:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:10,219 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 14:18:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 14:18:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 14:18:10,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:10,222 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:10,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:18:10,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:10,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 288839978, now seen corresponding path program 1 times [2025-03-08 14:18:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680017745] [2025-03-08 14:18:10,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:10,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:10,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:10,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:10,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:18:10,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 14:18:10,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 14:18:10,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:10,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:10,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:18:10,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 14:18:10,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:10,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680017745] [2025-03-08 14:18:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680017745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:18:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956342893] [2025-03-08 14:18:10,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:18:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:10,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:18:10,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:18:10,662 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:10,788 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-08 14:18:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:18:10,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2025-03-08 14:18:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:10,790 INFO L225 Difference]: With dead ends: 102 [2025-03-08 14:18:10,791 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 14:18:10,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:18:10,792 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:10,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:18:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 14:18:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2025-03-08 14:18:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:18:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2025-03-08 14:18:10,808 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2025-03-08 14:18:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:10,808 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2025-03-08 14:18:10,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2025-03-08 14:18:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 14:18:10,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:10,809 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:10,813 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-08 14:18:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:11,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:11,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2013116350, now seen corresponding path program 1 times [2025-03-08 14:18:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385800060] [2025-03-08 14:18:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:11,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:11,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:18:11,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 14:18:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 14:18:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:11,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 14:18:11,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 14:18:14,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:14,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:14,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385800060] [2025-03-08 14:18:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385800060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 14:18:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492997235] [2025-03-08 14:18:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:14,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 14:18:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:14,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 14:18:14,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:18:14,675 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:15,383 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2025-03-08 14:18:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 14:18:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-03-08 14:18:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:15,386 INFO L225 Difference]: With dead ends: 134 [2025-03-08 14:18:15,386 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 14:18:15,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:18:15,387 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:15,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 209 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:18:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 14:18:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2025-03-08 14:18:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 14:18:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-03-08 14:18:15,401 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 63 [2025-03-08 14:18:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-03-08 14:18:15,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:18:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-03-08 14:18:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 14:18:15,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:15,406 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:15,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:18:15,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:15,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:15,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1246822167, now seen corresponding path program 1 times [2025-03-08 14:18:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659480882] [2025-03-08 14:18:15,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:15,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:15,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:15,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:15,611 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 (5)] Waiting until timeout for monitored process [2025-03-08 14:18:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 14:18:15,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 14:18:15,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:15,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:15,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:18:15,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 14:18:15,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:15,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659480882] [2025-03-08 14:18:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659480882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:15,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:15,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:18:15,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899735157] [2025-03-08 14:18:15,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:15,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:18:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:15,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:18:15,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:18:15,734 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:15,820 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2025-03-08 14:18:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:18:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-03-08 14:18:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:15,821 INFO L225 Difference]: With dead ends: 135 [2025-03-08 14:18:15,822 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 14:18:15,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:18:15,823 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:15,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:18:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 14:18:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 14:18:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 14:18:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 14:18:15,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2025-03-08 14:18:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 14:18:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 14:18:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 14:18:15,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 14:18:15,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:18:15,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:18:16,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:16,032 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 14:18:16,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 14:18:16,922 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:18:16,931 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-08 14:18:16,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-08 14:18:16,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:18:16 BoogieIcfgContainer [2025-03-08 14:18:16,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:18:16,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:18:16,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:18:16,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:18:16,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:09" (3/4) ... [2025-03-08 14:18:16,937 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 14:18:16,941 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 14:18:16,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 14:18:16,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 14:18:16,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 14:18:16,947 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 14:18:17,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 14:18:17,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 14:18:17,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:18:17,013 INFO L158 Benchmark]: Toolchain (without parser) took 7694.53ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 59.5MB in the beginning and 238.0MB in the end (delta: -178.5MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,013 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:17,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.59ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 46.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.52ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,015 INFO L158 Benchmark]: Boogie Preprocessor took 25.29ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:17,017 INFO L158 Benchmark]: IcfgBuilder took 307.20ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 29.5MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,017 INFO L158 Benchmark]: TraceAbstraction took 7041.67ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 28.9MB in the beginning and 246.3MB in the end (delta: -217.4MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,017 INFO L158 Benchmark]: Witness Printer took 78.25ms. Allocated memory is still 486.5MB. Free memory was 246.3MB in the beginning and 238.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:17,018 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.22ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.59ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 46.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.52ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.29ms. Allocated memory is still 83.9MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.20ms. Allocated memory is still 83.9MB. Free memory was 43.4MB in the beginning and 29.5MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7041.67ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 28.9MB in the beginning and 246.3MB in the end (delta: -217.4MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. * Witness Printer took 78.25ms. Allocated memory is still 486.5MB. Free memory was 246.3MB in the beginning and 238.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 64 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 481 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 173 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 15 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 90]: Location Invariant Derived location invariant: ((((((var_1_9 == 2) && (2 == last_1_var_1_9)) && (1 == var_1_10)) && (last_1_var_1_10 == 1)) && (var_1_11 <= 0)) || ((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (2 == last_1_var_1_9)) && (var_1_13 == var_1_12)) && (var_1_10 == var_1_11)) && (var_1_11 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 14:18:17,036 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 Writing output log to file Ultimate.log Result: TRUE