./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-57.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_50-while_file-57.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 e9e4cb45c95e56f11e60a0a73722f1fb54adee905267e8a641b1bf27c5126193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:50:10,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:50:10,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:50:10,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:50:10,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:50:10,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:50:10,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:50:10,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:50:10,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:50:10,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:50:10,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:50:10,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:50:10,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:50:10,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:50:10,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:50:10,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:50:10,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:50:10,781 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 -> e9e4cb45c95e56f11e60a0a73722f1fb54adee905267e8a641b1bf27c5126193 [2025-02-06 01:50:11,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:50:11,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:50:11,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:50:11,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:50:11,084 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:50:11,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:12,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2bdee68/f1181a7efec644eb8c707d3e8429705d/FLAG279d8fc20 [2025-02-06 01:50:12,546 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:50:12,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:12,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2bdee68/f1181a7efec644eb8c707d3e8429705d/FLAG279d8fc20 [2025-02-06 01:50:12,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2bdee68/f1181a7efec644eb8c707d3e8429705d [2025-02-06 01:50:12,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:50:12,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:50:12,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:50:12,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:50:12,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:50:12,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:50:12" (1/1) ... [2025-02-06 01:50:12,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:12, skipping insertion in model container [2025-02-06 01:50:12,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:50:12" (1/1) ... [2025-02-06 01:50:12,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:50:12,926 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_50-while_file-57.i[915,928] [2025-02-06 01:50:12,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:50:12,987 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:50:12,994 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_50-while_file-57.i[915,928] [2025-02-06 01:50:13,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:50:13,022 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:50:13,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13 WrapperNode [2025-02-06 01:50:13,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:50:13,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:50:13,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:50:13,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:50:13,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,075 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-06 01:50:13,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:50:13,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:50:13,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:50:13,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:50:13,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,105 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 01:50:13,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:50:13,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:50:13,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:50:13,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:50:13,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (1/1) ... [2025-02-06 01:50:13,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:50:13,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:50:13,160 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 01:50:13,165 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 01:50:13,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:50:13,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:50:13,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:50:13,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:50:13,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:50:13,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:50:13,251 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:50:13,253 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:50:13,656 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-02-06 01:50:13,692 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 01:50:13,692 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:50:13,723 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:50:13,723 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:50:13,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:50:13 BoogieIcfgContainer [2025-02-06 01:50:13,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:50:13,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:50:13,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:50:13,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:50:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:50:12" (1/3) ... [2025-02-06 01:50:13,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705ad61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:50:13, skipping insertion in model container [2025-02-06 01:50:13,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:13" (2/3) ... [2025-02-06 01:50:13,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705ad61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:50:13, skipping insertion in model container [2025-02-06 01:50:13,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:50:13" (3/3) ... [2025-02-06 01:50:13,733 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:13,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:50:13,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-57.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:50:13,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:50:13,807 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;@25920fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:50:13,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:50:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:50:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 01:50:13,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:13,823 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:13,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:13,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:13,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1283673567, now seen corresponding path program 1 times [2025-02-06 01:50:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:50:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-02-06 01:50:13,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:13,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:50:13,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:50:13,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:50:13,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:50:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:50:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-02-06 01:50:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15139490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:50:14,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155950216] [2025-02-06 01:50:14,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:14,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:50:14,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:50:14,096 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 01:50:14,098 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 01:50:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:50:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:50:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:14,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:50:14,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:50:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:50:14,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:50:14,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155950216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:50:14,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:50:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:50:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025221658] [2025-02-06 01:50:14,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:50:14,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:50:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:50:14,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:50:14,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:50:14,287 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 62 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:50:14,323 INFO L93 Difference]: Finished difference Result 174 states and 295 transitions. [2025-02-06 01:50:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:50:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-06 01:50:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:50:14,329 INFO L225 Difference]: With dead ends: 174 [2025-02-06 01:50:14,331 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 01:50:14,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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 01:50:14,337 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:50:14,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:50:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 01:50:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 01:50:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:50:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2025-02-06 01:50:14,376 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 169 [2025-02-06 01:50:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:50:14,377 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2025-02-06 01:50:14,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2025-02-06 01:50:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 01:50:14,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:14,382 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:14,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:50:14,583 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 01:50:14,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1742715643, now seen corresponding path program 1 times [2025-02-06 01:50:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:50:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664505860] [2025-02-06 01:50:14,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:50:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:50:14,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:50:14,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:14,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 01:50:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:50:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664505860] [2025-02-06 01:50:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664505860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:50:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733047945] [2025-02-06 01:50:15,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:50:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:50:15,220 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 01:50:15,224 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 01:50:15,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:50:15,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:50:15,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:15,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:15,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 01:50:15,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:50:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-02-06 01:50:15,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:50:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-06 01:50:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733047945] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:50:15,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:50:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 01:50:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357393681] [2025-02-06 01:50:15,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:50:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:50:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:50:15,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:50:15,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:50:15,793 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 01:50:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:50:16,149 INFO L93 Difference]: Finished difference Result 179 states and 269 transitions. [2025-02-06 01:50:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:50:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 169 [2025-02-06 01:50:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:50:16,151 INFO L225 Difference]: With dead ends: 179 [2025-02-06 01:50:16,151 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 01:50:16,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:50:16,152 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 61 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:50:16,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 414 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:50:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 01:50:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-06 01:50:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:50:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2025-02-06 01:50:16,163 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 169 [2025-02-06 01:50:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:50:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2025-02-06 01:50:16,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-02-06 01:50:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2025-02-06 01:50:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 01:50:16,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:16,182 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:16,197 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 01:50:16,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:50:16,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2046693028, now seen corresponding path program 1 times [2025-02-06 01:50:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:50:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732812716] [2025-02-06 01:50:16,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:50:16,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:50:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:50:16,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:16,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:50:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:50:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732812716] [2025-02-06 01:50:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732812716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:50:16,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:50:16,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 01:50:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586486342] [2025-02-06 01:50:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:50:16,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 01:50:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:50:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 01:50:16,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:50:16,967 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:50:17,776 INFO L93 Difference]: Finished difference Result 436 states and 635 transitions. [2025-02-06 01:50:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:50:17,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-06 01:50:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:50:17,782 INFO L225 Difference]: With dead ends: 436 [2025-02-06 01:50:17,783 INFO L226 Difference]: Without dead ends: 346 [2025-02-06 01:50:17,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-06 01:50:17,787 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 459 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:50:17,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 752 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 01:50:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-02-06 01:50:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 315. [2025-02-06 01:50:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 226 states have (on average 1.345132743362832) internal successors, (304), 228 states have internal predecessors, (304), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 01:50:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2025-02-06 01:50:17,846 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 169 [2025-02-06 01:50:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:50:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2025-02-06 01:50:17,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2025-02-06 01:50:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 01:50:17,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:17,849 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:50:17,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1706665521, now seen corresponding path program 1 times [2025-02-06 01:50:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:50:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533460998] [2025-02-06 01:50:17,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:50:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 01:50:17,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 01:50:17,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:17,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:50:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:50:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533460998] [2025-02-06 01:50:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533460998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:50:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:50:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:50:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268110628] [2025-02-06 01:50:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:50:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:50:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:50:18,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:50:18,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:50:18,119 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:50:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:50:18,512 INFO L93 Difference]: Finished difference Result 775 states and 1133 transitions. [2025-02-06 01:50:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:50:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-02-06 01:50:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:50:18,517 INFO L225 Difference]: With dead ends: 775 [2025-02-06 01:50:18,517 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 01:50:18,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:50:18,518 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 333 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:50:18,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 591 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:50:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 01:50:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 331. [2025-02-06 01:50:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 242 states have (on average 1.359504132231405) internal successors, (329), 244 states have internal predecessors, (329), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 01:50:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 489 transitions. [2025-02-06 01:50:18,545 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 489 transitions. Word has length 170 [2025-02-06 01:50:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:50:18,545 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 489 transitions. [2025-02-06 01:50:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:50:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 489 transitions. [2025-02-06 01:50:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 01:50:18,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:18,547 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:18,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:50:18,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:18,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1410525486, now seen corresponding path program 1 times [2025-02-06 01:50:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:50:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632477184] [2025-02-06 01:50:18,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:50:18,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 01:50:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 01:50:18,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:18,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:50:18,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258440059] [2025-02-06 01:50:18,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:50:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:50:18,589 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 01:50:18,590 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 01:50:18,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 01:50:18,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 01:50:18,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:18,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:50:18,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:50:18,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 01:50:18,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 01:50:18,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:50:18,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:50:18,790 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:50:18,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:50:18,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:50:18,992 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 01:50:18,997 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 01:50:19,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:50:19,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:50:19 BoogieIcfgContainer [2025-02-06 01:50:19,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:50:19,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:50:19,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:50:19,069 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:50:19,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:50:13" (3/4) ... [2025-02-06 01:50:19,071 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:50:19,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:50:19,073 INFO L158 Benchmark]: Toolchain (without parser) took 6267.90ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.7MB in the beginning and 240.2MB in the end (delta: -136.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-02-06 01:50:19,073 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:50:19,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 89.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:50:19,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.05ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:50:19,074 INFO L158 Benchmark]: Boogie Preprocessor took 55.32ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:50:19,074 INFO L158 Benchmark]: IcfgBuilder took 589.15ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 51.3MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 01:50:19,074 INFO L158 Benchmark]: TraceAbstraction took 5341.84ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 50.4MB in the beginning and 240.2MB in the end (delta: -189.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:50:19,074 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 310.4MB. Free memory was 240.2MB in the beginning and 240.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:50:19,075 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 89.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.05ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.32ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 589.15ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 51.3MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5341.84ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 50.4MB in the beginning and 240.2MB in the end (delta: -189.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 310.4MB. Free memory was 240.2MB in the beginning and 240.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=-1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L89] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L91] var_1_3 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L94] var_1_5 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L98] var_1_6 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L99] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L101] var_1_8 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L102] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L103] var_1_9 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L104] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L105] var_1_10 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L106] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L107] var_1_11 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L108] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L109] var_1_12 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L110] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L111] var_1_14 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L112] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L113] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L113] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L114] var_1_15 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L116] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L116] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L117] var_1_16 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L118] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L119] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L119] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L122] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L122] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L123] var_1_18 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L124] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L125] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L125] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L128] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L128] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L141] RET updateVariables() [L142] CALL step() [L46] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L47] COND TRUE -256 <= stepLocal_0 [L48] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L54] COND TRUE var_1_11 <= var_1_9 [L55] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L57] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L58] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L66] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L66] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L67] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L70] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L70] signed long int stepLocal_2 = var_1_1 & var_1_3; [L71] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L78] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L80] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L81] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L82] COND TRUE ! (! var_1_6) [L83] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L133] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L133-L134] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=-193, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=-193, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 853 mSDsluCounter, 1885 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1273 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1734 IncrementalHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 612 mSDtfsCounter, 1734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 549 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 165 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 2417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 8843/9100 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 01:50:19,093 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_50-while_file-57.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 e9e4cb45c95e56f11e60a0a73722f1fb54adee905267e8a641b1bf27c5126193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:50:21,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:50:21,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:50:21,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:50:21,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:50:21,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:50:21,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:50:21,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:50:21,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:50:21,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:50:21,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:50:21,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:50:21,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:50:21,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:50:21,315 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:50:21,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:50:21,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:50:21,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:50:21,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:50:21,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:50:21,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:50:21,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:50:21,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:50:21,319 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 -> e9e4cb45c95e56f11e60a0a73722f1fb54adee905267e8a641b1bf27c5126193 [2025-02-06 01:50:21,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:50:21,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:50:21,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:50:21,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:50:21,621 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:50:21,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:22,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fd1979c6/018719131b1c4c4caade83bf0c0cb275/FLAG04c67be22 [2025-02-06 01:50:23,779 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:50:23,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:23,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fd1979c6/018719131b1c4c4caade83bf0c0cb275/FLAG04c67be22 [2025-02-06 01:50:23,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fd1979c6/018719131b1c4c4caade83bf0c0cb275 [2025-02-06 01:50:23,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:50:23,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:50:23,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:50:23,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:50:23,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:50:23,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:50:23" (1/1) ... [2025-02-06 01:50:23,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70696c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:23, skipping insertion in model container [2025-02-06 01:50:23,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:50:23" (1/1) ... [2025-02-06 01:50:23,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:50:23,963 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_50-while_file-57.i[915,928] [2025-02-06 01:50:24,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:50:24,043 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:50:24,054 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_50-while_file-57.i[915,928] [2025-02-06 01:50:24,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:50:24,105 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:50:24,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24 WrapperNode [2025-02-06 01:50:24,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:50:24,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:50:24,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:50:24,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:50:24,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,149 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-02-06 01:50:24,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:50:24,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:50:24,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:50:24,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:50:24,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,173 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 01:50:24,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:50:24,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:50:24,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:50:24,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:50:24,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (1/1) ... [2025-02-06 01:50:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:50:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:50:24,221 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 01:50:24,227 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 01:50:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:50:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:50:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:50:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:50:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:50:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:50:24,300 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:50:24,301 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:50:32,848 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 01:50:32,848 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:50:32,867 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:50:32,867 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:50:32,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:50:32 BoogieIcfgContainer [2025-02-06 01:50:32,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:50:32,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:50:32,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:50:32,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:50:32,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:50:23" (1/3) ... [2025-02-06 01:50:32,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:50:32, skipping insertion in model container [2025-02-06 01:50:32,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:50:24" (2/3) ... [2025-02-06 01:50:32,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:50:32, skipping insertion in model container [2025-02-06 01:50:32,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:50:32" (3/3) ... [2025-02-06 01:50:32,894 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-57.i [2025-02-06 01:50:32,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:50:32,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-57.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:50:32,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:50:32,975 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;@6c9fea40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:50:32,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:50:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:50:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:50:32,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:32,990 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:32,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -335512568, now seen corresponding path program 1 times [2025-02-06 01:50:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:50:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001914439] [2025-02-06 01:50:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:33,005 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 01:50:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:50:33,011 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 01:50:33,012 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 01:50:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:50:33,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:50:33,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:33,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:33,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:50:33,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:50:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2025-02-06 01:50:33,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:50:33,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:50:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001914439] [2025-02-06 01:50:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001914439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:50:33,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:50:33,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:50:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383915129] [2025-02-06 01:50:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:50:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:50:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:50:33,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:50:33,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:50:33,561 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:50:33,601 INFO L93 Difference]: Finished difference Result 137 states and 237 transitions. [2025-02-06 01:50:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:50:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-06 01:50:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:50:33,611 INFO L225 Difference]: With dead ends: 137 [2025-02-06 01:50:33,615 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 01:50:33,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 01:50:33,623 INFO L435 NwaCegarLoop]: 101 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, 101 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 01:50:33,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:50:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 01:50:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 01:50:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:50:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2025-02-06 01:50:33,685 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 163 [2025-02-06 01:50:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:50:33,685 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2025-02-06 01:50:33,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:50:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2025-02-06 01:50:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:50:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:50:33,693 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:50:33,727 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 01:50:33,893 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 01:50:33,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:50:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:50:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1410004500, now seen corresponding path program 1 times [2025-02-06 01:50:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:50:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269756285] [2025-02-06 01:50:33,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:50:33,899 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 01:50:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:50:33,902 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 01:50:33,904 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 01:50:33,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:50:34,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:50:34,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:50:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:50:34,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 01:50:34,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:51:43,190 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:51:48,602 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)