./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:20:52,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:20:52,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:20:52,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:20:52,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:20:52,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:20:52,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:20:52,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:20:52,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:20:52,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:20:52,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:20:52,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:20:52,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:20:52,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:20:52,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:20:52,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:20:52,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:20:52,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:20:52,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:20:52,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:20:52,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:20:52,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:20:52,711 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2025-03-16 23:20:52,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:20:52,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:20:52,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:20:52,934 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:20:52,934 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:20:52,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2025-03-16 23:20:54,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9452152/024f619386554669b484a96668f42399/FLAG27d9045e3 [2025-03-16 23:20:54,280 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:20:54,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2025-03-16 23:20:54,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9452152/024f619386554669b484a96668f42399/FLAG27d9045e3 [2025-03-16 23:20:54,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9452152/024f619386554669b484a96668f42399 [2025-03-16 23:20:54,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:20:54,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:20:54,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:20:54,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:20:54,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:20:54,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e95209d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54, skipping insertion in model container [2025-03-16 23:20:54,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:20:54,748 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_codestructure_steplocals_file-48.i[917,930] [2025-03-16 23:20:54,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:20:54,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:20:54,830 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_codestructure_steplocals_file-48.i[917,930] [2025-03-16 23:20:54,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:20:54,880 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:20:54,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54 WrapperNode [2025-03-16 23:20:54,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:20:54,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:20:54,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:20:54,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:20:54,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,926 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2025-03-16 23:20:54,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:20:54,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:20:54,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:20:54,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:20:54,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,958 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-16 23:20:54,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:20:54,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:20:54,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:20:54,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:20:54,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (1/1) ... [2025-03-16 23:20:54,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:20:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:20:55,000 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-16 23:20:55,003 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-16 23:20:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:20:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:20:55,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:20:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:20:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:20:55,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:20:55,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:20:55,081 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:20:55,303 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:20:55,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:20:55,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:20:55,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:20:55,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:20:55 BoogieIcfgContainer [2025-03-16 23:20:55,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:20:55,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:20:55,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:20:55,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:20:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:20:54" (1/3) ... [2025-03-16 23:20:55,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af5d73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:20:55, skipping insertion in model container [2025-03-16 23:20:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:20:54" (2/3) ... [2025-03-16 23:20:55,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af5d73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:20:55, skipping insertion in model container [2025-03-16 23:20:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:20:55" (3/3) ... [2025-03-16 23:20:55,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2025-03-16 23:20:55,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:20:55,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-48.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:20:55,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:20:55,375 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;@292c918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:20:55,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:20:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:20:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:20:55,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:20:55,385 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:20:55,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:20:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:20:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1632931380, now seen corresponding path program 1 times [2025-03-16 23:20:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:20:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483944619] [2025-03-16 23:20:55,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:20:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:20:55,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:55,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:55,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:20:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:20:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:20:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483944619] [2025-03-16 23:20:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483944619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:20:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463550572] [2025-03-16 23:20:55,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:20:55,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:20:55,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:20:55,634 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-16 23:20:55,636 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-16 23:20:55,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:55,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:55,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:55,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:20:55,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:20:55,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:20:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:20:55,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:20:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463550572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:20:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:20:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:20:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680254515] [2025-03-16 23:20:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:20:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:20:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:20:55,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:20:55,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:20:55,832 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:20:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:20:55,853 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2025-03-16 23:20:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:20:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2025-03-16 23:20:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:20:55,863 INFO L225 Difference]: With dead ends: 120 [2025-03-16 23:20:55,863 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 23:20:55,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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-16 23:20:55,868 INFO L435 NwaCegarLoop]: 90 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, 90 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-16 23:20:55,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:20:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 23:20:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-16 23:20:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:20:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2025-03-16 23:20:55,900 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 136 [2025-03-16 23:20:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:20:55,900 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2025-03-16 23:20:55,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:20:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2025-03-16 23:20:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:20:55,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:20:55,905 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:20:55,912 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-16 23:20:56,110 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-16 23:20:56,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:20:56,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:20:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 297673456, now seen corresponding path program 1 times [2025-03-16 23:20:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:20:56,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484713197] [2025-03-16 23:20:56,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:20:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:20:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:56,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:20:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:20:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:20:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484713197] [2025-03-16 23:20:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484713197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:20:56,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:20:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:20:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448318184] [2025-03-16 23:20:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:20:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:20:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:20:56,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:20:56,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:20:56,295 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:20:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:20:56,342 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2025-03-16 23:20:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:20:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 23:20:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:20:56,347 INFO L225 Difference]: With dead ends: 133 [2025-03-16 23:20:56,347 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:20:56,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:20:56,351 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:20:56,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:20:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:20:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2025-03-16 23:20:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:20:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2025-03-16 23:20:56,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 136 [2025-03-16 23:20:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:20:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2025-03-16 23:20:56,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:20:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2025-03-16 23:20:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:20:56,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:20:56,368 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:20:56,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:20:56,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:20:56,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:20:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1185177137, now seen corresponding path program 1 times [2025-03-16 23:20:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:20:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109643085] [2025-03-16 23:20:56,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:20:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:20:56,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:56,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:56,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:56,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:20:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:20:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:20:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109643085] [2025-03-16 23:20:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109643085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:20:56,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:20:56,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 23:20:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480079300] [2025-03-16 23:20:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:20:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 23:20:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:20:56,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 23:20:56,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:20:56,909 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 23:20:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:20:57,121 INFO L93 Difference]: Finished difference Result 190 states and 289 transitions. [2025-03-16 23:20:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:20:57,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 136 [2025-03-16 23:20:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:20:57,125 INFO L225 Difference]: With dead ends: 190 [2025-03-16 23:20:57,125 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 23:20:57,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:20:57,126 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 68 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:20:57,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 351 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:20:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 23:20:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-16 23:20:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:20:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-03-16 23:20:57,152 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 136 [2025-03-16 23:20:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:20:57,154 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-03-16 23:20:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 23:20:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-03-16 23:20:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:20:57,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:20:57,156 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:20:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:20:57,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:20:57,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:20:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1186100658, now seen corresponding path program 1 times [2025-03-16 23:20:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:20:57,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107493157] [2025-03-16 23:20:57,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:20:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:20:57,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:57,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:57,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:20:57,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:20:57,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:20:57,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:20:57,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:20:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:20:57,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:20:57,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:20:57,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:20:57,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:20:57,356 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 23:20:57,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:20:57,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:20:57 BoogieIcfgContainer [2025-03-16 23:20:57,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:20:57,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:20:57,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:20:57,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:20:57,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:20:55" (3/4) ... [2025-03-16 23:20:57,421 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:20:57,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:20:57,422 INFO L158 Benchmark]: Toolchain (without parser) took 2794.64ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 41.5MB in the end (delta: 64.6MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2025-03-16 23:20:57,422 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.88ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: Boogie Preprocessor took 46.13ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: IcfgBuilder took 337.28ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 63.9MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: TraceAbstraction took 2104.93ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 41.5MB in the end (delta: 21.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-03-16 23:20:57,423 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:20:57,424 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.88ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.13ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 337.28ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 63.9MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2104.93ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 41.5MB in the end (delta: 21.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 41.5MB in the beginning and 41.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] signed long int var_1_19 = 128; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] var_1_3 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] var_1_4 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] var_1_5 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] var_1_6 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] var_1_7 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L112] var_1_9 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L113] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L121] var_1_15 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L124] var_1_16 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L127] var_1_17 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L130] var_1_19 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L131] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L145] RET updateVariables() [L146] CALL step() [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = 1 VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L53] unsigned short int stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L54] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L55] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L63] COND FALSE !(\read(var_1_2)) [L72] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L74] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L77] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)); VAL [isInitial=1, stepLocal_0=-65536, stepLocal_1=256, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L78] COND FALSE !(var_1_10 == stepLocal_1) [L81] var_1_14 = var_1_17 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L83] COND TRUE var_1_7 == var_1_12 [L84] var_1_18 = (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (var_1_1 + var_1_10)))) : (var_1_12 == ((signed long int) var_1_1))) : 1) : (var_1_12 == ((signed long int) var_1_8)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_7 == var_1_12) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))))) : ((var_1_14 != var_1_16) ? ((-256 >= var_1_19) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=254, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 119 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 265 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3654/3696 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-16 23:20:57,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:20:59,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:20:59,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:20:59,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:20:59,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:20:59,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:20:59,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:20:59,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:20:59,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:20:59,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:20:59,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:20:59,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:20:59,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:20:59,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:20:59,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:20:59,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:20:59,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:20:59,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:20:59,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:20:59,323 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2025-03-16 23:20:59,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:20:59,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:20:59,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:20:59,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:20:59,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:20:59,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2025-03-16 23:21:00,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb1551d/2e68fd0371564884be30c1812eb237d9/FLAG0ea43575d [2025-03-16 23:21:01,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:21:01,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2025-03-16 23:21:01,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb1551d/2e68fd0371564884be30c1812eb237d9/FLAG0ea43575d [2025-03-16 23:21:01,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb1551d/2e68fd0371564884be30c1812eb237d9 [2025-03-16 23:21:01,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:21:01,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:21:01,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:01,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:21:01,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:21:01,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9ff29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01, skipping insertion in model container [2025-03-16 23:21:01,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:21:01,718 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_codestructure_steplocals_file-48.i[917,930] [2025-03-16 23:21:01,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:01,780 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:21:01,789 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_codestructure_steplocals_file-48.i[917,930] [2025-03-16 23:21:01,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:01,838 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:21:01,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01 WrapperNode [2025-03-16 23:21:01,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:01,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:01,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:21:01,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:21:01,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,879 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-16 23:21:01,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:01,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:21:01,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:21:01,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:21:01,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,906 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-16 23:21:01,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:21:01,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:21:01,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:21:01,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:21:01,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (1/1) ... [2025-03-16 23:21:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:01,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:01,964 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-16 23:21:01,968 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-16 23:21:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:21:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:21:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:21:01,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:21:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:21:01,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:21:02,040 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:21:02,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:21:26,180 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:21:26,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:21:26,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:21:26,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:21:26,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:26 BoogieIcfgContainer [2025-03-16 23:21:26,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:21:26,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:21:26,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:21:26,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:21:26,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:21:01" (1/3) ... [2025-03-16 23:21:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad18cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:26, skipping insertion in model container [2025-03-16 23:21:26,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:01" (2/3) ... [2025-03-16 23:21:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad18cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:26, skipping insertion in model container [2025-03-16 23:21:26,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:26" (3/3) ... [2025-03-16 23:21:26,198 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2025-03-16 23:21:26,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:21:26,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-48.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:21:26,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:21:26,256 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;@5db7eb01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:21:26,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:21:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:21:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:21:26,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:26,266 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:26,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:26,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1632931380, now seen corresponding path program 1 times [2025-03-16 23:21:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241617705] [2025-03-16 23:21:26,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:26,278 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-16 23:21:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:26,280 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-16 23:21:26,281 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-16 23:21:26,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:21:27,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:21:27,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:27,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:27,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:21:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 23:21:27,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:27,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:21:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241617705] [2025-03-16 23:21:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241617705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:27,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:21:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259982571] [2025-03-16 23:21:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:27,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:21:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:21:27,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:21:27,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:27,754 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:21:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:27,769 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2025-03-16 23:21:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:21:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2025-03-16 23:21:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:27,775 INFO L225 Difference]: With dead ends: 120 [2025-03-16 23:21:27,775 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 23:21:27,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-16 23:21:27,780 INFO L435 NwaCegarLoop]: 90 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, 90 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-16 23:21:27,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 23:21:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-16 23:21:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:21:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2025-03-16 23:21:27,813 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 136 [2025-03-16 23:21:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:27,813 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2025-03-16 23:21:27,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:21:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2025-03-16 23:21:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:21:27,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:27,819 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:27,853 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-16 23:21:28,020 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-16 23:21:28,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:28,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 297673456, now seen corresponding path program 1 times [2025-03-16 23:21:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:28,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074352099] [2025-03-16 23:21:28,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:28,022 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-16 23:21:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:28,024 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-16 23:21:28,025 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-16 23:21:28,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:21:29,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:21:29,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:29,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:29,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:21:29,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:21:29,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:29,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:21:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074352099] [2025-03-16 23:21:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074352099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:29,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:29,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:21:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615388491] [2025-03-16 23:21:29,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:29,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:21:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:21:29,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:21:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:29,535 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:21:34,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:21:38,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:21:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:38,299 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2025-03-16 23:21:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:21:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 23:21:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:38,301 INFO L225 Difference]: With dead ends: 133 [2025-03-16 23:21:38,301 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:21:38,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:38,303 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:38,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-03-16 23:21:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:21:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2025-03-16 23:21:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:21:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2025-03-16 23:21:38,310 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 136 [2025-03-16 23:21:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2025-03-16 23:21:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:21:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2025-03-16 23:21:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:21:38,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:38,316 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:38,351 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-16 23:21:38,516 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-16 23:21:38,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1185177137, now seen corresponding path program 1 times [2025-03-16 23:21:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:21:38,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628323075] [2025-03-16 23:21:38,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:38,517 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-16 23:21:38,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:21:38,520 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-16 23:21:38,521 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-16 23:21:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:21:39,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:21:39,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:39,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:39,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:21:39,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:21:44,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:44,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:21:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628323075] [2025-03-16 23:21:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628323075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:21:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030584410] [2025-03-16 23:21:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:21:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:21:44,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:21:44,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:21:44,920 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:21:49,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:21:53,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:21:57,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:22:01,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:22:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:01,604 INFO L93 Difference]: Finished difference Result 190 states and 289 transitions. [2025-03-16 23:22:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:22:01,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 23:22:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:01,766 INFO L225 Difference]: With dead ends: 190 [2025-03-16 23:22:01,766 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 23:22:01,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:22:01,767 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 21 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:01,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 259 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-03-16 23:22:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 23:22:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-16 23:22:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:22:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-03-16 23:22:01,785 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 136 [2025-03-16 23:22:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:01,786 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-03-16 23:22:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:22:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-03-16 23:22:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 23:22:01,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:01,788 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:22:01,823 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 (4)] Ended with exit code 0 [2025-03-16 23:22:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:22:01,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1186100658, now seen corresponding path program 1 times [2025-03-16 23:22:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:22:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926177922] [2025-03-16 23:22:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:01,990 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-16 23:22:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:22:01,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:22:01,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 23:22:02,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 23:22:03,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 23:22:03,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:03,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 23:22:03,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:22:12,000 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:22:20,158 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:22:28,673 WARN L286 SmtUtils]: Spent 8.51s 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-16 23:22:34,307 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)