./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.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_fillercode_fillercodesize_normal_file-71.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 06310ed96ff90cd41f7e06cc140b3ae37ff2aa2ee60815f1e01ceec8c6bb9e8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:35:41,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:35:41,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:35:41,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:35:41,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:35:41,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:35:41,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:35:41,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:35:41,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:35:41,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:35:41,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:35:41,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:35:41,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:35:41,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:35:41,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:35:41,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:35:41,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:35:41,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:35:41,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:35:41,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:35:41,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:35:41,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06310ed96ff90cd41f7e06cc140b3ae37ff2aa2ee60815f1e01ceec8c6bb9e8b [2025-03-16 23:35:41,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:35:41,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:35:41,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:35:41,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:35:41,563 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:35:41,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:35:42,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80e4f461/129685350ab64875bddd9f9e3f34f1d2/FLAGf2a87e1d6 [2025-03-16 23:35:42,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:35:42,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:35:42,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80e4f461/129685350ab64875bddd9f9e3f34f1d2/FLAGf2a87e1d6 [2025-03-16 23:35:42,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80e4f461/129685350ab64875bddd9f9e3f34f1d2 [2025-03-16 23:35:42,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:35:42,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:35:42,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:35:42,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:35:42,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:35:42,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:35:42" (1/1) ... [2025-03-16 23:35:42,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ecc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:42, skipping insertion in model container [2025-03-16 23:35:42,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:35:42" (1/1) ... [2025-03-16 23:35:43,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:35:43,115 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_fillercode_fillercodesize_normal_file-71.i[913,926] [2025-03-16 23:35:43,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:35:43,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:35:43,176 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_fillercode_fillercodesize_normal_file-71.i[913,926] [2025-03-16 23:35:43,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:35:43,216 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:35:43,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43 WrapperNode [2025-03-16 23:35:43,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:35:43,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:35:43,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:35:43,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:35:43,223 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:35:43" (1/1) ... [2025-03-16 23:35:43,233 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:35:43" (1/1) ... [2025-03-16 23:35:43,259 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-16 23:35:43,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:35:43,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:35:43,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:35:43,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:35:43,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,295 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:35:43,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:35:43,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:35:43,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:35:43,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:35:43,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (1/1) ... [2025-03-16 23:35:43,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:35:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:43,336 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:35:43,341 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:35:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:35:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:35:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:35:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:35:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:35:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:35:43,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:35:43,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:35:43,638 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:35:43,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:35:43,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:35:43,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:35:43,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:35:43 BoogieIcfgContainer [2025-03-16 23:35:43,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:35:43,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:35:43,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:35:43,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:35:43,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:35:42" (1/3) ... [2025-03-16 23:35:43,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25965fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:35:43, skipping insertion in model container [2025-03-16 23:35:43,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:43" (2/3) ... [2025-03-16 23:35:43,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25965fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:35:43, skipping insertion in model container [2025-03-16 23:35:43,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:35:43" (3/3) ... [2025-03-16 23:35:43,652 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:35:43,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:35:43,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-71.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:35:43,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:35:43,719 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;@2325d516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:35:43,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:35:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:35:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:35:43,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:43,732 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:43,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1514004129, now seen corresponding path program 1 times [2025-03-16 23:35:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:43,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138261724] [2025-03-16 23:35:43,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:43,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:43,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:43,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:35:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138261724] [2025-03-16 23:35:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138261724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:35:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470253334] [2025-03-16 23:35:43,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:43,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:35:43,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:43,998 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:35:43,999 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:35:44,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:44,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:44,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:44,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:44,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:35:44,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:35:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:35:44,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:35:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470253334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:35:44,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:35:44,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:35:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360062175] [2025-03-16 23:35:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:35:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:35:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:44,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:35:44,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:35:44,200 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:35:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:44,217 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2025-03-16 23:35:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:35:44,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-03-16 23:35:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:44,223 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:35:44,223 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:35:44,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:35:44,228 INFO L435 NwaCegarLoop]: 82 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, 82 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:35:44,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:35:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:35:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:35:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:35:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2025-03-16 23:35:44,261 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 129 [2025-03-16 23:35:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2025-03-16 23:35:44,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:35:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2025-03-16 23:35:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:35:44,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:44,264 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:35:44,465 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:35:44,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1443543554, now seen corresponding path program 1 times [2025-03-16 23:35:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40993387] [2025-03-16 23:35:44,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:44,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:44,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:44,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:44,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:35:44,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066584160] [2025-03-16 23:35:44,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:35:44,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:44,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:35:44,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:35:44,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:45,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:45,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:45,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:35:45,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 23:35:45,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:35:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 42 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-16 23:35:45,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:35:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:35:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40993387] [2025-03-16 23:35:46,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:35:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066584160] [2025-03-16 23:35:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066584160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:35:46,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:35:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-16 23:35:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906136799] [2025-03-16 23:35:46,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 23:35:46,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:35:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:35:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:35:46,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:35:46,113 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 23:35:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:35:46,469 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2025-03-16 23:35:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:35:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2025-03-16 23:35:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:35:46,471 INFO L225 Difference]: With dead ends: 176 [2025-03-16 23:35:46,471 INFO L226 Difference]: Without dead ends: 123 [2025-03-16 23:35:46,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-16 23:35:46,473 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:35:46,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 273 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:35:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-16 23:35:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2025-03-16 23:35:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 23:35:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2025-03-16 23:35:46,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 129 [2025-03-16 23:35:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:35:46,490 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2025-03-16 23:35:46,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 23:35:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2025-03-16 23:35:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:35:46,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:35:46,491 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:35:46,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-16 23:35:46,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:35:46,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:35:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1640057059, now seen corresponding path program 1 times [2025-03-16 23:35:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:35:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85584687] [2025-03-16 23:35:46,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:35:46,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:46,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:46,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:46,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:35:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331358572] [2025-03-16 23:35:46,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:35:46,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:35:46,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:46,820 INFO L229 MonitoredProcess]: Starting monitored process 4 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:35:46,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:35:46,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:46,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:46,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:35:46,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:35:46,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:35:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:35:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:35:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:35:46,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:35:46,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:35:46,993 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:35:47,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:35:47,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:35:47,197 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:35:47,279 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:35:47,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:35:47 BoogieIcfgContainer [2025-03-16 23:35:47,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:35:47,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:35:47,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:35:47,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:35:47,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:35:43" (3/4) ... [2025-03-16 23:35:47,284 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:35:47,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:35:47,286 INFO L158 Benchmark]: Toolchain (without parser) took 4294.64ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 40.6MB in the end (delta: 63.5MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,286 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:35:47,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.64ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.10ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:35:47,288 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,288 INFO L158 Benchmark]: IcfgBuilder took 342.40ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 63.6MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,289 INFO L158 Benchmark]: TraceAbstraction took 3633.73ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 40.6MB in the end (delta: 23.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,289 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 142.6MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 41.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:35:47,290 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.64ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.10ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 342.40ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 63.6MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3633.73ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 40.6MB in the end (delta: 23.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 142.6MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 41.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -1; [L26] signed char var_1_5 = 4; [L27] unsigned short int var_1_9 = 35831; [L28] float var_1_10 = 1.875; [L29] float var_1_11 = 5.8; [L30] float var_1_12 = 2.375; [L31] float var_1_13 = 999999999999.75; [L32] signed short int var_1_14 = 32; [L33] signed short int var_1_15 = 25; [L34] signed short int var_1_16 = 23809; [L35] signed short int var_1_17 = 2; [L36] float var_1_18 = 499.25; [L37] signed long int var_1_19 = -4; [L38] unsigned short int var_1_20 = 10; [L39] unsigned short int var_1_21 = 16; [L40] signed char var_1_22 = -10; [L41] signed char var_1_23 = 25; [L42] float last_1_var_1_12 = 2.375; [L43] signed short int last_1_var_1_14 = 32; [L44] unsigned short int last_1_var_1_20 = 10; [L45] unsigned short int last_1_var_1_21 = 16; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_14 = var_1_14 [L127] last_1_var_1_20 = var_1_20 [L128] last_1_var_1_21 = var_1_21 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L94] var_1_3 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L95] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L97] var_1_4 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L98] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L99] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L99] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L100] var_1_5 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L101] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L102] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L102] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L104] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L105] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L105] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L106] var_1_11 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L107] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L108] var_1_13 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L109] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L111] var_1_15 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L114] var_1_16 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L115] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L117] var_1_17 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L118] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L120] var_1_23 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L121] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L122] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L122] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L139] RET updateVariables() [L140] CALL step() [L49] signed long int stepLocal_0 = var_1_4 - var_1_5; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_0=-1, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L50] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_0=-1, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L51] COND FALSE !(stepLocal_0 > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L61] unsigned short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_2=32, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L62] COND FALSE !(! (var_1_5 < var_1_1)) [L69] var_1_14 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_2=32, var_1_10=15/8, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L71] var_1_10 = var_1_11 [L72] signed char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L73] COND FALSE !(last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L80] var_1_18 = ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f))) [L81] var_1_20 = var_1_15 [L82] var_1_21 = var_1_5 [L83] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=-4, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L84] COND TRUE \read(var_1_3) [L85] var_1_19 = ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((((var_1_2 ? (((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) ? (var_1_1 == ((unsigned short int) (var_1_9 - var_1_5))) : 1) : (var_1_3 ? (var_1_1 == ((unsigned short int) 32)) : (var_1_1 == ((unsigned short int) var_1_5)))) && (var_1_10 == ((float) var_1_11))) && ((last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) ? ((var_1_14 > var_1_4) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_11))) : 1)) && ((! (var_1_5 < var_1_1)) ? ((last_1_var_1_14 >= var_1_1) ? (var_1_14 == ((signed short int) (((((128) < (((((2) < (var_1_4)) ? (2) : (var_1_4))))) ? (128) : (((((2) < (var_1_4)) ? (2) : (var_1_4)))))) + var_1_5))) : (var_1_14 == ((signed short int) ((var_1_5 - var_1_15) + var_1_4)))) : (var_1_14 == ((signed short int) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && (var_1_18 == ((float) ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f)))))) && (var_1_3 ? (var_1_19 == ((signed long int) ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))))) : (var_1_19 == ((signed long int) var_1_5)))) && (var_1_20 == ((unsigned short int) var_1_15))) && (var_1_21 == ((unsigned short int) var_1_5))) && (var_1_22 == ((signed char) var_1_23)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 107 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 133 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 1631 SizeOfPredicates, 7 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2438/2520 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:35:47,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.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 06310ed96ff90cd41f7e06cc140b3ae37ff2aa2ee60815f1e01ceec8c6bb9e8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:35:49,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:35:49,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:35:49,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:35:49,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:35:49,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:35:49,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:35:49,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:35:49,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:35:49,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:35:49,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:35:49,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:35:49,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:35:49,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:35:49,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:35:49,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:35:49,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:35:49,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:35:49,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:35:49,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:35:49,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:35:49,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:35:49,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:35:49,231 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 -> 06310ed96ff90cd41f7e06cc140b3ae37ff2aa2ee60815f1e01ceec8c6bb9e8b [2025-03-16 23:35:49,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:35:49,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:35:49,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:35:49,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:35:49,444 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:35:49,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:35:50,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4e6eff8/9fd8b941413240548b61eb01c6764ece/FLAG92ce6164c [2025-03-16 23:35:50,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:35:50,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:35:50,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4e6eff8/9fd8b941413240548b61eb01c6764ece/FLAG92ce6164c [2025-03-16 23:35:50,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4e6eff8/9fd8b941413240548b61eb01c6764ece [2025-03-16 23:35:50,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:35:50,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:35:50,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:35:50,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:35:50,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:35:50,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:35:50" (1/1) ... [2025-03-16 23:35:50,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca58d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:50, skipping insertion in model container [2025-03-16 23:35:50,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:35:50" (1/1) ... [2025-03-16 23:35:50,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:35:50,949 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_fillercode_fillercodesize_normal_file-71.i[913,926] [2025-03-16 23:35:51,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:35:51,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:35:51,039 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_fillercode_fillercodesize_normal_file-71.i[913,926] [2025-03-16 23:35:51,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:35:51,088 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:35:51,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51 WrapperNode [2025-03-16 23:35:51,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:35:51,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:35:51,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:35:51,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:35:51,094 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:35:51" (1/1) ... [2025-03-16 23:35:51,104 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:35:51" (1/1) ... [2025-03-16 23:35:51,131 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-16 23:35:51,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:35:51,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:35:51,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:35:51,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:35:51,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,169 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:35:51,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:35:51,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:35:51,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:35:51,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:35:51,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (1/1) ... [2025-03-16 23:35:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:35:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:35:51,223 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:35:51,229 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:35:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:35:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:35:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:35:51,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:35:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:35:51,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:35:51,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:35:51,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:36:01,684 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:36:01,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:36:01,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:36:01,693 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:36:01,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:36:01 BoogieIcfgContainer [2025-03-16 23:36:01,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:36:01,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:36:01,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:36:01,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:36:01,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:35:50" (1/3) ... [2025-03-16 23:36:01,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3f7076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:36:01, skipping insertion in model container [2025-03-16 23:36:01,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:35:51" (2/3) ... [2025-03-16 23:36:01,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3f7076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:36:01, skipping insertion in model container [2025-03-16 23:36:01,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:36:01" (3/3) ... [2025-03-16 23:36:01,699 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-71.i [2025-03-16 23:36:01,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:36:01,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-71.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:36:01,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:36:01,761 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;@15680903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:36:01,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:36:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:36:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:36:01,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:36:01,775 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:36:01,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:36:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1514004129, now seen corresponding path program 1 times [2025-03-16 23:36:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:36:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740470174] [2025-03-16 23:36:01,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:36:01,789 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:36:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:36:01,791 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:36:01,799 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:36:01,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:36:02,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:36:02,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:36:02,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:36:02,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:36:02,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:36:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-16 23:36:02,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:36:02,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:36:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740470174] [2025-03-16 23:36:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740470174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:36:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:36:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:36:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874369101] [2025-03-16 23:36:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:36:02,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:36:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:36:02,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:36:02,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:36:02,221 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:36:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:36:02,236 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2025-03-16 23:36:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:36:02,238 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-03-16 23:36:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:36:02,242 INFO L225 Difference]: With dead ends: 109 [2025-03-16 23:36:02,242 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 23:36:02,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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:36:02,247 INFO L435 NwaCegarLoop]: 82 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, 82 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:36:02,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:36:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 23:36:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-16 23:36:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:36:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2025-03-16 23:36:02,283 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 129 [2025-03-16 23:36:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:36:02,283 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2025-03-16 23:36:02,283 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:36:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2025-03-16 23:36:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:36:02,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:36:02,289 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:02,300 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:36:02,490 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:36:02,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:36:02,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:36:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1443543554, now seen corresponding path program 1 times [2025-03-16 23:36:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:36:02,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367141540] [2025-03-16 23:36:02,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:36:02,494 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:36:02,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:36:02,496 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:36:02,499 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:36:02,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:36:02,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:36:02,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:36:02,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:36:02,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 23:36:02,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:36:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:36:07,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:36:07,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:36:07,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367141540] [2025-03-16 23:36:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367141540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:36:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:36:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:36:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059009357] [2025-03-16 23:36:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:36:07,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:36:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:36:07,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:36:07,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:36:07,478 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:36:11,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:36:13,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:36:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:36:13,488 INFO L93 Difference]: Finished difference Result 170 states and 259 transitions. [2025-03-16 23:36:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:36:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2025-03-16 23:36:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:36:13,521 INFO L225 Difference]: With dead ends: 170 [2025-03-16 23:36:13,521 INFO L226 Difference]: Without dead ends: 117 [2025-03-16 23:36:13,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:36:13,522 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:36:13,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 267 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-16 23:36:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-16 23:36:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2025-03-16 23:36:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 23:36:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2025-03-16 23:36:13,539 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 129 [2025-03-16 23:36:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:36:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2025-03-16 23:36:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:36:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2025-03-16 23:36:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:36:13,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:36:13,541 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,552 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:36:13,741 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:36:13,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:36:13,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:36:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1640057059, now seen corresponding path program 1 times [2025-03-16 23:36:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:36:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179353450] [2025-03-16 23:36:13,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:36:13,744 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:36:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:36:13,746 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:36:13,747 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:36:13,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:36:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:36:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:36:14,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:36:14,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 23:36:14,160 INFO L279 TraceCheckSpWp]: Computing forward predicates...