./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.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_loopvsstraightlinecode_100-1loop_file-34.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 e6e90d4f359562cf2288b0f968ce75b42f7be419be1d3a4bef987220d74231c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:45:33,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:45:33,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:45:34,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:45:34,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:45:34,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:45:34,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:45:34,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:45:34,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:45:34,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:45:34,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:45:34,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:45:34,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:45:34,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:45:34,024 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:45:34,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:45:34,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:45:34,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:45:34,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:45:34,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:45:34,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:45:34,027 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 -> e6e90d4f359562cf2288b0f968ce75b42f7be419be1d3a4bef987220d74231c9 [2025-02-06 00:45:34,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:45:34,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:45:34,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:45:34,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:45:34,228 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:45:34,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:45:35,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8edd5f40/2cf98df48d9a4a17bf524fe76a9bc4a8/FLAG020e2cb64 [2025-02-06 00:45:35,695 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:45:35,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:45:35,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8edd5f40/2cf98df48d9a4a17bf524fe76a9bc4a8/FLAG020e2cb64 [2025-02-06 00:45:35,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8edd5f40/2cf98df48d9a4a17bf524fe76a9bc4a8 [2025-02-06 00:45:35,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:45:35,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:45:35,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:45:35,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:45:35,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:45:35,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:35" (1/1) ... [2025-02-06 00:45:35,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:35, skipping insertion in model container [2025-02-06 00:45:35,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:35" (1/1) ... [2025-02-06 00:45:35,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:45:36,044 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_loopvsstraightlinecode_100-1loop_file-34.i[916,929] [2025-02-06 00:45:36,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:45:36,101 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:45:36,111 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_loopvsstraightlinecode_100-1loop_file-34.i[916,929] [2025-02-06 00:45:36,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:45:36,167 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:45:36,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36 WrapperNode [2025-02-06 00:45:36,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:45:36,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:45:36,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:45:36,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:45:36,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,200 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-02-06 00:45:36,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:45:36,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:45:36,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:45:36,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:45:36,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,227 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-06 00:45:36,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:45:36,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:45:36,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:45:36,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:45:36,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (1/1) ... [2025-02-06 00:45:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:45:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:36,263 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-06 00:45:36,265 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-06 00:45:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:45:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:45:36,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:45:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:45:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:45:36,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:45:36,329 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:45:36,330 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:45:36,641 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 00:45:36,641 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:45:36,648 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:45:36,649 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:45:36,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:36 BoogieIcfgContainer [2025-02-06 00:45:36,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:45:36,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:45:36,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:45:36,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:45:36,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:45:35" (1/3) ... [2025-02-06 00:45:36,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4e24d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:36, skipping insertion in model container [2025-02-06 00:45:36,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:36" (2/3) ... [2025-02-06 00:45:36,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4e24d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:36, skipping insertion in model container [2025-02-06 00:45:36,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:36" (3/3) ... [2025-02-06 00:45:36,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:45:36,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:45:36,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-34.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:45:36,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:45:36,705 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;@73b3c073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:45:36,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:45:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 00:45:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:45:36,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:36,715 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:36,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:36,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -800465530, now seen corresponding path program 1 times [2025-02-06 00:45:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-02-06 00:45:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:36,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:36,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 00:45:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-02-06 00:45:37,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326080809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:45:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478508717] [2025-02-06 00:45:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:37,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:45:37,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:37,016 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-06 00:45:37,018 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-06 00:45:37,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:37,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:37,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:37,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:45:37,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:45:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 00:45:37,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:45:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478508717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:45:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:45:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:45:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772076588] [2025-02-06 00:45:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:45:37,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:45:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:37,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:45:37,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:45:37,219 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 00:45:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:37,242 INFO L93 Difference]: Finished difference Result 155 states and 259 transitions. [2025-02-06 00:45:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:45:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-02-06 00:45:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:37,249 INFO L225 Difference]: With dead ends: 155 [2025-02-06 00:45:37,250 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 00:45:37,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-06 00:45:37,255 INFO L435 NwaCegarLoop]: 119 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, 119 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-06 00:45:37,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:45:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 00:45:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 00:45:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 00:45:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-02-06 00:45:37,284 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 142 [2025-02-06 00:45:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-02-06 00:45:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 00:45:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-02-06 00:45:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:45:37,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:37,287 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:37,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 00:45:37,491 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-06 00:45:37,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2065543520, now seen corresponding path program 1 times [2025-02-06 00:45:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180198081] [2025-02-06 00:45:37,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:37,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:37,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:37,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 00:45:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180198081] [2025-02-06 00:45:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180198081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:45:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:45:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:45:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116975468] [2025-02-06 00:45:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:45:38,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:45:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:38,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:45:38,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:45:38,495 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:38,777 INFO L93 Difference]: Finished difference Result 238 states and 360 transitions. [2025-02-06 00:45:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:45:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-02-06 00:45:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:38,780 INFO L225 Difference]: With dead ends: 238 [2025-02-06 00:45:38,780 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 00:45:38,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:45:38,781 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 177 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:38,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 355 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:45:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 00:45:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2025-02-06 00:45:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 00:45:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2025-02-06 00:45:38,804 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 142 [2025-02-06 00:45:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:38,805 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2025-02-06 00:45:38,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2025-02-06 00:45:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:45:38,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:38,807 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:38,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:45:38,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:38,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -454514496, now seen corresponding path program 1 times [2025-02-06 00:45:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195918495] [2025-02-06 00:45:38,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:38,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:38,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 00:45:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195918495] [2025-02-06 00:45:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195918495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:45:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:45:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:45:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949178325] [2025-02-06 00:45:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:45:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:45:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:45:39,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:45:39,737 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:40,443 INFO L93 Difference]: Finished difference Result 446 states and 660 transitions. [2025-02-06 00:45:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:45:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-02-06 00:45:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:40,451 INFO L225 Difference]: With dead ends: 446 [2025-02-06 00:45:40,452 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 00:45:40,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:45:40,455 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 371 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:40,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 604 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:45:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 00:45:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 216. [2025-02-06 00:45:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 159 states have (on average 1.3836477987421383) internal successors, (220), 160 states have internal predecessors, (220), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 00:45:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 324 transitions. [2025-02-06 00:45:40,497 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 324 transitions. Word has length 142 [2025-02-06 00:45:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:40,498 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 324 transitions. [2025-02-06 00:45:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 324 transitions. [2025-02-06 00:45:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:45:40,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:40,500 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:40,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:45:40,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -425885345, now seen corresponding path program 1 times [2025-02-06 00:45:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-02-06 00:45:40,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 00:45:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-02-06 00:45:40,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138774491] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:45:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521078765] [2025-02-06 00:45:40,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:40,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:45:40,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:40,823 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-06 00:45:40,827 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-06 00:45:40,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:40,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:40,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:40,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:40,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 00:45:40,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:45:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 00:45:41,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:45:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-06 00:45:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521078765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:45:41,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:45:41,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2025-02-06 00:45:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865467876] [2025-02-06 00:45:41,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:45:41,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 00:45:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:41,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 00:45:41,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:45:41,612 INFO L87 Difference]: Start difference. First operand 216 states and 324 transitions. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 4 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 00:45:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:42,979 INFO L93 Difference]: Finished difference Result 546 states and 786 transitions. [2025-02-06 00:45:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-02-06 00:45:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 4 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 142 [2025-02-06 00:45:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:42,982 INFO L225 Difference]: With dead ends: 546 [2025-02-06 00:45:42,982 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 00:45:42,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1001, Invalid=4401, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 00:45:42,985 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 649 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:42,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 668 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:45:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 00:45:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 228. [2025-02-06 00:45:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 164 states have (on average 1.274390243902439) internal successors, (209), 165 states have internal predecessors, (209), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 00:45:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2025-02-06 00:45:43,029 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 142 [2025-02-06 00:45:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2025-02-06 00:45:43,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 4 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 00:45:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2025-02-06 00:45:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:45:43,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:43,031 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:43,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 00:45:43,235 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-06 00:45:43,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1772140513, now seen corresponding path program 1 times [2025-02-06 00:45:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-02-06 00:45:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:43,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:43,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:43,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:43,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 33 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-02-06 00:45:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206642330] [2025-02-06 00:45:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206642330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:45:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812933756] [2025-02-06 00:45:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:45:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:43,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:45:43,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:45:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:45:43,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:45:43,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:43,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:43,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 00:45:43,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:45:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 00:45:43,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:45:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-06 00:45:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812933756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:45:44,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:45:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-02-06 00:45:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733663404] [2025-02-06 00:45:44,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:45:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:45:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:44,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:45:44,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:45:44,068 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-06 00:45:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:44,664 INFO L93 Difference]: Finished difference Result 531 states and 726 transitions. [2025-02-06 00:45:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 00:45:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 142 [2025-02-06 00:45:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:44,666 INFO L225 Difference]: With dead ends: 531 [2025-02-06 00:45:44,666 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 00:45:44,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=1257, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 00:45:44,668 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 515 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:44,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 461 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:45:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 00:45:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 246. [2025-02-06 00:45:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 170 states have (on average 1.2529411764705882) internal successors, (213), 170 states have internal predecessors, (213), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 00:45:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2025-02-06 00:45:44,713 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 142 [2025-02-06 00:45:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2025-02-06 00:45:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 3 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-06 00:45:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2025-02-06 00:45:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 00:45:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:44,715 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:44,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 00:45:44,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:45:44,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 412025641, now seen corresponding path program 1 times [2025-02-06 00:45:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979715428] [2025-02-06 00:45:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:45:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:45:44,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-02-06 00:45:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979715428] [2025-02-06 00:45:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979715428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:45:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942661276] [2025-02-06 00:45:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:45:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:45,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:45:45,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:45:45,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:45:45,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:45:45,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:45,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:45,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 00:45:45,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:45:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 440 proven. 33 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-06 00:45:45,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:45:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-06 00:45:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942661276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:45:46,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:45:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 33 [2025-02-06 00:45:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13865865] [2025-02-06 00:45:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:45:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 00:45:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 00:45:46,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 00:45:46,453 INFO L87 Difference]: Start difference. First operand 246 states and 333 transitions. Second operand has 33 states, 33 states have (on average 4.303030303030303) internal successors, (142), 33 states have internal predecessors, (142), 10 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) [2025-02-06 00:45:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:53,963 INFO L93 Difference]: Finished difference Result 2042 states and 2659 transitions. [2025-02-06 00:45:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-02-06 00:45:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.303030303030303) internal successors, (142), 33 states have internal predecessors, (142), 10 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) Word has length 143 [2025-02-06 00:45:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:53,973 INFO L225 Difference]: With dead ends: 2042 [2025-02-06 00:45:53,976 INFO L226 Difference]: Without dead ends: 1860 [2025-02-06 00:45:53,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33155 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8567, Invalid=64603, Unknown=0, NotChecked=0, Total=73170 [2025-02-06 00:45:53,990 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 4316 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 1312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4348 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1312 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:53,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4348 Valid, 1447 Invalid, 3645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1312 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 00:45:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-02-06 00:45:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 833. [2025-02-06 00:45:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 617 states have (on average 1.2512155591572123) internal successors, (772), 621 states have internal predecessors, (772), 158 states have call successors, (158), 57 states have call predecessors, (158), 57 states have return successors, (158), 154 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 00:45:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1088 transitions. [2025-02-06 00:45:54,107 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1088 transitions. Word has length 143 [2025-02-06 00:45:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1088 transitions. [2025-02-06 00:45:54,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.303030303030303) internal successors, (142), 33 states have internal predecessors, (142), 10 states have call successors, (60), 5 states have call predecessors, (60), 11 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) [2025-02-06 00:45:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1088 transitions. [2025-02-06 00:45:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 00:45:54,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:54,109 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:54,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 00:45:54,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 00:45:54,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:54,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -600480566, now seen corresponding path program 1 times [2025-02-06 00:45:54,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:54,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184157517] [2025-02-06 00:45:54,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:54,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:45:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:45:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:45:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 00:45:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:45:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184157517] [2025-02-06 00:45:54,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184157517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:45:54,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:45:54,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:45:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466836275] [2025-02-06 00:45:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:45:54,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:45:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:45:54,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:45:54,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:45:54,505 INFO L87 Difference]: Start difference. First operand 833 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:45:54,695 INFO L93 Difference]: Finished difference Result 1803 states and 2328 transitions. [2025-02-06 00:45:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:45:54,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-06 00:45:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:45:54,700 INFO L225 Difference]: With dead ends: 1803 [2025-02-06 00:45:54,700 INFO L226 Difference]: Without dead ends: 1123 [2025-02-06 00:45:54,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:45:54,705 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 119 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:45:54,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 358 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:45:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-02-06 00:45:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 575. [2025-02-06 00:45:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 433 states have (on average 1.25635103926097) internal successors, (544), 433 states have internal predecessors, (544), 100 states have call successors, (100), 41 states have call predecessors, (100), 41 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:45:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 744 transitions. [2025-02-06 00:45:54,772 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 744 transitions. Word has length 143 [2025-02-06 00:45:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:45:54,772 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 744 transitions. [2025-02-06 00:45:54,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:45:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 744 transitions. [2025-02-06 00:45:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 00:45:54,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:45:54,773 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:54,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:45:54,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:45:54,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:45:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash -571851415, now seen corresponding path program 1 times [2025-02-06 00:45:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:45:54,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910445944] [2025-02-06 00:45:54,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:45:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:45:54,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:45:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:45:54,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:45:54,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:45:54,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:45:54,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:45:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:45:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:45:54,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:45:54,903 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:45:54,904 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:45:54,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:45:54,907 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:45:55,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:45:55,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:45:55 BoogieIcfgContainer [2025-02-06 00:45:55,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:45:55,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:45:55,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:45:55,006 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:45:55,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:36" (3/4) ... [2025-02-06 00:45:55,008 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:45:55,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:45:55,010 INFO L158 Benchmark]: Toolchain (without parser) took 19071.48ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 108.4MB in the beginning and 248.9MB in the end (delta: -140.5MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,010 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:45:55,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.83ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 93.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.62ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:45:55,011 INFO L158 Benchmark]: Boogie Preprocessor took 35.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 85.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,011 INFO L158 Benchmark]: IcfgBuilder took 411.59ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 60.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,012 INFO L158 Benchmark]: TraceAbstraction took 18354.44ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 59.9MB in the beginning and 249.1MB in the end (delta: -189.2MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,012 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 419.4MB. Free memory was 249.1MB in the beginning and 248.9MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:45:55,013 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.83ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 93.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.62ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 85.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 411.59ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 60.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18354.44ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 59.9MB in the beginning and 249.1MB in the end (delta: -189.2MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 419.4MB. Free memory was 249.1MB in the beginning and 248.9MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned char var_1_3 = 200; [L24] unsigned char var_1_4 = 16; [L25] unsigned char var_1_5 = 0; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 64.75; [L28] double var_1_9 = 1.625; [L29] double var_1_10 = 0.0; [L30] double var_1_11 = 15.75; [L31] double var_1_12 = 199.6; [L32] double var_1_13 = 31.625; [L33] float var_1_14 = 2.575; [L34] float var_1_15 = 0.0; [L35] double var_1_16 = 64.8; [L36] double var_1_18 = 8.01; [L37] double var_1_19 = 1000000.5; [L38] unsigned char var_1_22 = 1; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] double var_1_26 = 49.31; [L43] signed long int var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 1; [L47] unsigned short int last_1_var_1_1 = 64; [L48] unsigned char last_1_var_1_22 = 1; [L49] signed long int last_1_var_1_28 = 1; [L50] unsigned char last_1_var_1_29 = 1; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L189] isInitial = 1 [L190] FCALL initially() [L191] int k_loop; [L192] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L192] COND TRUE k_loop < 1 [L193] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_22 = var_1_22 [L180] last_1_var_1_28 = var_1_28 [L181] last_1_var_1_29 = var_1_29 [L182] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L193] RET updateLastVariables() [L194] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L144] RET assume_abort_if_not(var_1_3 >= 191) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] CALL assume_abort_if_not(var_1_4 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] RET assume_abort_if_not(var_1_4 <= 64) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L152] var_1_8 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L153] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L154] var_1_10 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L155] RET assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L156] var_1_11 = __VERIFIER_nondet_double() [L157] 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, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L157] 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, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L160] var_1_15 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L161] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L174] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L175] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L175] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L194] RET updateVariables() [L195] CALL step() [L55] COND FALSE !(var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L62] signed long int stepLocal_7 = 100; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L63] COND TRUE ! (var_1_10 <= 16.8) [L64] var_1_29 = (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L74] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=0, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L75] COND FALSE !(stepLocal_1 >= var_1_28) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L78] unsigned char stepLocal_4 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_4=0, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L79] COND TRUE stepLocal_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) [L80] var_1_14 = ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L84] COND TRUE (- var_1_7) == var_1_10 [L85] var_1_16 = (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L87] var_1_31 = var_1_25 [L88] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L89] COND TRUE \read(var_1_29) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L90] COND FALSE !(((var_1_3 - var_1_4) - var_1_5) <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L94] unsigned char stepLocal_6 = var_1_31; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L95] COND FALSE !(var_1_31 && stepLocal_6) [L98] var_1_22 = (! (var_1_24 && (! var_1_25))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=13/8] [L105] COND TRUE var_1_12 == var_1_8 [L106] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L111] unsigned char stepLocal_3 = var_1_3; [L112] unsigned char stepLocal_2 = var_1_10 != var_1_9; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_2=0, stepLocal_3=-1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L113] COND FALSE !(stepLocal_2 && var_1_29) [L124] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=-1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L126] unsigned char stepLocal_5 = var_1_22; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=-1, stepLocal_5=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L127] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=-1, stepLocal_5=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L134] COND FALSE !(stepLocal_5 || var_1_22) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=-1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L138] COND TRUE var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1) [L139] var_1_26 = 25.5 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=-1, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L195] RET step() [L196] CALL, EXPR property() [L185-L186] return (((((((((((var_1_29 ? ((((var_1_3 - var_1_4) - var_1_5) <= var_1_28) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) : 1) && ((var_1_4 >= var_1_28) ? (var_1_7 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_22 ? ((var_1_1 >= var_1_5) ? (var_1_9 == ((double) ((((((var_1_10 - var_1_11) - var_1_12)) < (var_1_8)) ? (((var_1_10 - var_1_11) - var_1_12)) : (var_1_8))))) : 1) : ((var_1_12 == var_1_8) ? (var_1_9 == ((double) var_1_11)) : (var_1_9 == ((double) var_1_12))))) && (((var_1_10 != var_1_9) && var_1_29) ? ((var_1_11 >= (127.5 / var_1_10)) ? ((var_1_3 >= var_1_28) ? (var_1_13 == ((double) var_1_10)) : (var_1_13 == ((double) 9.9999999999996E12))) : (var_1_13 == ((double) var_1_11))) : (var_1_13 == ((double) var_1_12)))) && ((var_1_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) ? (var_1_14 == ((float) ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))))) : (var_1_14 == ((float) var_1_15)))) && (((- var_1_7) == var_1_10) ? (var_1_16 == ((double) (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))))) : 1)) && (var_1_22 ? ((var_1_10 >= (var_1_8 * var_1_13)) ? (var_1_19 == ((double) (var_1_18 - (var_1_15 - var_1_11)))) : (var_1_19 == ((double) ((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) : ((var_1_22 || var_1_22) ? (var_1_19 == ((double) var_1_12)) : 1))) && ((var_1_31 && var_1_31) ? (var_1_22 == ((unsigned char) ((var_1_29 || var_1_23) && var_1_24))) : (var_1_22 == ((unsigned char) (! (var_1_24 && (! var_1_25))))))) && ((var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1)) ? (var_1_26 == ((double) 25.5)) : 1)) && ((var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) ? ((last_1_var_1_29 && last_1_var_1_31) ? (var_1_28 == ((signed long int) last_1_var_1_1)) : (var_1_28 == ((signed long int) last_1_var_1_1))) : 1)) && ((! (var_1_10 <= 16.8)) ? (var_1_29 == ((unsigned char) (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)))) : (((last_1_var_1_28 * (- 2)) <= 100) ? (last_1_var_1_22 ? (var_1_29 == ((unsigned char) 0)) : (var_1_29 == ((unsigned char) (var_1_23 && var_1_24)))) : 1))) && (var_1_31 == ((unsigned char) var_1_25)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=1000005, var_1_19=2000001/2, var_1_1=64, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=127/4, var_1_9=1000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6192 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6147 mSDsluCounter, 4012 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3137 mSDsCounter, 2220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3770 IncrementalHoareTripleChecker+Invalid, 5990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2220 mSolverCounterUnsat, 875 mSDtfsCounter, 3770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 1008 SyntacticMatches, 4 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35427 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=833occurred in iteration=6, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 2019 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1708 NumberOfCodeBlocks, 1708 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1978 ConstructedInterpolants, 0 QuantifiedInterpolants, 7314 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 10275/10640 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-06 00:45:55,034 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_loopvsstraightlinecode_100-1loop_file-34.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 e6e90d4f359562cf2288b0f968ce75b42f7be419be1d3a4bef987220d74231c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:45:56,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:45:57,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:45:57,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:45:57,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:45:57,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:45:57,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:45:57,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:45:57,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:45:57,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:45:57,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:45:57,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:45:57,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:45:57,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:45:57,085 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:45:57,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:45:57,086 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:45:57,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:45:57,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:45:57,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:45:57,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:45:57,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:45:57,089 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 -> e6e90d4f359562cf2288b0f968ce75b42f7be419be1d3a4bef987220d74231c9 [2025-02-06 00:45:57,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:45:57,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:45:57,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:45:57,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:45:57,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:45:57,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:45:58,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7611c414/992f7da1c843408cae1c91efc0accd24/FLAG551835e92 [2025-02-06 00:45:58,770 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:45:58,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:45:58,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7611c414/992f7da1c843408cae1c91efc0accd24/FLAG551835e92 [2025-02-06 00:45:59,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7611c414/992f7da1c843408cae1c91efc0accd24 [2025-02-06 00:45:59,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:45:59,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:45:59,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:45:59,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:45:59,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:45:59,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e876dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59, skipping insertion in model container [2025-02-06 00:45:59,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:45:59,251 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_loopvsstraightlinecode_100-1loop_file-34.i[916,929] [2025-02-06 00:45:59,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:45:59,328 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:45:59,338 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_loopvsstraightlinecode_100-1loop_file-34.i[916,929] [2025-02-06 00:45:59,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:45:59,384 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:45:59,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59 WrapperNode [2025-02-06 00:45:59,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:45:59,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:45:59,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:45:59,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:45:59,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,424 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-02-06 00:45:59,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:45:59,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:45:59,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:45:59,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:45:59,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,444 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-06 00:45:59,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:45:59,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:45:59,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:45:59,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:45:59,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (1/1) ... [2025-02-06 00:45:59,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:45:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:45:59,490 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-06 00:45:59,494 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-06 00:45:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:45:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:45:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:45:59,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:45:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:45:59,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:45:59,582 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:45:59,584 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:46:26,152 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 00:46:26,152 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:46:26,161 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:46:26,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:46:26,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:26 BoogieIcfgContainer [2025-02-06 00:46:26,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:46:26,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:46:26,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:46:26,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:46:26,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:45:59" (1/3) ... [2025-02-06 00:46:26,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e7ef90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:26, skipping insertion in model container [2025-02-06 00:46:26,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:59" (2/3) ... [2025-02-06 00:46:26,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e7ef90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:26, skipping insertion in model container [2025-02-06 00:46:26,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:26" (3/3) ... [2025-02-06 00:46:26,169 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-34.i [2025-02-06 00:46:26,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:46:26,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-34.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:46:26,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:46:26,228 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;@10f0aef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:46:26,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:46:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 00:46:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:46:26,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:46:26,242 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:46:26,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:46:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:46:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -800465530, now seen corresponding path program 1 times [2025-02-06 00:46:26,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:46:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622645672] [2025-02-06 00:46:26,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:46:26,259 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-06 00:46:26,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:46:26,267 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-06 00:46:26,275 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-06 00:46:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:46:27,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:46:27,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:46:27,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:46:27,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:46:27,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:46:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 00:46:27,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:46:27,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:46:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622645672] [2025-02-06 00:46:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622645672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:46:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:46:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:46:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032446283] [2025-02-06 00:46:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:46:27,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:46:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:46:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:46:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:46:27,688 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 00:46:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:46:27,705 INFO L93 Difference]: Finished difference Result 155 states and 259 transitions. [2025-02-06 00:46:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:46:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2025-02-06 00:46:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:46:27,711 INFO L225 Difference]: With dead ends: 155 [2025-02-06 00:46:27,711 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 00:46:27,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-06 00:46:27,715 INFO L435 NwaCegarLoop]: 119 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, 119 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-06 00:46:27,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:46:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 00:46:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 00:46:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 00:46:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-02-06 00:46:27,742 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 142 [2025-02-06 00:46:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:46:27,742 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-02-06 00:46:27,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 00:46:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-02-06 00:46:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 00:46:27,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:46:27,744 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:46:27,782 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 00:46:27,945 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-06 00:46:27,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:46:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:46:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2065543520, now seen corresponding path program 1 times [2025-02-06 00:46:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:46:27,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764363464] [2025-02-06 00:46:27,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:46:27,947 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-06 00:46:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:46:27,949 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-06 00:46:27,951 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-06 00:46:28,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 00:46:29,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 00:46:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:46:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:46:29,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 00:46:29,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:46:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 00:46:38,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:46:38,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:46:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764363464] [2025-02-06 00:46:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764363464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:46:38,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:46:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:46:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073720909] [2025-02-06 00:46:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:46:38,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:46:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:46:38,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:46:38,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:46:38,067 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 00:46:43,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:46:47,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:46:48,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:46:52,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:46:53,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:46:57,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:47:01,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:47:06,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:47:10,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:47:14,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []