./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.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 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:33:11,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:33:11,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:33:11,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:33:11,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:33:11,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:33:11,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:33:11,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:33:11,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:33:11,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:33:11,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:33:11,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:33:11,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:33:11,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:33:11,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:33:11,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:33:11,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:33:11,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:33:11,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:33:11,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:33:11,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:33:11,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:33:11,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:11,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:33:11,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:33:11,152 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 -> 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 [2025-03-03 19:33:11,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:33:11,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:33:11,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:33:11,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:33:11,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:33:11,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:12,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e72a711/8618adb2e0594b61ae3645a6ec24fdee/FLAGae51156fa [2025-03-03 19:33:12,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:33:12,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:12,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e72a711/8618adb2e0594b61ae3645a6ec24fdee/FLAGae51156fa [2025-03-03 19:33:13,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e72a711/8618adb2e0594b61ae3645a6ec24fdee [2025-03-03 19:33:13,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:33:13,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:33:13,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:13,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:33:13,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:33:13,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f6906a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13, skipping insertion in model container [2025-03-03 19:33:13,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:33:13,135 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_ps-cn-10_file-2.i[914,927] [2025-03-03 19:33:13,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:13,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:33:13,180 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_ps-cn-10_file-2.i[914,927] [2025-03-03 19:33:13,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:13,208 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:33:13,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13 WrapperNode [2025-03-03 19:33:13,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:13,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:13,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:33:13,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:33:13,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,238 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-03-03 19:33:13,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:13,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:33:13,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:33:13,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:33:13,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,261 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-03 19:33:13,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:33:13,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:33:13,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:33:13,280 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:33:13,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (1/1) ... [2025-03-03 19:33:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:13,305 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-03 19:33:13,307 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-03 19:33:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:33:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:33:13,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:33:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:33:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:33:13,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:33:13,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:33:13,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:33:13,614 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 19:33:13,616 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:33:13,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:33:13,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:33:13,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:13 BoogieIcfgContainer [2025-03-03 19:33:13,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:33:13,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:33:13,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:33:13,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:33:13,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:33:13" (1/3) ... [2025-03-03 19:33:13,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ded74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:13, skipping insertion in model container [2025-03-03 19:33:13,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:13" (2/3) ... [2025-03-03 19:33:13,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ded74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:13, skipping insertion in model container [2025-03-03 19:33:13,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:13" (3/3) ... [2025-03-03 19:33:13,640 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:13,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:33:13,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:33:13,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:33:13,699 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;@66506bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:33:13,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:33:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:33:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 19:33:13,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:13,712 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:13,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:13,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1878871396, now seen corresponding path program 1 times [2025-03-03 19:33:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005251196] [2025-03-03 19:33:13,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:13,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 19:33:13,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 19:33:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:13,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 19:33:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005251196] [2025-03-03 19:33:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005251196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:33:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082890857] [2025-03-03 19:33:13,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:33:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:13,901 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-03 19:33:13,903 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-03 19:33:13,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 19:33:14,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 19:33:14,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:14,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:33:14,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 19:33:14,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:33:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082890857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:33:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:33:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442160619] [2025-03-03 19:33:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:33:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:33:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:14,106 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:33:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:14,122 INFO L93 Difference]: Finished difference Result 128 states and 215 transitions. [2025-03-03 19:33:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:33:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-03-03 19:33:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:14,128 INFO L225 Difference]: With dead ends: 128 [2025-03-03 19:33:14,128 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 19:33:14,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-03 19:33:14,132 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:14,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:33:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 19:33:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 19:33:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:33:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-03 19:33:14,162 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 133 [2025-03-03 19:33:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:14,162 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-03 19:33:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:33:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-03 19:33:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 19:33:14,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:14,167 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:14,174 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-03 19:33:14,367 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-03 19:33:14,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1987244930, now seen corresponding path program 1 times [2025-03-03 19:33:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266221669] [2025-03-03 19:33:14,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:14,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 19:33:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 19:33:14,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:14,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:33:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088446956] [2025-03-03 19:33:14,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:14,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:33:14,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:14,531 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-03 19:33:14,532 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-03 19:33:14,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 19:33:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 19:33:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:14,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:33:14,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 406 proven. 30 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-03 19:33:15,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:33:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:33:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266221669] [2025-03-03 19:33:15,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:33:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088446956] [2025-03-03 19:33:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088446956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:33:15,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:33:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 19:33:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911192179] [2025-03-03 19:33:15,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:33:15,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:33:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:15,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:33:15,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:33:15,725 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 19:33:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:16,077 INFO L93 Difference]: Finished difference Result 153 states and 218 transitions. [2025-03-03 19:33:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:33:16,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) Word has length 134 [2025-03-03 19:33:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:16,080 INFO L225 Difference]: With dead ends: 153 [2025-03-03 19:33:16,080 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 19:33:16,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:33:16,081 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:16,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 228 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:33:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 19:33:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-03-03 19:33:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:33:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2025-03-03 19:33:16,093 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 134 [2025-03-03 19:33:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:16,094 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2025-03-03 19:33:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-03 19:33:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2025-03-03 19:33:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 19:33:16,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:16,096 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:16,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:33:16,296 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-03 19:33:16,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2147326144, now seen corresponding path program 1 times [2025-03-03 19:33:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525121569] [2025-03-03 19:33:16,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:16,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 19:33:16,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 19:33:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:33:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947788573] [2025-03-03 19:33:16,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:16,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:33:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:16,388 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-03 19:33:16,389 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-03 19:33:16,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 19:33:16,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 19:33:16,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:16,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:33:16,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:33:16,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 19:33:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 19:33:16,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:33:16,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:33:16,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:33:16,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:33:16,559 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-03 19:33:16,752 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-03 19:33:16,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 19:33:16,827 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:33:16,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:33:16 BoogieIcfgContainer [2025-03-03 19:33:16,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:33:16,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:33:16,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:33:16,830 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:33:16,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:13" (3/4) ... [2025-03-03 19:33:16,832 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:33:16,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:33:16,833 INFO L158 Benchmark]: Toolchain (without parser) took 3805.89ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 59.7MB in the end (delta: 62.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2025-03-03 19:33:16,833 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.55ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.46ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: Boogie Preprocessor took 40.09ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 102.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: IcfgBuilder took 353.37ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 84.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: TraceAbstraction took 3194.33ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 59.7MB in the end (delta: 24.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-03-03 19:33:16,834 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:16,836 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 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.55ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.46ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.09ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 102.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 353.37ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 84.5MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3194.33ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 59.7MB in the end (delta: 24.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] float var_1_23 = 64.9; [L41] signed long int var_1_24 = 10000; [L42] signed long int var_1_25 = -128; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 2; [L45] unsigned char var_1_28 = 0; [L46] unsigned char var_1_29 = 1; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L151] RET updateLastVariables() [L152] CALL updateVariables() [L106] var_1_4 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L107] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L108] var_1_5 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L109] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L110] var_1_8 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L111] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L113] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L114] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L114] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L115] var_1_12 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L116] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L118] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L119] var_1_15 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L120] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L121] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L121] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L122] var_1_16 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L124] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L124] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L125] var_1_18 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L126] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L127] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L127] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L129] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L130] var_1_25 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L131] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L132] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L132] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L133] var_1_27 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L134] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L135] CALL assume_abort_if_not(var_1_27 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L135] RET assume_abort_if_not(var_1_27 <= 32) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L136] var_1_28 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L137] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L138] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L138] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L152] RET updateVariables() [L153] CALL step() [L52] var_1_22 = var_1_23 [L53] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L54] EXPR ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) >> ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L54] COND TRUE (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) >> ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < 25 [L55] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L57] var_1_29 = var_1_28 [L58] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_6=10000] [L59] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L60] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_6=10000] [L62] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L63] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L67] var_1_20 = var_1_16 [L68] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L69] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L70] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L71] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L78] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L79] COND FALSE !(\read(var_1_17)) [L90] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=1] [L92] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=1] [L93] COND FALSE !(var_1_6 > var_1_6) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L101] COND TRUE var_1_1 < var_1_11 [L102] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L153] RET step() [L154] CALL, EXPR property() [L144-L145] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 174 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243 SizeOfPredicates, 3 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2942/3040 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-03 19:33:16,851 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_ps-cn-10_file-2.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 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:33:18,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:33:18,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:33:18,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:33:18,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:33:18,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:33:18,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:33:18,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:33:18,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:33:18,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:33:18,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:33:18,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:33:18,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:33:18,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:33:18,765 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:33:18,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:33:18,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:33:18,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:33:18,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:18,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:33:18,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:33:18,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:33:18,769 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 -> 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 [2025-03-03 19:33:19,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:33:19,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:33:19,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:33:19,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:33:19,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:33:19,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:20,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb50bdcb/d0e490c7049342c29aa44a5fbde63122/FLAGa8fa26152 [2025-03-03 19:33:20,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:33:20,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:20,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb50bdcb/d0e490c7049342c29aa44a5fbde63122/FLAGa8fa26152 [2025-03-03 19:33:20,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb50bdcb/d0e490c7049342c29aa44a5fbde63122 [2025-03-03 19:33:20,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:33:20,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:33:20,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:20,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:33:20,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:33:20,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20, skipping insertion in model container [2025-03-03 19:33:20,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:33:20,563 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_ps-cn-10_file-2.i[914,927] [2025-03-03 19:33:20,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:20,636 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:33:20,645 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_ps-cn-10_file-2.i[914,927] [2025-03-03 19:33:20,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:20,694 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:33:20,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20 WrapperNode [2025-03-03 19:33:20,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:20,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:20,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:33:20,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:33:20,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,738 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-03 19:33:20,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:20,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:33:20,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:33:20,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:33:20,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,758 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-03 19:33:20,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:33:20,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:33:20,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:33:20,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:33:20,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (1/1) ... [2025-03-03 19:33:20,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:20,809 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-03 19:33:20,816 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-03 19:33:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:33:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:33:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:33:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:33:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:33:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:33:20,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:33:20,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:33:36,544 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 19:33:36,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:33:36,551 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:33:36,551 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:33:36,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:36 BoogieIcfgContainer [2025-03-03 19:33:36,552 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:33:36,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:33:36,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:33:36,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:33:36,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:33:20" (1/3) ... [2025-03-03 19:33:36,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43199a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:36, skipping insertion in model container [2025-03-03 19:33:36,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:20" (2/3) ... [2025-03-03 19:33:36,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43199a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:36, skipping insertion in model container [2025-03-03 19:33:36,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:36" (3/3) ... [2025-03-03 19:33:36,558 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-03 19:33:36,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:33:36,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:33:36,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:33:36,622 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;@198c57ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:33:36,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:33:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:33:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 19:33:36,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:36,636 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:36,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash 955936069, now seen corresponding path program 1 times [2025-03-03 19:33:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527663095] [2025-03-03 19:33:36,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:36,652 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-03 19:33:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:36,655 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-03 19:33:36,657 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-03 19:33:36,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:33:37,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:33:37,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:37,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:37,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:33:37,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 19:33:37,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:33:37,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:33:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527663095] [2025-03-03 19:33:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527663095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:33:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032331952] [2025-03-03 19:33:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:37,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:33:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:33:37,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:33:37,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:37,302 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:33:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:37,320 INFO L93 Difference]: Finished difference Result 124 states and 209 transitions. [2025-03-03 19:33:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:33:37,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2025-03-03 19:33:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:37,326 INFO L225 Difference]: With dead ends: 124 [2025-03-03 19:33:37,326 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 19:33:37,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-03 19:33:37,330 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:37,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:33:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 19:33:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 19:33:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:33:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-03-03 19:33:37,362 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 132 [2025-03-03 19:33:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:37,362 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-03-03 19:33:37,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:33:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-03-03 19:33:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 19:33:37,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:37,364 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:37,382 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-03 19:33:37,565 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-03 19:33:37,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:37,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash -194196291, now seen corresponding path program 1 times [2025-03-03 19:33:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:37,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819311657] [2025-03-03 19:33:37,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:37,567 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-03 19:33:37,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:37,569 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-03 19:33:37,570 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-03 19:33:37,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 19:33:38,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 19:33:38,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:38,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:38,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:33:38,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-03 19:33:39,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:33:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:33:40,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:33:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819311657] [2025-03-03 19:33:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819311657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:33:40,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:33:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 19:33:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56879973] [2025-03-03 19:33:40,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:33:40,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:33:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:33:40,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:33:40,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:33:40,724 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 19:33:43,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:47,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:51,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:55,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:56,624 INFO L93 Difference]: Finished difference Result 151 states and 214 transitions. [2025-03-03 19:33:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:33:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 133 [2025-03-03 19:33:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:56,626 INFO L225 Difference]: With dead ends: 151 [2025-03-03 19:33:56,626 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 19:33:56,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:33:56,627 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:56,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 220 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2025-03-03 19:33:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 19:33:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2025-03-03 19:33:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 19:33:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-03 19:33:56,639 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 133 [2025-03-03 19:33:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:56,639 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-03 19:33:56,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 19:33:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-03 19:33:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 19:33:56,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:56,641 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:33:56,659 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-03 19:33:56,842 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-03 19:33:56,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:56,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1052527259, now seen corresponding path program 1 times [2025-03-03 19:33:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573908507] [2025-03-03 19:33:56,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:56,843 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-03 19:33:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:56,845 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-03 19:33:56,846 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-03 19:33:56,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 19:33:57,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 19:33:57,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:57,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:57,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 19:33:57,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:27,909 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:34:36,053 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:34:44,199 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 19:34:52,352 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)