./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.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_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:39:58,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:39:58,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:39:58,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:39:58,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:39:58,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:39:58,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:39:58,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:39:58,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:39:58,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:39:58,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:39:58,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:39:58,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:39:58,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:39:58,283 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:39:58,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:39:58,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:39:58,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:39:58,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:39:58,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:39:58,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:39:58,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:39:58,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:39:58,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:39:58,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:39:58,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:39:58,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:39:58,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:39:58,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:39:58,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:39:58,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:39:58,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:39:58,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:39:58,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:39:58,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:39:58,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:39:58,288 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2025-02-06 00:39:58,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:39:58,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:39:58,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:39:58,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:39:58,593 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:39:58,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:39:59,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0625cfded/8e024f96ef7e4d649cfd8c016bb63a23/FLAG678340aa4 [2025-02-06 00:40:00,155 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:40:00,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:40:00,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0625cfded/8e024f96ef7e4d649cfd8c016bb63a23/FLAG678340aa4 [2025-02-06 00:40:00,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0625cfded/8e024f96ef7e4d649cfd8c016bb63a23 [2025-02-06 00:40:00,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:40:00,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:40:00,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:40:00,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:40:00,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:40:00,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108ea84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00, skipping insertion in model container [2025-02-06 00:40:00,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:40:00,383 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-02-06 00:40:00,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:40:00,448 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:40:00,461 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-02-06 00:40:00,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:40:00,514 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:40:00,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00 WrapperNode [2025-02-06 00:40:00,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:40:00,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:40:00,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:40:00,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:40:00,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,576 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-02-06 00:40:00,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:40:00,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:40:00,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:40:00,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:40:00,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:40:00,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:40:00,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:40:00,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:40:00,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:40:00,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (1/1) ... [2025-02-06 00:40:00,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:40:00,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:00,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:40:00,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:40:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:40:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:40:00,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:40:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:40:00,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:40:00,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:40:00,785 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:40:00,788 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:40:01,089 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-02-06 00:40:01,117 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 00:40:01,117 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:40:01,142 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:40:01,142 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:40:01,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:01 BoogieIcfgContainer [2025-02-06 00:40:01,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:40:01,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:40:01,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:40:01,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:40:01,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:40:00" (1/3) ... [2025-02-06 00:40:01,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288073b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:01, skipping insertion in model container [2025-02-06 00:40:01,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:00" (2/3) ... [2025-02-06 00:40:01,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288073b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:01, skipping insertion in model container [2025-02-06 00:40:01,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:01" (3/3) ... [2025-02-06 00:40:01,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:40:01,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:40:01,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-81.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:40:01,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:40:01,222 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;@7acd4d47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:40:01,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:40:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:40:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 00:40:01,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:01,239 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:01,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 413429320, now seen corresponding path program 1 times [2025-02-06 00:40:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16448729] [2025-02-06 00:40:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 00:40:01,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 00:40:01,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:01,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-06 00:40:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:40:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16448729] [2025-02-06 00:40:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16448729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:40:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352098260] [2025-02-06 00:40:01,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:01,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:40:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:01,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:40:01,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:40:01,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 00:40:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 00:40:01,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:01,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:01,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:40:01,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:40:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-06 00:40:01,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:40:01,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352098260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:40:01,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:40:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853676846] [2025-02-06 00:40:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:40:01,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:40:01,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:40:01,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:40:01,769 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:40:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:01,795 INFO L93 Difference]: Finished difference Result 134 states and 229 transitions. [2025-02-06 00:40:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:40:01,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-02-06 00:40:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:01,802 INFO L225 Difference]: With dead ends: 134 [2025-02-06 00:40:01,802 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 00:40:01,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:40:01,814 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:01,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:40:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 00:40:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 00:40:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:40:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-02-06 00:40:01,844 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 139 [2025-02-06 00:40:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:01,845 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-02-06 00:40:01,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:40:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-02-06 00:40:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 00:40:01,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:01,848 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:01,854 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 00:40:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:40:02,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1774500584, now seen corresponding path program 1 times [2025-02-06 00:40:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392363630] [2025-02-06 00:40:02,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 00:40:02,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 00:40:02,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:40:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:40:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392363630] [2025-02-06 00:40:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392363630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:40:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597449571] [2025-02-06 00:40:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:02,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:40:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:40:02,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:40:02,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:40:02,389 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:02,590 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2025-02-06 00:40:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:40:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2025-02-06 00:40:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:02,593 INFO L225 Difference]: With dead ends: 196 [2025-02-06 00:40:02,593 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 00:40:02,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:40:02,594 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:02,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 260 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:40:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 00:40:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-02-06 00:40:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:40:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2025-02-06 00:40:02,626 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 139 [2025-02-06 00:40:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2025-02-06 00:40:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2025-02-06 00:40:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 00:40:02,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:02,628 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:40:02,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 352824125, now seen corresponding path program 1 times [2025-02-06 00:40:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366365492] [2025-02-06 00:40:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 00:40:02,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 00:40:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:40:04,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:40:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366365492] [2025-02-06 00:40:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366365492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:40:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512711738] [2025-02-06 00:40:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:04,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:40:04,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:40:04,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:40:04,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:40:04,028 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:04,176 INFO L93 Difference]: Finished difference Result 207 states and 311 transitions. [2025-02-06 00:40:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:40:04,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-02-06 00:40:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:04,182 INFO L225 Difference]: With dead ends: 207 [2025-02-06 00:40:04,183 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 00:40:04,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:40:04,186 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 17 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:04,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 472 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:40:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 00:40:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2025-02-06 00:40:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:40:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2025-02-06 00:40:04,211 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 140 [2025-02-06 00:40:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-02-06 00:40:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2025-02-06 00:40:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 00:40:04,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:04,214 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:40:04,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1240327806, now seen corresponding path program 1 times [2025-02-06 00:40:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627620649] [2025-02-06 00:40:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 00:40:04,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 00:40:04,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:04,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:40:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:40:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627620649] [2025-02-06 00:40:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627620649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:40:05,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933820381] [2025-02-06 00:40:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:05,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:40:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:40:05,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:40:05,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:40:05,085 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:05,166 INFO L93 Difference]: Finished difference Result 226 states and 337 transitions. [2025-02-06 00:40:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:40:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-02-06 00:40:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:05,169 INFO L225 Difference]: With dead ends: 226 [2025-02-06 00:40:05,170 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 00:40:05,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:40:05,172 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 25 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:05,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 549 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:40:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 00:40:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-02-06 00:40:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:40:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2025-02-06 00:40:05,190 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 140 [2025-02-06 00:40:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:05,190 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2025-02-06 00:40:05,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2025-02-06 00:40:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 00:40:05,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:05,192 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:40:05,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:05,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -969173585, now seen corresponding path program 1 times [2025-02-06 00:40:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449225053] [2025-02-06 00:40:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:05,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 00:40:05,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 00:40:05,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:05,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:40:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:40:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449225053] [2025-02-06 00:40:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449225053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:40:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411748425] [2025-02-06 00:40:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:40:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:40:05,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:40:05,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:40:05,378 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:05,565 INFO L93 Difference]: Finished difference Result 233 states and 347 transitions. [2025-02-06 00:40:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:40:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-02-06 00:40:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:05,568 INFO L225 Difference]: With dead ends: 233 [2025-02-06 00:40:05,569 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 00:40:05,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:40:05,570 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:05,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 265 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:40:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 00:40:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2025-02-06 00:40:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:40:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2025-02-06 00:40:05,597 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 143 [2025-02-06 00:40:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2025-02-06 00:40:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2025-02-06 00:40:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 00:40:05,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:05,600 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:40:05,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 752205751, now seen corresponding path program 1 times [2025-02-06 00:40:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:40:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989079352] [2025-02-06 00:40:05,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:40:05,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:40:05,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:40:05,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:05,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:40:05,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:40:05,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 00:40:05,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 00:40:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:40:05,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:40:05,857 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:40:05,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:40:05,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:40:05,864 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 00:40:05,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:40:05,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:40:05 BoogieIcfgContainer [2025-02-06 00:40:05,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:40:05,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:40:05,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:40:05,969 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:40:05,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:01" (3/4) ... [2025-02-06 00:40:05,972 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:40:05,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:40:05,974 INFO L158 Benchmark]: Toolchain (without parser) took 5755.49ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 114.3MB in the beginning and 174.4MB in the end (delta: -60.1MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-02-06 00:40:05,975 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:40:05,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.52ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 100.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:40:05,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.81ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:40:05,975 INFO L158 Benchmark]: Boogie Preprocessor took 61.28ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:40:05,976 INFO L158 Benchmark]: IcfgBuilder took 499.54ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:40:05,976 INFO L158 Benchmark]: TraceAbstraction took 4821.61ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 74.0MB in the beginning and 174.5MB in the end (delta: -100.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-02-06 00:40:05,976 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 260.0MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:40:05,977 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.52ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 100.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.81ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.28ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 499.54ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4821.61ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 74.0MB in the beginning and 174.5MB in the end (delta: -100.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 260.0MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 43, overapproximation of bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; VAL [isInitial=0, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=63, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-1, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=9999, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=-32769, var_1_18=100, var_1_1=-2147483647, var_1_2=1, var_1_3=-2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1140 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 505 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 1330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5502/5544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 00:40:05,992 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_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:40:08,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:40:08,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:40:08,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:40:08,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:40:08,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:40:08,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:40:08,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:40:08,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:40:08,390 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:40:08,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:40:08,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:40:08,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:40:08,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:40:08,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:40:08,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:40:08,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:40:08,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:40:08,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:40:08,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:40:08,395 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2025-02-06 00:40:08,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:40:08,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:40:08,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:40:08,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:40:08,684 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:40:08,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:40:09,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d3f9a15d/b3b077d54209411e8c1b623a772d5e28/FLAG366bfc5c9 [2025-02-06 00:40:10,203 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:40:10,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:40:10,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d3f9a15d/b3b077d54209411e8c1b623a772d5e28/FLAG366bfc5c9 [2025-02-06 00:40:10,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d3f9a15d/b3b077d54209411e8c1b623a772d5e28 [2025-02-06 00:40:10,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:40:10,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:40:10,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:40:10,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:40:10,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:40:10,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef33c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10, skipping insertion in model container [2025-02-06 00:40:10,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:40:10,691 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-02-06 00:40:10,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:40:10,762 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:40:10,772 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-02-06 00:40:10,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:40:10,828 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:40:10,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10 WrapperNode [2025-02-06 00:40:10,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:40:10,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:40:10,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:40:10,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:40:10,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,880 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-02-06 00:40:10,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:40:10,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:40:10,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:40:10,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:40:10,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 00:40:10,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:40:10,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:40:10,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:40:10,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:40:10,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (1/1) ... [2025-02-06 00:40:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:40:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:10,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:40:10,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:40:10,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:40:10,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:40:10,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:40:10,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:40:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:40:10,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:40:11,070 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:40:11,072 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:40:11,303 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:40:11,305 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:40:11,314 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:40:11,315 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:40:11,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:11 BoogieIcfgContainer [2025-02-06 00:40:11,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:40:11,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:40:11,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:40:11,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:40:11,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:40:10" (1/3) ... [2025-02-06 00:40:11,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d7190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:11, skipping insertion in model container [2025-02-06 00:40:11,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:10" (2/3) ... [2025-02-06 00:40:11,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d7190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:11, skipping insertion in model container [2025-02-06 00:40:11,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:11" (3/3) ... [2025-02-06 00:40:11,327 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2025-02-06 00:40:11,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:40:11,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-81.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:40:11,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:40:11,426 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;@4d64bc50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:40:11,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:40:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:40:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 00:40:11,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:11,444 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:11,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1260215334, now seen corresponding path program 1 times [2025-02-06 00:40:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:40:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568263822] [2025-02-06 00:40:11,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:40:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:11,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:40:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:40:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 00:40:11,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 00:40:11,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:11,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:11,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:40:11,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:40:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-06 00:40:11,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:40:11,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:40:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568263822] [2025-02-06 00:40:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568263822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:40:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194649262] [2025-02-06 00:40:11,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:11,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:40:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:40:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:40:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:40:11,771 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:40:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:11,795 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-02-06 00:40:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:40:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2025-02-06 00:40:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:11,802 INFO L225 Difference]: With dead ends: 112 [2025-02-06 00:40:11,802 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 00:40:11,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:40:11,807 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:11,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:40:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 00:40:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 00:40:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 00:40:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-02-06 00:40:11,858 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 136 [2025-02-06 00:40:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:11,858 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-02-06 00:40:11,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:40:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-02-06 00:40:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 00:40:11,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:11,861 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:11,869 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 00:40:12,063 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 [2025-02-06 00:40:12,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash -242134138, now seen corresponding path program 1 times [2025-02-06 00:40:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:40:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909437000] [2025-02-06 00:40:12,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:40:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:12,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:40:12,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:40:12,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 00:40:12,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 00:40:12,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:12,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:12,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 00:40:12,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:40:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-06 00:40:13,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:40:13,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:40:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909437000] [2025-02-06 00:40:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909437000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:40:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:40:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:40:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867241450] [2025-02-06 00:40:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:40:13,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:40:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:40:13,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:40:13,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:40:13,183 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:40:13,448 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2025-02-06 00:40:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:40:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-02-06 00:40:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:40:13,452 INFO L225 Difference]: With dead ends: 163 [2025-02-06 00:40:13,452 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 00:40:13,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:40:13,453 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:40:13,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:40:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 00:40:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2025-02-06 00:40:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 00:40:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-02-06 00:40:13,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 136 [2025-02-06 00:40:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:40:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-02-06 00:40:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-06 00:40:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-02-06 00:40:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 00:40:13,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:40:13,497 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:40:13,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:40:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:40:13,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:40:13,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:40:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -891278113, now seen corresponding path program 1 times [2025-02-06 00:40:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:40:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152023484] [2025-02-06 00:40:13,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:40:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:40:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:40:13,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:40:13,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:40:13,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 00:40:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 00:40:13,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:40:13,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:40:13,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 00:40:13,813 INFO L279 TraceCheckSpWp]: Computing forward predicates...