./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_variablewrapping_normal_file-24.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 a51318993ea13721f6dafa900810134bb32711cd41e6503c3f74581bbdabe004 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:13,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:13,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:52:13,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:13,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:13,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:13,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:13,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:13,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:13,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:13,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:13,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:13,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:13,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:13,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:13,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:13,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:13,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:13,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:13,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:13,283 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 -> a51318993ea13721f6dafa900810134bb32711cd41e6503c3f74581bbdabe004 [2025-03-04 00:52:13,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:13,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:13,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:13,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:13,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:13,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:14,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4058688d2/976e617f50dc4b3484056353ac1b369d/FLAG5013a6297 [2025-03-04 00:52:14,816 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:14,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:14,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4058688d2/976e617f50dc4b3484056353ac1b369d/FLAG5013a6297 [2025-03-04 00:52:15,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4058688d2/976e617f50dc4b3484056353ac1b369d [2025-03-04 00:52:15,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:15,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:15,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:15,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:15,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:15,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398c1f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15, skipping insertion in model container [2025-03-04 00:52:15,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:15,259 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_variablewrapping_normal_file-24.i[913,926] [2025-03-04 00:52:15,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:15,312 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:15,319 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_variablewrapping_normal_file-24.i[913,926] [2025-03-04 00:52:15,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:15,359 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:15,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15 WrapperNode [2025-03-04 00:52:15,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:15,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:15,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:15,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:15,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,393 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-04 00:52:15,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:15,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:15,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:15,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:15,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,423 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-04 00:52:15,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:15,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:15,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:15,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:15,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (1/1) ... [2025-03-04 00:52:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:15,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:15,461 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-04 00:52:15,469 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-04 00:52:15,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:15,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:15,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:15,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:52:15,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:15,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:15,536 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:15,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:15,735 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:15,735 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:15,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:15,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:15,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:15 BoogieIcfgContainer [2025-03-04 00:52:15,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:15,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:15,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:15,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:15,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:15" (1/3) ... [2025-03-04 00:52:15,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffac974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:15, skipping insertion in model container [2025-03-04 00:52:15,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:15" (2/3) ... [2025-03-04 00:52:15,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffac974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:15, skipping insertion in model container [2025-03-04 00:52:15,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:15" (3/3) ... [2025-03-04 00:52:15,755 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:15,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:15,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-24.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:15,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:15,818 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;@317d61cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:15,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:15,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:15,827 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:15,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash 167597582, now seen corresponding path program 1 times [2025-03-04 00:52:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-04 00:52:15,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:15,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:15,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:15,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:52:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-04 00:52:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127760334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462353104] [2025-03-04 00:52:15,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:15,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:15,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:15,992 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-04 00:52:15,994 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-04 00:52:16,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:16,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:16,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:16,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:52:16,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462353104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:52:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:52:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812927109] [2025-03-04 00:52:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:16,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:16,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:16,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:16,164 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:52:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:16,178 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2025-03-04 00:52:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-04 00:52:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:16,185 INFO L225 Difference]: With dead ends: 86 [2025-03-04 00:52:16,185 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 00:52:16,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-04 00:52:16,188 INFO L435 NwaCegarLoop]: 61 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, 61 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-04 00:52:16,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 00:52:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 00:52:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 00:52:16,216 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 96 [2025-03-04 00:52:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:16,216 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 00:52:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:52:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 00:52:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:16,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:16,221 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:16,228 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-04 00:52:16,421 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-04 00:52:16,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1047956173, now seen corresponding path program 1 times [2025-03-04 00:52:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:16,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846906627] [2025-03-04 00:52:16,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:16,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:16,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:16,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 00:52:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846906627] [2025-03-04 00:52:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846906627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696142767] [2025-03-04 00:52:17,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:17,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:52:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:52:17,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:17,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:52:17,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 00:52:17,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:52:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 00:52:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696142767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:52:17,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:52:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-04 00:52:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743277860] [2025-03-04 00:52:17,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:52:17,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:52:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:17,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:52:17,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:52:17,407 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 00:52:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:18,002 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2025-03-04 00:52:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:52:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 96 [2025-03-04 00:52:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:18,005 INFO L225 Difference]: With dead ends: 190 [2025-03-04 00:52:18,005 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 00:52:18,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:52:18,008 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 121 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:18,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 286 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:52:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 00:52:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 54. [2025-03-04 00:52:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-03-04 00:52:18,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 96 [2025-03-04 00:52:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:18,032 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-04 00:52:18,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 00:52:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-03-04 00:52:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:18,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:18,035 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:18,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:52:18,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 00:52:18,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200788, now seen corresponding path program 1 times [2025-03-04 00:52:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150220171] [2025-03-04 00:52:18,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:18,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:18,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:18,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:18,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:52:18,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:18,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:18,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:18,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:18,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:52:18,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:52:18,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:52:18,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:52:18,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:52:18,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:52:18,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:52:18 BoogieIcfgContainer [2025-03-04 00:52:18,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:52:18,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:52:18,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:52:18,437 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:52:18,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:15" (3/4) ... [2025-03-04 00:52:18,439 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:52:18,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:52:18,440 INFO L158 Benchmark]: Toolchain (without parser) took 3294.12ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 50.4MB in the end (delta: 62.1MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-03-04 00:52:18,440 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:18,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:18,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:18,441 INFO L158 Benchmark]: Boogie Preprocessor took 38.09ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:18,441 INFO L158 Benchmark]: IcfgBuilder took 312.00ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:52:18,441 INFO L158 Benchmark]: TraceAbstraction took 2686.58ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 50.4MB in the end (delta: 28.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2025-03-04 00:52:18,442 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 50.4MB in the beginning and 50.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:18,443 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.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.09ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.00ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2686.58ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 50.4MB in the end (delta: 28.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 50.4MB in the beginning and 50.4MB in the end (delta: 24.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 someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_4 = 16; [L25] signed char var_1_5 = 4; [L26] signed char var_1_6 = 0; [L27] unsigned short int var_1_7 = 0; [L28] unsigned short int var_1_10 = 55182; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_14 = 1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 100; [L33] float var_1_17 = 2.25; [L34] float var_1_18 = 199.4; [L35] signed char var_1_19 = -128; VAL [isInitial=0, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L64] var_1_4 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L65] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L67] var_1_5 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L69] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L70] var_1_6 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L71] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L72] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L72] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L73] var_1_10 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L74] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L75] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L75] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L77] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L79] var_1_15 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L80] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L81] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L81] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L82] var_1_18 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L83] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L96] RET updateVariables() [L97] CALL step() [L39] COND FALSE !(! var_1_2) [L42] var_1_12 = ((! var_1_15) || (! (! 0))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L44] var_1_16 = var_1_5 [L45] var_1_17 = var_1_18 [L46] var_1_19 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L47] COND FALSE !(var_1_12 || (64.75f < var_1_17)) [L54] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=0] [L56] COND TRUE (((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17 [L57] var_1_7 = (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((var_1_12 || (64.75f < var_1_17)) ? (var_1_12 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_4))) && (((((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17) ? (var_1_7 == ((unsigned short int) (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))))) : 1)) && ((! var_1_2) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) ((! var_1_15) || (! (! 0))))))) && (var_1_16 == ((unsigned char) var_1_5))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((signed char) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=126, var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 135 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 96 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 769 SizeOfPredicates, 1 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2030/2100 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-04 00:52:18,464 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_variablewrapping_normal_file-24.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 a51318993ea13721f6dafa900810134bb32711cd41e6503c3f74581bbdabe004 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:20,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:20,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:52:20,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:20,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:20,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:20,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:20,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:20,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:20,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:20,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:20,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:20,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:20,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:20,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:20,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:20,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:20,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:20,333 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 -> a51318993ea13721f6dafa900810134bb32711cd41e6503c3f74581bbdabe004 [2025-03-04 00:52:20,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:20,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:20,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:20,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:20,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:20,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:21,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e576420/8c014a31258d4c00899842449bd0869a/FLAGfeeb2ef7e [2025-03-04 00:52:21,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:21,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:21,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e576420/8c014a31258d4c00899842449bd0869a/FLAGfeeb2ef7e [2025-03-04 00:52:22,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e576420/8c014a31258d4c00899842449bd0869a [2025-03-04 00:52:22,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:22,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:22,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:22,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:22,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:22,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b02d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22, skipping insertion in model container [2025-03-04 00:52:22,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:22,474 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_variablewrapping_normal_file-24.i[913,926] [2025-03-04 00:52:22,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:22,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:22,533 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_variablewrapping_normal_file-24.i[913,926] [2025-03-04 00:52:22,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:22,577 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:22,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22 WrapperNode [2025-03-04 00:52:22,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:22,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:22,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:22,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:22,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,618 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-04 00:52:22,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:22,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:22,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:22,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:22,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,646 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-04 00:52:22,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:22,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:22,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:22,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:22,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (1/1) ... [2025-03-04 00:52:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:22,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:22,699 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-04 00:52:22,702 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-04 00:52:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:52:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:22,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:22,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:22,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:22,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:35,621 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:35,621 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:35,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:35,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:35,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:35 BoogieIcfgContainer [2025-03-04 00:52:35,629 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:35,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:35,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:35,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:35,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:22" (1/3) ... [2025-03-04 00:52:35,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03aca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:35, skipping insertion in model container [2025-03-04 00:52:35,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:22" (2/3) ... [2025-03-04 00:52:35,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03aca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:35, skipping insertion in model container [2025-03-04 00:52:35,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:35" (3/3) ... [2025-03-04 00:52:35,636 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-24.i [2025-03-04 00:52:35,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:35,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-24.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:35,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:35,693 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;@2a507b28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:35,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:35,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:35,702 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:35,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 167597582, now seen corresponding path program 1 times [2025-03-04 00:52:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037592473] [2025-03-04 00:52:35,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:35,713 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-04 00:52:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:35,715 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-04 00:52:35,716 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-04 00:52:35,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:36,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:36,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:36,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:36,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-04 00:52:36,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:36,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037592473] [2025-03-04 00:52:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037592473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:52:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093106553] [2025-03-04 00:52:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:36,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:36,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:36,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:36,507 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:52:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:36,520 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2025-03-04 00:52:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:36,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-04 00:52:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:36,525 INFO L225 Difference]: With dead ends: 86 [2025-03-04 00:52:36,525 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 00:52:36,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-04 00:52:36,529 INFO L435 NwaCegarLoop]: 61 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, 61 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-04 00:52:36,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 00:52:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 00:52:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 00:52:36,570 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 96 [2025-03-04 00:52:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:36,571 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 00:52:36,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:52:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 00:52:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:36,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:36,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:36,592 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-04 00:52:36,774 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-04 00:52:36,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1047956173, now seen corresponding path program 1 times [2025-03-04 00:52:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556433736] [2025-03-04 00:52:36,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:36,775 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-04 00:52:36,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:36,777 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-04 00:52:36,778 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-04 00:52:36,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:37,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:37,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:37,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:37,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:52:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 00:52:39,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:52:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 00:52:41,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556433736] [2025-03-04 00:52:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556433736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:52:41,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:52:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-03-04 00:52:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436378502] [2025-03-04 00:52:41,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:52:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:52:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:41,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:52:41,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:52:41,431 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 00:52:47,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:52:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:52,216 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2025-03-04 00:52:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:52:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 96 [2025-03-04 00:52:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:52,220 INFO L225 Difference]: With dead ends: 190 [2025-03-04 00:52:52,220 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 00:52:52,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:52:52,222 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 94 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 256 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-03-04 00:52:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 00:52:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 54. [2025-03-04 00:52:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:52:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-03-04 00:52:52,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 96 [2025-03-04 00:52:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-03-04 00:52:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-04 00:52:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-03-04 00:52:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:52:52,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:52,244 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:52:52,268 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-04 00:52:52,444 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-04 00:52:52,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200788, now seen corresponding path program 1 times [2025-03-04 00:52:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155477147] [2025-03-04 00:52:52,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:52,446 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-04 00:52:52,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:52,448 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-04 00:52:52,449 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-04 00:52:52,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:52:53,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:52:53,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:53,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:53,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 00:52:53,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:53:05,234 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:18,165 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:23,579 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 11 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:31,955 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:40,323 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:48,705 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:57,062 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)