./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.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 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:52:44,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:52:44,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:52:44,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:52:44,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:52:44,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:52:44,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:52:44,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:52:44,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:52:44,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:52:44,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:52:44,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:52:44,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:52:44,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:52:44,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:52:44,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:52:44,834 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:52:44,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:52:44,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:52:44,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:52:44,835 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 -> 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 [2025-03-16 22:52:45,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:52:45,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:52:45,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:52:45,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:52:45,111 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:52:45,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2025-03-16 22:52:46,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23037ffe2/2974aff1cb4e46a6a87faf37cf1da255/FLAG5758455df [2025-03-16 22:52:46,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:52:46,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2025-03-16 22:52:46,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23037ffe2/2974aff1cb4e46a6a87faf37cf1da255/FLAG5758455df [2025-03-16 22:52:46,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23037ffe2/2974aff1cb4e46a6a87faf37cf1da255 [2025-03-16 22:52:46,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:52:46,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:52:46,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:52:46,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:52:46,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:52:46,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:52:46" (1/1) ... [2025-03-16 22:52:46,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4974237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:46, skipping insertion in model container [2025-03-16 22:52:46,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:52:46" (1/1) ... [2025-03-16 22:52:46,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:52:46,926 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_dependencies_file-19.i[919,932] [2025-03-16 22:52:46,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:52:47,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:52:47,016 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_dependencies_file-19.i[919,932] [2025-03-16 22:52:47,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:52:47,067 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:52:47,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47 WrapperNode [2025-03-16 22:52:47,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:52:47,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:52:47,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:52:47,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:52:47,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,118 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-16 22:52:47,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:52:47,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:52:47,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:52:47,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:52:47,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,148 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:52:47,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:52:47,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:52:47,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:52:47,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:52:47,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (1/1) ... [2025-03-16 22:52:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:52:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:52:47,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:52:47,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:52:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:52:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:52:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:52:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:52:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:52:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:52:47,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:52:47,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:52:47,589 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:52:47,589 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:52:47,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:52:47,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:52:47,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:52:47 BoogieIcfgContainer [2025-03-16 22:52:47,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:52:47,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:52:47,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:52:47,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:52:47,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:52:46" (1/3) ... [2025-03-16 22:52:47,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aabd4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:52:47, skipping insertion in model container [2025-03-16 22:52:47,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:47" (2/3) ... [2025-03-16 22:52:47,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aabd4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:52:47, skipping insertion in model container [2025-03-16 22:52:47,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:52:47" (3/3) ... [2025-03-16 22:52:47,604 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-19.i [2025-03-16 22:52:47,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:52:47,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-19.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:52:47,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:52:47,676 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;@7956f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:52:47,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:52:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:52:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:52:47,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:52:47,689 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:52:47,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:52:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:52:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -635074315, now seen corresponding path program 1 times [2025-03-16 22:52:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:52:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491911941] [2025-03-16 22:52:47,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:52:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:52:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:52:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:52:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:52:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491911941] [2025-03-16 22:52:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491911941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:52:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:52:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:52:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220137877] [2025-03-16 22:52:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:52:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:52:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:52:48,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:52:48,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:52:48,361 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:52:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:52:48,521 INFO L93 Difference]: Finished difference Result 179 states and 331 transitions. [2025-03-16 22:52:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:52:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 22:52:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:52:48,529 INFO L225 Difference]: With dead ends: 179 [2025-03-16 22:52:48,530 INFO L226 Difference]: Without dead ends: 123 [2025-03-16 22:52:48,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:52:48,534 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 72 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:52:48,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 258 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:52:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-16 22:52:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2025-03-16 22:52:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:52:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2025-03-16 22:52:48,610 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 136 [2025-03-16 22:52:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:52:48,610 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2025-03-16 22:52:48,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:52:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2025-03-16 22:52:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:52:48,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:52:48,616 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:52:48,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:52:48,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:52:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:52:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1862941622, now seen corresponding path program 1 times [2025-03-16 22:52:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:52:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783323556] [2025-03-16 22:52:48,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:52:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:52:48,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:48,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:48,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:48,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:52:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:52:48,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:52:48,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783323556] [2025-03-16 22:52:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783323556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:52:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:52:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:52:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962651070] [2025-03-16 22:52:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:52:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:52:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:52:48,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:52:48,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:52:48,883 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:52:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:52:48,929 INFO L93 Difference]: Finished difference Result 267 states and 415 transitions. [2025-03-16 22:52:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:52:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 22:52:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:52:48,932 INFO L225 Difference]: With dead ends: 267 [2025-03-16 22:52:48,932 INFO L226 Difference]: Without dead ends: 161 [2025-03-16 22:52:48,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:52:48,933 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:52:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 160 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:52:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-16 22:52:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-03-16 22:52:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 22:52:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2025-03-16 22:52:48,968 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 136 [2025-03-16 22:52:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:52:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2025-03-16 22:52:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:52:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2025-03-16 22:52:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:52:48,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:52:48,971 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:52:48,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:52:48,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:52:48,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:52:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1666428117, now seen corresponding path program 1 times [2025-03-16 22:52:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:52:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846585594] [2025-03-16 22:52:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:52:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:52:48,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:49,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:49,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:49,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:52:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 22:52:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:52:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846585594] [2025-03-16 22:52:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846585594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:52:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770236821] [2025-03-16 22:52:49,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:52:49,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:52:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:52:49,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:52:49,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:52:49,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:49,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:49,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:49,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:52:49,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 22:52:49,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:52:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 22:52:49,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:52:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 22:52:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770236821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:52:49,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:52:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-16 22:52:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743014993] [2025-03-16 22:52:49,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:52:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:52:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:52:49,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:52:49,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:52:49,896 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 22:52:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:52:50,108 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2025-03-16 22:52:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:52:50,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 136 [2025-03-16 22:52:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:52:50,111 INFO L225 Difference]: With dead ends: 289 [2025-03-16 22:52:50,111 INFO L226 Difference]: Without dead ends: 183 [2025-03-16 22:52:50,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 269 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:52:50,115 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:52:50,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 123 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:52:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-16 22:52:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2025-03-16 22:52:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 22:52:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 252 transitions. [2025-03-16 22:52:50,162 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 252 transitions. Word has length 136 [2025-03-16 22:52:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:52:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 252 transitions. [2025-03-16 22:52:50,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 22:52:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 252 transitions. [2025-03-16 22:52:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:52:50,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:52:50,166 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:52:50,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:52:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:52:50,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:52:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:52:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1667351638, now seen corresponding path program 1 times [2025-03-16 22:52:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:52:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117801549] [2025-03-16 22:52:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:52:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:52:50,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:50,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:50,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:50,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:52:50,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:52:50,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:52:50,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:52:50,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:52:50,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:52:50,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:52:50,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:52:50,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:52:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:52:50,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 22:52:50,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:52:50,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:52:50 BoogieIcfgContainer [2025-03-16 22:52:50,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:52:50,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:52:50,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:52:50,601 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:52:50,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:52:47" (3/4) ... [2025-03-16 22:52:50,603 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:52:50,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:52:50,604 INFO L158 Benchmark]: Toolchain (without parser) took 3816.98ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 81.4MB in the end (delta: 40.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2025-03-16 22:52:50,604 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:52:50,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.93ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:52:50,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 101.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:52:50,604 INFO L158 Benchmark]: Boogie Preprocessor took 53.21ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 90.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:52:50,605 INFO L158 Benchmark]: IcfgBuilder took 422.86ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 64.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:52:50,605 INFO L158 Benchmark]: TraceAbstraction took 3001.34ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 83.1MB in the end (delta: -19.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:52:50,605 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 167.8MB. Free memory was 83.1MB in the beginning and 81.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:52:50,606 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.15ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.93ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 101.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.21ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 90.5MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 422.86ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 64.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3001.34ms. Allocated memory is still 167.8MB. Free memory was 64.1MB in the beginning and 83.1MB in the end (delta: -19.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 167.8MB. Free memory was 83.1MB in the beginning and 81.4MB in the end (delta: 1.7MB). 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 113, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryFLOAToperation at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] unsigned char last_1_var_1_15 = 0; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] last_1_var_1_15 = var_1_15 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L84] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L85] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L85] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L89] var_1_7 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L90] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L91] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L91] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L92] var_1_8 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L93] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L94] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L94] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L95] var_1_9 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L96] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L97] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L97] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L98] var_1_12 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L99] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L100] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L100] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L101] var_1_13 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L103] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L103] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L105] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L106] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L106] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L107] var_1_23 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L108] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L109] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L109] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L110] var_1_25 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L111] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L112] var_1_26 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L113] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L114] var_1_27 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L115] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L116] var_1_28 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L117] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L131] RET updateVariables() [L132] CALL step() [L47] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L50] COND FALSE !(\read(var_1_10)) [L53] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L55] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L62] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L64] COND FALSE !(var_1_24 != var_1_24) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L67] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L68] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L70] COND TRUE (var_1_7 - (var_1_8 - var_1_2)) >= var_1_29 [L71] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-32512, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L73] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-32512, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L76] COND TRUE (var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L77] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-32512, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-32512, var_1_7=32896, var_1_8=32767, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-128, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-32512, var_1_7=32896, var_1_8=32767, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 111 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 228 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 2 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4530/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:52:50,624 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_dependencies_file-19.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 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:52:52,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:52:52,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:52:52,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:52:52,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:52:52,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:52:52,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:52:52,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:52:52,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:52:52,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:52:52,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:52:52,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:52:52,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:52:52,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:52:52,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:52:52,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:52:52,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:52:52,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:52:52,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:52:52,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:52:52,557 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 -> 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 [2025-03-16 22:52:52,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:52:52,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:52:52,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:52:52,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:52:52,797 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:52:52,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2025-03-16 22:52:53,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30c49ce0/96a183a522ba4a4784e3f18b34f0da72/FLAG447839e22 [2025-03-16 22:52:54,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:52:54,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2025-03-16 22:52:54,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30c49ce0/96a183a522ba4a4784e3f18b34f0da72/FLAG447839e22 [2025-03-16 22:52:54,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30c49ce0/96a183a522ba4a4784e3f18b34f0da72 [2025-03-16 22:52:54,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:52:54,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:52:54,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:52:54,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:52:54,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:52:54,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430495d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54, skipping insertion in model container [2025-03-16 22:52:54,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:52:54,649 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_dependencies_file-19.i[919,932] [2025-03-16 22:52:54,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:52:54,706 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:52:54,717 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_dependencies_file-19.i[919,932] [2025-03-16 22:52:54,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:52:54,753 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:52:54,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54 WrapperNode [2025-03-16 22:52:54,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:52:54,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:52:54,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:52:54,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:52:54,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,789 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-16 22:52:54,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:52:54,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:52:54,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:52:54,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:52:54,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:52:54,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:52:54,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:52:54,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:52:54,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:52:54,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (1/1) ... [2025-03-16 22:52:54,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:52:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:52:54,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:52:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:52:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:52:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:52:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:52:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:52:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:52:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:52:54,931 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:52:54,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:53:08,447 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:53:08,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:53:08,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:53:08,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:53:08,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:53:08 BoogieIcfgContainer [2025-03-16 22:53:08,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:53:08,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:53:08,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:53:08,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:53:08,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:52:54" (1/3) ... [2025-03-16 22:53:08,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8625036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:53:08, skipping insertion in model container [2025-03-16 22:53:08,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:52:54" (2/3) ... [2025-03-16 22:53:08,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8625036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:53:08, skipping insertion in model container [2025-03-16 22:53:08,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:53:08" (3/3) ... [2025-03-16 22:53:08,467 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-19.i [2025-03-16 22:53:08,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:53:08,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-19.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:53:08,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:53:08,521 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;@41691cb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:53:08,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:53:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:53:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:53:08,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:53:08,534 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:53:08,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:53:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:53:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -635074315, now seen corresponding path program 1 times [2025-03-16 22:53:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:53:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46126695] [2025-03-16 22:53:08,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:53:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:53:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:53:08,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:53:08,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 22:53:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:53:09,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:53:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:53:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:53:09,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 22:53:09,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:53:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:53:13,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:53:13,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:53:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46126695] [2025-03-16 22:53:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46126695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:53:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:53:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:53:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261868171] [2025-03-16 22:53:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:53:13,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:53:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:53:13,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:53:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:53:13,975 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:53:18,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:22,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:23,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:28,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:32,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:36,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:53:36,567 INFO L93 Difference]: Finished difference Result 186 states and 341 transitions. [2025-03-16 22:53:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:53:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 22:53:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:53:36,718 INFO L225 Difference]: With dead ends: 186 [2025-03-16 22:53:36,718 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 22:53:36,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:53:36,722 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 49 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:53:36,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 9 Invalid, 5 Unknown, 0 Unchecked, 22.4s Time] [2025-03-16 22:53:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 22:53:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2025-03-16 22:53:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:53:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2025-03-16 22:53:36,771 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 136 [2025-03-16 22:53:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:53:36,773 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2025-03-16 22:53:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:53:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2025-03-16 22:53:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:53:36,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:53:36,776 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:53:36,797 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-16 22:53:36,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:53:36,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:53:36,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:53:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1862941622, now seen corresponding path program 1 times [2025-03-16 22:53:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:53:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114534026] [2025-03-16 22:53:36,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:53:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:53:36,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:53:36,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:53:36,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 22:53:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:53:37,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:53:37,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:53:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:53:37,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 22:53:37,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:53:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 22:53:41,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:53:41,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:53:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114534026] [2025-03-16 22:53:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114534026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:53:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:53:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:53:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828598807] [2025-03-16 22:53:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:53:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:53:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:53:41,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:53:41,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:53:41,953 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:53:46,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:50,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:53:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:53:50,948 INFO L93 Difference]: Finished difference Result 319 states and 496 transitions. [2025-03-16 22:53:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:53:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-03-16 22:53:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:53:51,082 INFO L225 Difference]: With dead ends: 319 [2025-03-16 22:53:51,082 INFO L226 Difference]: Without dead ends: 213 [2025-03-16 22:53:51,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:53:51,084 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:53:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 161 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-03-16 22:53:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-16 22:53:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2025-03-16 22:53:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 118 states have (on average 1.271186440677966) internal successors, (150), 118 states have internal predecessors, (150), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:53:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2025-03-16 22:53:51,121 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 136 [2025-03-16 22:53:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:53:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2025-03-16 22:53:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 22:53:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2025-03-16 22:53:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:53:51,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:53:51,133 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:53:51,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 22:53:51,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:53:51,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:53:51,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:53:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1666428117, now seen corresponding path program 1 times [2025-03-16 22:53:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:53:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293217530] [2025-03-16 22:53:51,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:53:51,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:53:51,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:53:51,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:53:51,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 22:53:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:53:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:53:52,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:53:52,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:53:52,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 22:53:52,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:53:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 22:53:54,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:53:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 22:53:57,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:53:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293217530] [2025-03-16 22:53:57,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293217530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:53:57,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:53:57,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-16 22:53:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547583887] [2025-03-16 22:53:57,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:53:57,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:53:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:53:57,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:53:57,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:53:57,851 INFO L87 Difference]: Start difference. First operand 211 states and 326 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 22:54:05,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:54:09,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:54:13,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:54:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:13,302 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2025-03-16 22:54:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:54:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 136 [2025-03-16 22:54:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:13,447 INFO L225 Difference]: With dead ends: 275 [2025-03-16 22:54:13,447 INFO L226 Difference]: Without dead ends: 65 [2025-03-16 22:54:13,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:54:13,453 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 107 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:13,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 114 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2025-03-16 22:54:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-16 22:54:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-03-16 22:54:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 22:54:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2025-03-16 22:54:13,463 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 136 [2025-03-16 22:54:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:13,464 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2025-03-16 22:54:13,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 22:54:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2025-03-16 22:54:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 22:54:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:13,467 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:54:13,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 22:54:13,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:54:13,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1667351638, now seen corresponding path program 1 times [2025-03-16 22:54:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:54:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988478830] [2025-03-16 22:54:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:54:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:54:13,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:54:13,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 22:54:13,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 22:54:14,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 22:54:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:14,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:54:14,424 INFO L279 TraceCheckSpWp]: Computing forward predicates...