./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2015d37ef3c12f799914a1d5573231d07895302eda54efaaedb57c9454a76b5a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:51:52,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:51:52,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:51:52,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:51:52,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:51:52,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:51:52,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:51:52,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:51:52,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:51:52,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:51:52,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:51:52,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:51:52,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:52,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:51:52,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:51:52,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:51:52,238 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-jdk21/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 -> 2015d37ef3c12f799914a1d5573231d07895302eda54efaaedb57c9454a76b5a [2025-02-05 20:51:52,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:51:52,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:51:52,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:51:52,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:51:52,512 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:51:52,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i [2025-02-05 20:51:53,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9c74a030/490cf8778f4d470faf69eefc447fe0b3/FLAG4d7ebd5b7 [2025-02-05 20:51:54,016 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:51:54,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i [2025-02-05 20:51:54,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9c74a030/490cf8778f4d470faf69eefc447fe0b3/FLAG4d7ebd5b7 [2025-02-05 20:51:54,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9c74a030/490cf8778f4d470faf69eefc447fe0b3 [2025-02-05 20:51:54,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:51:54,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:51:54,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:54,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:51:54,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:51:54,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596afd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54, skipping insertion in model container [2025-02-05 20:51:54,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:51:54,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i[917,930] [2025-02-05 20:51:54,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:54,215 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:51:54,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i[917,930] [2025-02-05 20:51:54,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:54,251 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:51:54,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54 WrapperNode [2025-02-05 20:51:54,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:54,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:51:54,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:51:54,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:51:54,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,293 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-02-05 20:51:54,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:51:54,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:51:54,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:51:54,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:51:54,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,334 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-02-05 20:51:54,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:51:54,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:51:54,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:51:54,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:51:54,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (1/1) ... [2025-02-05 20:51:54,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:54,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:51:54,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:51:54,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:51:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:51:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:51:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:51:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:51:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:51:54,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:51:54,466 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:51:54,806 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise19#1;havoc property_#t~short20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-02-05 20:51:54,839 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 20:51:54,840 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:51:54,869 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:51:54,869 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:51:54,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:54 BoogieIcfgContainer [2025-02-05 20:51:54,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:51:54,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:51:54,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:51:54,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:51:54,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:51:54" (1/3) ... [2025-02-05 20:51:54,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79879199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:51:54, skipping insertion in model container [2025-02-05 20:51:54,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:54" (2/3) ... [2025-02-05 20:51:54,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79879199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:51:54, skipping insertion in model container [2025-02-05 20:51:54,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:54" (3/3) ... [2025-02-05 20:51:54,877 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-78.i [2025-02-05 20:51:54,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:51:54,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-78.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:51:54,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:51:54,933 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;@5866610d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:51:54,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:51:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 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-02-05 20:51:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:51:54,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:54,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:51:54,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1961715839, now seen corresponding path program 1 times [2025-02-05 20:51:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698404397] [2025-02-05 20:51:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:55,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:51:55,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:51:55,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 20:51:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:51:55,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698404397] [2025-02-05 20:51:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698404397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:51:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428676667] [2025-02-05 20:51:55,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:55,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:55,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:55,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:51:55,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:51:55,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:51:55,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:51:55,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:55,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:51:55,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:51:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 20:51:55,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:51:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428676667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:51:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:51:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:51:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112408663] [2025-02-05 20:51:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:51:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:51:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:51:55,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:51:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:51:55,401 INFO L87 Difference]: Start difference. First operand has 82 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:51:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:51:55,432 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2025-02-05 20:51:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:51:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-02-05 20:51:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:51:55,440 INFO L225 Difference]: With dead ends: 158 [2025-02-05 20:51:55,440 INFO L226 Difference]: Without dead ends: 79 [2025-02-05 20:51:55,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:51:55,448 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:51:55,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:51:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-05 20:51:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-05 20:51:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 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-02-05 20:51:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2025-02-05 20:51:55,482 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 145 [2025-02-05 20:51:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:51:55,483 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2025-02-05 20:51:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:51:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2025-02-05 20:51:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:51:55,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:55,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:51:55,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:51:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:51:55,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1725385913, now seen corresponding path program 1 times [2025-02-05 20:51:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178559163] [2025-02-05 20:51:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:55,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:51:55,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:51:55,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 20:51:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:51:56,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178559163] [2025-02-05 20:51:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178559163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:51:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:51:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:51:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840511384] [2025-02-05 20:51:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:51:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:51:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:51:56,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:51:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:51:56,398 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-02-05 20:51:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:51:56,506 INFO L93 Difference]: Finished difference Result 157 states and 237 transitions. [2025-02-05 20:51:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:51:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 145 [2025-02-05 20:51:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:51:56,509 INFO L225 Difference]: With dead ends: 157 [2025-02-05 20:51:56,510 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 20:51:56,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 20:51:56,511 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:51:56,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 231 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:51:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 20:51:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-05 20:51:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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-02-05 20:51:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2025-02-05 20:51:56,524 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 145 [2025-02-05 20:51:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:51:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2025-02-05 20:51:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-02-05 20:51:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2025-02-05 20:51:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 20:51:56,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:56,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:51:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:51:56,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash -985840137, now seen corresponding path program 1 times [2025-02-05 20:51:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413633136] [2025-02-05 20:51:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:56,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 20:51:56,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 20:51:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:56,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 20:51:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:51:56,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413633136] [2025-02-05 20:51:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413633136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:51:56,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:51:56,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:51:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479879615] [2025-02-05 20:51:56,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:51:56,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:51:56,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:51:56,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:51:56,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:51:56,772 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-02-05 20:51:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:51:56,917 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2025-02-05 20:51:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:51:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 147 [2025-02-05 20:51:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:51:56,921 INFO L225 Difference]: With dead ends: 159 [2025-02-05 20:51:56,921 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 20:51:56,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:51:56,922 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 55 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:51:56,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 393 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:51:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 20:51:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-05 20:51:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 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-02-05 20:51:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2025-02-05 20:51:56,935 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 147 [2025-02-05 20:51:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:51:56,936 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2025-02-05 20:51:56,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-02-05 20:51:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2025-02-05 20:51:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 20:51:56,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:56,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:51:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:51:56,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash 920911423, now seen corresponding path program 1 times [2025-02-05 20:51:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848022589] [2025-02-05 20:51:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 20:51:57,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 20:51:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:51:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543354079] [2025-02-05 20:51:57,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:57,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:51:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:51:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 20:51:57,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 20:51:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:51:57,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:51:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 20:51:57,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 20:51:57,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:57,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:51:57,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:51:57,413 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:51:57,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:51:57,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:51:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:57,619 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 20:51:57,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:51:57,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:51:57 BoogieIcfgContainer [2025-02-05 20:51:57,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:51:57,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:51:57,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:51:57,692 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:51:57,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:54" (3/4) ... [2025-02-05 20:51:57,694 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:51:57,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:51:57,696 INFO L158 Benchmark]: Toolchain (without parser) took 3652.56ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 109.9MB in the beginning and 181.1MB in the end (delta: -71.2MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,696 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:57,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.31ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 94.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.13ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 88.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,697 INFO L158 Benchmark]: Boogie Preprocessor took 66.96ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 79.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,698 INFO L158 Benchmark]: IcfgBuilder took 508.07ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 46.7MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,698 INFO L158 Benchmark]: TraceAbstraction took 2819.81ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 46.7MB in the beginning and 181.1MB in the end (delta: -134.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-02-05 20:51:57,698 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 327.2MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:57,699 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 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.31ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 94.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.13ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 88.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.96ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 79.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 508.07ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 46.7MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2819.81ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 46.7MB in the beginning and 181.1MB in the end (delta: -134.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 327.2MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] signed long int var_1_2 = 0; [L24] unsigned char var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 2; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 8; [L29] double var_1_8 = 1.875; [L30] signed long int var_1_9 = -4; [L31] double var_1_10 = 63.5; [L32] double var_1_11 = 255.375; [L33] double var_1_12 = 999999999.525; [L34] double var_1_13 = 63.75; [L35] double var_1_14 = 0.625; [L36] unsigned short int var_1_15 = 5; [L37] signed char var_1_16 = 4; [L38] signed char var_1_17 = 0; [L39] signed char var_1_18 = -2; [L40] signed char var_1_19 = 1; [L41] unsigned short int var_1_20 = 50; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L78] var_1_2 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_2 >= -2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L79] RET assume_abort_if_not(var_1_2 >= -2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L80] CALL assume_abort_if_not(var_1_2 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L80] RET assume_abort_if_not(var_1_2 <= 2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L87] var_1_7 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L88] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L89] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L89] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L90] var_1_9 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L91] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L92] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L92] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L93] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L93] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L94] var_1_10 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L95] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L96] var_1_11 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L97] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L98] var_1_12 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L99] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L100] var_1_13 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L101] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L102] var_1_14 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L103] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L104] var_1_17 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L105] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L106] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L108] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L109] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L110] var_1_19 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L111] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L112] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L112] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L125] RET updateVariables() [L126] CALL step() [L46] var_1_1 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L47] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L48] COND FALSE !(var_1_1 < stepLocal_0) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L51] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L51] signed long int stepLocal_2 = var_1_2 ^ var_1_1; [L52] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=0, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L53] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, stepLocal_1=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=32] [L56] COND TRUE stepLocal_1 <= 50 [L57] var_1_6 = var_1_3 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_8=15/8, var_1_9=32] [L60] COND TRUE var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L61] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L67] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1 [L68] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, var_1_15=66, var_1_16=4, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_20 = (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4))) [L72] signed char stepLocal_3 = var_1_16; VAL [isInitial=1, stepLocal_3=0, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L73] EXPR (var_1_2 * var_1_17) & (var_1_15 * var_1_18) VAL [isInitial=1, stepLocal_3=0, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L73] COND TRUE stepLocal_3 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18)) [L74] var_1_21 = (var_1_4 + 128) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L117] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L117] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L117] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L117-L118] return (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] [L19] reach_error() VAL [isInitial=1, var_1_15=66, var_1_16=0, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=0, var_1_20=65, var_1_21=193, var_1_2=0, var_1_3=64, var_1_4=65, var_1_5=1, var_1_6=64, var_1_7=0, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 739 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 227 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 288 mSDtfsCounter, 227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3654/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:51:57,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2015d37ef3c12f799914a1d5573231d07895302eda54efaaedb57c9454a76b5a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:51:59,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:51:59,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:51:59,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:51:59,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:51:59,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:51:59,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:51:59,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:51:59,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:51:59,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:51:59,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:51:59,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:51:59,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:51:59,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:51:59,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:51:59,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:59,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:51:59,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:51:59,716 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-jdk21/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 -> 2015d37ef3c12f799914a1d5573231d07895302eda54efaaedb57c9454a76b5a [2025-02-05 20:51:59,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:51:59,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:51:59,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:51:59,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:51:59,994 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:51:59,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i [2025-02-05 20:52:01,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7d93384/816357a544ff44e08c5649355827a90c/FLAGcff1e3692 [2025-02-05 20:52:01,410 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:52:01,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i [2025-02-05 20:52:01,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7d93384/816357a544ff44e08c5649355827a90c/FLAGcff1e3692 [2025-02-05 20:52:01,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b7d93384/816357a544ff44e08c5649355827a90c [2025-02-05 20:52:01,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:52:01,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:52:01,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:52:01,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:52:01,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:52:01,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b396e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01, skipping insertion in model container [2025-02-05 20:52:01,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:52:01,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i[917,930] [2025-02-05 20:52:01,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:52:01,640 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:52:01,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-78.i[917,930] [2025-02-05 20:52:01,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:52:01,704 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:52:01,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01 WrapperNode [2025-02-05 20:52:01,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:52:01,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:52:01,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:52:01,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:52:01,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,752 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-02-05 20:52:01,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:52:01,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:52:01,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:52:01,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:52:01,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,778 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-02-05 20:52:01,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:52:01,810 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:52:01,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:52:01,810 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:52:01,811 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (1/1) ... [2025-02-05 20:52:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:52:01,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:52:01,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:52:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:52:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:52:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:52:01,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:52:01,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:52:01,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:52:01,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:52:01,928 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:52:01,930 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:52:09,783 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 20:52:09,783 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:52:09,795 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:52:09,795 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:52:09,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:52:09 BoogieIcfgContainer [2025-02-05 20:52:09,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:52:09,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:52:09,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:52:09,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:52:09,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:52:01" (1/3) ... [2025-02-05 20:52:09,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e18e567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:52:09, skipping insertion in model container [2025-02-05 20:52:09,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:52:01" (2/3) ... [2025-02-05 20:52:09,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e18e567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:52:09, skipping insertion in model container [2025-02-05 20:52:09,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:52:09" (3/3) ... [2025-02-05 20:52:09,805 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-78.i [2025-02-05 20:52:09,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:52:09,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-78.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:52:09,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:52:09,875 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;@1b158c47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:52:09,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:52:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 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-02-05 20:52:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 20:52:09,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:09,889 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, 1, 1, 1] [2025-02-05 20:52:09,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:09,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1991732355, now seen corresponding path program 1 times [2025-02-05 20:52:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916325679] [2025-02-05 20:52:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:09,907 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-02-05 20:52:09,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:09,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 20:52:09,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 20:52:10,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 20:52:10,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:10,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:10,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:52:10,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:52:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 20:52:10,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:52:10,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:52:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916325679] [2025-02-05 20:52:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916325679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:52:10,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:52:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:52:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237797212] [2025-02-05 20:52:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:52:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:52:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:52:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:52:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:52:10,375 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:52:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:52:10,396 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-02-05 20:52:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:52:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-02-05 20:52:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:52:10,402 INFO L225 Difference]: With dead ends: 118 [2025-02-05 20:52:10,403 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 20:52:10,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:52:10,406 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:52:10,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:52:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 20:52:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-05 20:52:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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-02-05 20:52:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2025-02-05 20:52:10,444 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2025-02-05 20:52:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:52:10,445 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2025-02-05 20:52:10,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 20:52:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2025-02-05 20:52:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 20:52:10,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:10,452 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, 1, 1, 1] [2025-02-05 20:52:10,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:52:10,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 20:52:10,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 412658487, now seen corresponding path program 1 times [2025-02-05 20:52:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:10,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145787721] [2025-02-05 20:52:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:10,660 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-02-05 20:52:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:10,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 20:52:10,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:10,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 20:52:11,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 20:52:11,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:11,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:11,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 20:52:11,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:52:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 20:52:11,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:52:11,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:52:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145787721] [2025-02-05 20:52:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145787721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:52:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:52:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:52:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419879367] [2025-02-05 20:52:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:52:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:52:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:52:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:52:11,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:52:11,306 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-05 20:52:12,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:52:17,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:52:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:52:17,025 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2025-02-05 20:52:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:52:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 139 [2025-02-05 20:52:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:52:17,055 INFO L225 Difference]: With dead ends: 115 [2025-02-05 20:52:17,055 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 20:52:17,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 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-02-05 20:52:17,056 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:52:17,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 20:52:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 20:52:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-05 20:52:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-02-05 20:52:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-02-05 20:52:17,066 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 139 [2025-02-05 20:52:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:52:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-02-05 20:52:17,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-05 20:52:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-02-05 20:52:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 20:52:17,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:17,069 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, 1, 1, 1] [2025-02-05 20:52:17,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 20:52:17,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1384292872, now seen corresponding path program 1 times [2025-02-05 20:52:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811483307] [2025-02-05 20:52:17,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:17,273 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-02-05 20:52:17,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:17,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 20:52:17,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 20:52:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 20:52:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:18,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 20:52:18,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:52:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-05 20:52:18,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:52:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 20:52:21,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:52:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811483307] [2025-02-05 20:52:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811483307] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:52:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:52:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 20:52:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492732733] [2025-02-05 20:52:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:52:21,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:52:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:52:21,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:52:21,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:52:21,766 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-02-05 20:52:25,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-05 20:52:26,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-05 20:52:30,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-05 20:52:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:52:31,308 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2025-02-05 20:52:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:52:31,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 139 [2025-02-05 20:52:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:52:31,318 INFO L225 Difference]: With dead ends: 144 [2025-02-05 20:52:31,319 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 20:52:31,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:52:31,319 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 81 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:52:31,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 290 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-02-05 20:52:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 20:52:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-02-05 20:52:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:52:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-02-05 20:52:31,341 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 139 [2025-02-05 20:52:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:52:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-02-05 20:52:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-02-05 20:52:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-02-05 20:52:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 20:52:31,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:31,343 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, 1, 1, 1, 1] [2025-02-05 20:52:31,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 20:52:31,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:31,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -66898065, now seen corresponding path program 1 times [2025-02-05 20:52:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598039380] [2025-02-05 20:52:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:31,545 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-02-05 20:52:31,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:31,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 20:52:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:52:31,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 20:52:31,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 20:52:31,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:31,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:31,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 20:52:31,906 INFO L279 TraceCheckSpWp]: Computing forward predicates...