./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.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_codestructure_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:08:11,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:08:11,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:08:11,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:08:11,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:08:11,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:08:11,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:08:11,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:08:11,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:08:11,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:08:11,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:08:11,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:08:11,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:08:11,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:08:11,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:08:11,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:08:11,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:08:11,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:08:11,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:08:11,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:11,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:08:11,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:08:11,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:08:11,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:08:11,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:08:11,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:08:11,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:08:11,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:08:11,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:08:11,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:08:11,514 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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-03-03 19:08:11,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:08:11,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:08:11,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:08:11,743 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:08:11,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:08:11,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:12,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a9103d/f7e5ca676e2e4f7aa599c6763cc46faf/FLAG45bf1e310 [2025-03-03 19:08:13,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:08:13,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:13,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a9103d/f7e5ca676e2e4f7aa599c6763cc46faf/FLAG45bf1e310 [2025-03-03 19:08:13,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a9103d/f7e5ca676e2e4f7aa599c6763cc46faf [2025-03-03 19:08:13,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:08:13,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:08:13,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:13,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:08:13,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:08:13,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260214f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13, skipping insertion in model container [2025-03-03 19:08:13,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:08:13,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i[917,930] [2025-03-03 19:08:13,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:13,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:08:13,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i[917,930] [2025-03-03 19:08:13,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:13,667 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:08:13,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13 WrapperNode [2025-03-03 19:08:13,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:13,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:13,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:08:13,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:08:13,673 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:08:13" (1/1) ... [2025-03-03 19:08:13,679 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:08:13" (1/1) ... [2025-03-03 19:08:13,695 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-03 19:08:13,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:13,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:08:13,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:08:13,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:08:13,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,722 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:08:13,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:08:13,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:08:13,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:08:13,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:08:13,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (1/1) ... [2025-03-03 19:08:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:13,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:13,764 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:08:13,772 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:08:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:08:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:08:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:08:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:08:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:08:13,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:08:13,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:08:13,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:08:14,072 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:08:14,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:08:14,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:08:14,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:08:14,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:14 BoogieIcfgContainer [2025-03-03 19:08:14,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:08:14,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:08:14,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:08:14,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:08:14,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:08:13" (1/3) ... [2025-03-03 19:08:14,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2237ee63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:14, skipping insertion in model container [2025-03-03 19:08:14,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:13" (2/3) ... [2025-03-03 19:08:14,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2237ee63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:14, skipping insertion in model container [2025-03-03 19:08:14,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:14" (3/3) ... [2025-03-03 19:08:14,088 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:14,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:08:14,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:08:14,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:08:14,142 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;@2d5817ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:08:14,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:08:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 19:08:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 19:08:14,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:14,155 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:14,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-03-03 19:08:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810193956] [2025-03-03 19:08:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 19:08:14,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 19:08:14,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:14,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 19:08:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:14,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810193956] [2025-03-03 19:08:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810193956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:08:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142743638] [2025-03-03 19:08:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:08:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:14,425 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:08:14,426 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:08:14,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 19:08:14,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 19:08:14,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:14,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:14,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:08:14,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:08:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 19:08:14,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:08:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142743638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:08:14,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:08:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792031072] [2025-03-03 19:08:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:08:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:14,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:08:14,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:08:14,616 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:08:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:14,641 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-03-03 19:08:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:08:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-03 19:08:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:14,649 INFO L225 Difference]: With dead ends: 156 [2025-03-03 19:08:14,650 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 19:08:14,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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:08:14,655 INFO L435 NwaCegarLoop]: 120 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, 120 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:08:14,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:08:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 19:08:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 19:08:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 19:08:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-03 19:08:14,686 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-03-03 19:08:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:14,686 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-03 19:08:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:08:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-03 19:08:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 19:08:14,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:14,690 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,696 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:08:14,890 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:08:14,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-03-03 19:08:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050713677] [2025-03-03 19:08:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 19:08:14,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 19:08:14,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:14,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 19:08:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050713677] [2025-03-03 19:08:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050713677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:08:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106434298] [2025-03-03 19:08:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:15,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:08:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:15,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:08:15,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:08:15,129 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 19:08:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:15,184 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-03-03 19:08:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:08:15,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-03 19:08:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:15,186 INFO L225 Difference]: With dead ends: 188 [2025-03-03 19:08:15,186 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 19:08:15,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:08:15,189 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 48 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:15,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:08:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 19:08:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-03 19:08:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:08:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-03-03 19:08:15,207 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-03-03 19:08:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:15,208 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-03-03 19:08:15,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 19:08:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-03-03 19:08:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 19:08:15,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:15,212 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:08:15,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-03-03 19:08:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93290095] [2025-03-03 19:08:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:15,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 19:08:15,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 19:08:15,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:08:15,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:08:15,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 19:08:15,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 19:08:15,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:15,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:08:15,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:08:15,490 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:08:15,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:08:15,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:08:15,495 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 19:08:15,570 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:08:15,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:08:15 BoogieIcfgContainer [2025-03-03 19:08:15,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:08:15,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:08:15,573 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:08:15,573 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:08:15,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:14" (3/4) ... [2025-03-03 19:08:15,575 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:08:15,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:08:15,576 INFO L158 Benchmark]: Toolchain (without parser) took 2126.81ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 66.3MB in the end (delta: 46.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2025-03-03 19:08:15,577 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:15,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.07ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 98.6MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:08:15,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:08:15,577 INFO L158 Benchmark]: Boogie Preprocessor took 34.23ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:15,577 INFO L158 Benchmark]: IcfgBuilder took 351.69ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 72.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:08:15,578 INFO L158 Benchmark]: TraceAbstraction took 1488.81ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 66.3MB in the end (delta: 5.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2025-03-03 19:08:15,578 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:15,579 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.07ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 98.6MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.23ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 351.69ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 72.6MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1488.81ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 66.3MB in the end (delta: 5.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] unsigned short int var_1_2 = 0; [L24] unsigned short int var_1_3 = 64; [L25] signed long int var_1_4 = 2; [L26] float var_1_5 = 0.0; [L27] float var_1_6 = 4.2; [L28] float var_1_7 = 31.25; [L29] float var_1_8 = 1.375; [L30] unsigned short int var_1_9 = 32; [L31] unsigned char var_1_10 = 1; [L32] float var_1_11 = 0.625; [L33] unsigned short int var_1_12 = 1; [L34] float var_1_13 = -0.25; [L35] signed short int var_1_14 = 4; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] signed short int var_1_17 = 8; [L39] signed short int var_1_18 = 5; [L40] signed short int var_1_19 = 128; [L41] signed long int var_1_20 = -50; [L42] signed short int var_1_21 = -16; [L43] signed short int var_1_22 = 16; [L44] signed short int var_1_23 = 32; [L45] signed short int var_1_24 = 2; [L46] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_2=0, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_3=64, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L102] var_1_3 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L104] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=2, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L106] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L107] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L108] var_1_5 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L109] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L110] var_1_6 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L111] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L112] var_1_7 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_8=11/8, var_1_9=32] [L114] var_1_8 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L115] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L118] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L119] var_1_11 = __VERIFIER_nondet_float() [L120] 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, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L120] 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, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L121] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L122] var_1_12 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L123] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L124] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L125] var_1_15 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L127] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L128] var_1_16 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L130] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L131] var_1_17 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L132] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L133] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L134] var_1_18 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L135] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L136] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L137] var_1_19 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L138] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L139] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L140] var_1_22 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L142] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_4=0, var_1_9=32] [L143] var_1_24 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L144] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L145] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_4=0, var_1_9=32] [L146] var_1_25 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L147] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L148] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L161] RET updateVariables() [L162] CALL step() [L50] signed long int stepLocal_2 = var_1_4; [L51] signed long int stepLocal_1 = var_1_4; [L52] signed long int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_4=0, var_1_9=32] [L53] COND FALSE !((var_1_2 + var_1_3) < stepLocal_1) [L62] var_1_1 = var_1_8 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L64] unsigned char stepLocal_4 = var_1_1 < (var_1_8 / var_1_11); [L65] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=32] [L66] COND FALSE !(var_1_10 || stepLocal_4) [L71] var_1_9 = var_1_12 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L73] COND FALSE !(\read(var_1_10)) [L76] var_1_13 = ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L78] unsigned char stepLocal_5 = ! (var_1_10 || var_1_15); VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L79] COND TRUE stepLocal_5 || var_1_16 [L80] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L82] COND TRUE \read(var_1_16) [L83] var_1_20 = (var_1_3 - 50) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-16, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L85] COND TRUE \read(var_1_15) [L86] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L88] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L91] COND TRUE \read(var_1_16) [L92] var_1_23 = var_1_24 VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L162] RET step() [L163] CALL, EXPR property() [L153-L154] return ((((((((var_1_2 + var_1_3) < var_1_4) ? ((var_1_4 <= (var_1_3 - var_1_2)) ? ((var_1_4 < var_1_3) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_1 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_1 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_3 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=-2, var_1_13=203/20, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=8216, var_1_19=8216, var_1_1=8221, var_1_20=-50, var_1_21=-1, var_1_22=8190, var_1_23=0, var_1_24=0, var_1_25=-8191, var_1_2=1, var_1_3=0, var_1_4=0, var_1_8=8221, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 268 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=2, InterpolantAutomatonStates: 5, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 437 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5890/5952 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:08:15,594 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_codestructure_steplocals_file-93.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 bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:08:17,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:08:17,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:08:17,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:08:17,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:08:17,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:08:17,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:08:17,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:08:17,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:08:17,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:08:17,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:08:17,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:08:17,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:08:17,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:08:17,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:08:17,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:08:17,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:08:17,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:08:17,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:08:17,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:08:17,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:08:17,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:08:17,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:08:17,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:08:17,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:17,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:08:17,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:08:17,479 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 -> bd91f8319b366f9e737c54eb1f99b1168442b9ac934a3b601c547c20154488fd [2025-03-03 19:08:17,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:08:17,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:08:17,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:08:17,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:08:17,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:08:17,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:18,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5dde4ae/99a863232fd249e6944ca50085e6950f/FLAG05b83f556 [2025-03-03 19:08:19,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:08:19,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:19,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5dde4ae/99a863232fd249e6944ca50085e6950f/FLAG05b83f556 [2025-03-03 19:08:19,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5dde4ae/99a863232fd249e6944ca50085e6950f [2025-03-03 19:08:19,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:08:19,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:08:19,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:19,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:08:19,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:08:19,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b18f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19, skipping insertion in model container [2025-03-03 19:08:19,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:08:19,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i[917,930] [2025-03-03 19:08:19,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:19,352 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:08:19,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-93.i[917,930] [2025-03-03 19:08:19,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:19,399 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:08:19,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19 WrapperNode [2025-03-03 19:08:19,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:19,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:19,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:08:19,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:08:19,405 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:08:19" (1/1) ... [2025-03-03 19:08:19,411 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:08:19" (1/1) ... [2025-03-03 19:08:19,429 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-03 19:08:19,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:19,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:08:19,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:08:19,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:08:19,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,446 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:08:19,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:08:19,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:08:19,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:08:19,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:08:19,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (1/1) ... [2025-03-03 19:08:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:19,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:19,493 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:08:19,495 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:08:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:08:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:08:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:08:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:08:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:08:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:08:19,586 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:08:19,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:08:25,378 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:08:25,380 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:08:25,388 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:08:25,388 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:08:25,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:25 BoogieIcfgContainer [2025-03-03 19:08:25,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:08:25,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:08:25,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:08:25,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:08:25,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:08:19" (1/3) ... [2025-03-03 19:08:25,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631d878b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:25, skipping insertion in model container [2025-03-03 19:08:25,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:19" (2/3) ... [2025-03-03 19:08:25,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631d878b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:25, skipping insertion in model container [2025-03-03 19:08:25,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:25" (3/3) ... [2025-03-03 19:08:25,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-93.i [2025-03-03 19:08:25,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:08:25,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-93.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:08:25,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:08:25,460 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;@654872a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:08:25,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:08:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 19:08:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 19:08:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:25,473 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:25,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:25,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1863272572, now seen corresponding path program 1 times [2025-03-03 19:08:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:08:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735168521] [2025-03-03 19:08:25,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:25,485 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:08:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:08:25,487 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:08:25,490 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:08:25,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 19:08:25,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 19:08:25,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:25,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:25,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:08:25,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:08:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-03 19:08:25,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:08:25,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:08:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735168521] [2025-03-03 19:08:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735168521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:25,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:08:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348385964] [2025-03-03 19:08:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:25,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:08:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:08:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:08:25,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:08:25,961 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:08:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:25,985 INFO L93 Difference]: Finished difference Result 156 states and 277 transitions. [2025-03-03 19:08:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:08:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-03 19:08:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:25,991 INFO L225 Difference]: With dead ends: 156 [2025-03-03 19:08:25,991 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 19:08:25,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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:08:25,996 INFO L435 NwaCegarLoop]: 120 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, 120 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:08:25,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:08:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 19:08:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 19:08:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 19:08:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-03 19:08:26,036 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 196 [2025-03-03 19:08:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:26,037 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-03 19:08:26,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 19:08:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-03 19:08:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 19:08:26,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:26,043 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:26,055 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:08:26,244 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:08:26,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606720, now seen corresponding path program 1 times [2025-03-03 19:08:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:08:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736884581] [2025-03-03 19:08:26,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:26,248 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:08:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:08:26,250 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:08:26,252 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:08:26,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 19:08:26,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 19:08:26,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:26,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:26,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:08:26,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:08:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 19:08:26,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:08:26,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:08:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736884581] [2025-03-03 19:08:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736884581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:26,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:08:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157249093] [2025-03-03 19:08:26,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:26,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:08:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:08:26,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:08:26,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:08:26,699 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 19:08:31,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:08:33,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:08:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:33,358 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2025-03-03 19:08:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:08:33,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-03 19:08:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:33,361 INFO L225 Difference]: With dead ends: 188 [2025-03-03 19:08:33,361 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 19:08:33,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:08:33,362 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:33,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 254 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2025-03-03 19:08:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 19:08:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-03 19:08:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 66 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 19:08:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-03-03 19:08:33,375 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 196 [2025-03-03 19:08:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:33,375 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-03-03 19:08:33,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 19:08:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-03-03 19:08:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 19:08:33,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:33,377 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:33,388 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:08:33,578 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:08:33,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1840611205, now seen corresponding path program 1 times [2025-03-03 19:08:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:08:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013854127] [2025-03-03 19:08:33,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:33,579 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:08:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:08:33,582 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:08:33,583 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:08:33,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 19:08:33,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 19:08:33,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:33,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:33,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 19:08:33,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:09:03,081 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 19:09:30,405 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)