./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:01:13,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:01:13,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:01:13,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:01:13,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:01:13,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:01:13,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:01:13,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:01:13,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:01:13,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:01:13,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:01:13,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:01:13,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:01:13,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:01:13,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:01:13,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:01:13,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:01:13,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:01:13,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:01:13,362 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2025-02-07 23:01:13,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:01:13,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:01:13,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:01:13,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:01:13,713 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:01:13,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:15,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd774cb20/563fcf23aa6348e8ba2a8139f96f2bfc/FLAGc0fdd5f5b [2025-02-07 23:01:15,297 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:01:15,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:15,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd774cb20/563fcf23aa6348e8ba2a8139f96f2bfc/FLAGc0fdd5f5b [2025-02-07 23:01:15,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd774cb20/563fcf23aa6348e8ba2a8139f96f2bfc [2025-02-07 23:01:15,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:01:15,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:01:15,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:01:15,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:01:15,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:01:15,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15, skipping insertion in model container [2025-02-07 23:01:15,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:01:15,712 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2025-02-07 23:01:15,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:01:15,768 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:01:15,775 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2025-02-07 23:01:15,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:01:15,814 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:01:15,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15 WrapperNode [2025-02-07 23:01:15,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:01:15,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:01:15,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:01:15,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:01:15,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,869 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2025-02-07 23:01:15,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:01:15,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:01:15,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:01:15,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:01:15,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,898 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-07 23:01:15,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:01:15,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:01:15,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:01:15,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:01:15,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (1/1) ... [2025-02-07 23:01:15,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:01:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:15,941 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-07 23:01:15,943 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-07 23:01:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:01:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:01:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:01:15,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:01:16,020 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:01:16,022 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:01:16,373 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-02-07 23:01:16,374 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:01:16,395 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:01:16,396 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:01:16,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:16 BoogieIcfgContainer [2025-02-07 23:01:16,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:01:16,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:01:16,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:01:16,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:01:16,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:01:15" (1/3) ... [2025-02-07 23:01:16,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbc6502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:01:16, skipping insertion in model container [2025-02-07 23:01:16,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:15" (2/3) ... [2025-02-07 23:01:16,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbc6502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:01:16, skipping insertion in model container [2025-02-07 23:01:16,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:16" (3/3) ... [2025-02-07 23:01:16,404 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:16,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:01:16,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.dyn_partition.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:01:16,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:01:16,454 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;@1e8ea71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:01:16,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:01:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 23:01:16,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:16,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:01:16,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1383394203, now seen corresponding path program 1 times [2025-02-07 23:01:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:01:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370930001] [2025-02-07 23:01:16,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:01:16,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 23:01:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 23:01:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:01:16,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370930001] [2025-02-07 23:01:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370930001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:01:16,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:01:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:01:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164491024] [2025-02-07 23:01:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:01:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:01:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:01:16,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:01:16,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:01:16,797 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:16,850 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2025-02-07 23:01:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:01:16,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 23:01:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:16,869 INFO L225 Difference]: With dead ends: 87 [2025-02-07 23:01:16,869 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 23:01:16,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:01:16,877 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:16,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:01:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 23:01:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-07 23:01:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-02-07 23:01:16,901 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 16 [2025-02-07 23:01:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-02-07 23:01:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-02-07 23:01:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 23:01:16,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:16,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:01:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:01:16,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 69131845, now seen corresponding path program 1 times [2025-02-07 23:01:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:01:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-02-07 23:01:16,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:01:16,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 23:01:16,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 23:01:16,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:16,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:01:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443696481] [2025-02-07 23:01:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443696481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:01:17,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:01:17,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:01:17,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488346197] [2025-02-07 23:01:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:01:17,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:01:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:01:17,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:01:17,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:01:17,006 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:17,067 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2025-02-07 23:01:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:01:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 23:01:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:17,068 INFO L225 Difference]: With dead ends: 89 [2025-02-07 23:01:17,068 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 23:01:17,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:01:17,071 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:01:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 23:01:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-07 23:01:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2025-02-07 23:01:17,076 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 17 [2025-02-07 23:01:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:17,076 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-02-07 23:01:17,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2025-02-07 23:01:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 23:01:17,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:17,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:01:17,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:01:17,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -220370848, now seen corresponding path program 1 times [2025-02-07 23:01:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:01:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639635936] [2025-02-07 23:01:17,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:01:17,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 23:01:17,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 23:01:17,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:17,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:01:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639635936] [2025-02-07 23:01:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639635936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:01:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:01:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:01:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025010335] [2025-02-07 23:01:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:01:17,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:01:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:01:17,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:01:17,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:01:17,344 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:17,447 INFO L93 Difference]: Finished difference Result 110 states and 152 transitions. [2025-02-07 23:01:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:01:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 23:01:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:17,448 INFO L225 Difference]: With dead ends: 110 [2025-02-07 23:01:17,448 INFO L226 Difference]: Without dead ends: 73 [2025-02-07 23:01:17,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:01:17,449 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:17,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 194 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:01:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-07 23:01:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2025-02-07 23:01:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2025-02-07 23:01:17,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2025-02-07 23:01:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:17,452 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2025-02-07 23:01:17,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2025-02-07 23:01:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 23:01:17,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:17,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:01:17,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:01:17,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash -430271603, now seen corresponding path program 1 times [2025-02-07 23:01:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:01:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81070921] [2025-02-07 23:01:17,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:01:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 23:01:17,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 23:01:17,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:17,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:01:17,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:01:17,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 23:01:17,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 23:01:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:01:17,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:01:17,544 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:01:17,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:01:17,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:01:17,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:01:17,566 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:17,572 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:01:17,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:01:17 BoogieIcfgContainer [2025-02-07 23:01:17,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:01:17,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:01:17,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:01:17,577 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:01:17,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:16" (3/4) ... [2025-02-07 23:01:17,579 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:01:17,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:01:17,581 INFO L158 Benchmark]: Toolchain (without parser) took 1992.77ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 131.5MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:17,581 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:17,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.52ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 119.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:01:17,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.64ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 114.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:01:17,582 INFO L158 Benchmark]: Boogie Preprocessor took 44.99ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:17,582 INFO L158 Benchmark]: IcfgBuilder took 480.03ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 82.0MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 23:01:17,582 INFO L158 Benchmark]: TraceAbstraction took 1177.15ms. Allocated memory is still 167.8MB. Free memory was 81.5MB in the beginning and 131.5MB in the end (delta: -50.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:17,582 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.5MB in the end (delta: 12.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:17,583 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.52ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 119.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.64ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 114.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.99ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 480.03ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 82.0MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1177.15ms. Allocated memory is still 167.8MB. Free memory was 81.5MB in the beginning and 131.5MB in the end (delta: -50.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.5MB in the end (delta: 12.7kB). 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: 21]: 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 bitwiseAnd at line 69. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 535 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 173 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-07 23:01:17,599 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:01:19,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:01:19,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:01:19,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:01:19,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:01:20,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:01:20,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:01:20,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:01:20,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:01:20,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:01:20,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:01:20,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:01:20,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:01:20,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:01:20,010 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:01:20,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:01:20,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:01:20,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:01:20,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:01:20,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:01:20,021 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2025-02-07 23:01:20,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:01:20,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:01:20,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:01:20,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:01:20,443 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:01:20,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:22,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/856a3183c/5ff68dd63fab42608dea8377e3141feb/FLAG1476a0cb0 [2025-02-07 23:01:22,383 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:01:22,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:22,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/856a3183c/5ff68dd63fab42608dea8377e3141feb/FLAG1476a0cb0 [2025-02-07 23:01:22,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/856a3183c/5ff68dd63fab42608dea8377e3141feb [2025-02-07 23:01:22,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:01:22,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:01:22,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:01:22,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:01:22,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:01:22,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592df117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22, skipping insertion in model container [2025-02-07 23:01:22,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:01:22,620 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2025-02-07 23:01:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:01:22,715 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:01:22,724 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/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2025-02-07 23:01:22,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:01:22,763 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:01:22,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22 WrapperNode [2025-02-07 23:01:22,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:01:22,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:01:22,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:01:22,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:01:22,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,795 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-02-07 23:01:22,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:01:22,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:01:22,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:01:22,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:01:22,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,816 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-07 23:01:22,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:01:22,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:01:22,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:01:22,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:01:22,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (1/1) ... [2025-02-07 23:01:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:01:22,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:22,880 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-07 23:01:22,882 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-07 23:01:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:01:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:01:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:01:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:01:22,995 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:01:23,000 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:01:23,222 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-07 23:01:23,229 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:01:23,239 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:01:23,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:01:23,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:23 BoogieIcfgContainer [2025-02-07 23:01:23,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:01:23,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:01:23,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:01:23,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:01:23,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:01:22" (1/3) ... [2025-02-07 23:01:23,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce95ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:01:23, skipping insertion in model container [2025-02-07 23:01:23,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:01:22" (2/3) ... [2025-02-07 23:01:23,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce95ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:01:23, skipping insertion in model container [2025-02-07 23:01:23,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:23" (3/3) ... [2025-02-07 23:01:23,258 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2025-02-07 23:01:23,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:01:23,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.dyn_partition.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:01:23,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:01:23,369 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;@34c1c32c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:01:23,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:01:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:01:23,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:23,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:01:23,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:01:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:01:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125283121] [2025-02-07 23:01:23,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:23,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:23,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:23,401 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-07 23:01:23,404 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-07 23:01:23,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:01:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:01:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:23,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 23:01:23,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:01:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:23,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:01:23,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:01:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125283121] [2025-02-07 23:01:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125283121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:01:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:01:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:01:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028361863] [2025-02-07 23:01:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:01:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:01:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:01:23,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:01:23,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:01:23,800 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:23,900 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:01:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:01:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 23:01:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:23,920 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:01:23,921 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:01:23,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:01:23,929 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:23,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:01:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:01:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:01:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:01:23,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:01:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:01:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:01:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:01:23,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:23,955 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:01:23,965 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-07 23:01:24,156 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-07 23:01:24,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:01:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:01:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849500963] [2025-02-07 23:01:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:01:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:24,164 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-07 23:01:24,166 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-07 23:01:24,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:01:24,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:01:24,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:24,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:24,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 23:01:24,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:01:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:24,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:01:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:25,260 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:01:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849500963] [2025-02-07 23:01:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849500963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:01:25,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:01:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:01:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392946557] [2025-02-07 23:01:25,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:01:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:01:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:01:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:01:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:01:25,262 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:25,579 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-07 23:01:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:01:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:01:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:25,580 INFO L225 Difference]: With dead ends: 17 [2025-02-07 23:01:25,580 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 23:01:25,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:01:25,582 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:25,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:01:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 23:01:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-07 23:01:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 23:01:25,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-07 23:01:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:25,587 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 23:01:25,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 23:01:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 23:01:25,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:25,587 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 23:01:25,594 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-07 23:01:25,788 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-07 23:01:25,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-02-07 23:01:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:01:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111953536] [2025-02-07 23:01:25,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:01:25,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:25,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:25,795 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-07 23:01:25,799 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-07 23:01:25,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-07 23:01:25,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 23:01:25,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:01:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:25,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 23:01:25,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:01:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:26,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:01:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:28,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:01:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111953536] [2025-02-07 23:01:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111953536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:01:28,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:01:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 23:01:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096041270] [2025-02-07 23:01:28,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:01:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:01:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:01:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:01:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:01:28,456 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:30,423 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-07 23:01:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 23:01:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 23:01:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:30,424 INFO L225 Difference]: With dead ends: 29 [2025-02-07 23:01:30,424 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 23:01:30,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2025-02-07 23:01:30,425 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:30,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:01:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 23:01:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 23:01:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-07 23:01:30,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-02-07 23:01:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-07 23:01:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-07 23:01:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 23:01:30,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:30,433 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2025-02-07 23:01:30,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 23:01:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:30,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:30,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1857839369, now seen corresponding path program 3 times [2025-02-07 23:01:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:01:30,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657602158] [2025-02-07 23:01:30,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 23:01:30,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:30,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:01:30,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 23:01:30,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-02-07 23:01:30,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 23:01:30,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 23:01:30,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:01:30,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-07 23:01:30,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:01:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:31,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:01:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:01:39,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:01:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657602158] [2025-02-07 23:01:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657602158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:01:39,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:01:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-02-07 23:01:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410920441] [2025-02-07 23:01:39,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:01:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 23:01:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:01:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 23:01:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-02-07 23:01:39,578 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:01:48,931 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-02-07 23:01:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 23:01:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 23:01:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:01:48,935 INFO L225 Difference]: With dead ends: 53 [2025-02-07 23:01:48,935 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 23:01:48,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=659, Invalid=1597, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 23:01:48,937 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:01:48,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 26 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-07 23:01:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 23:01:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-07 23:01:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2025-02-07 23:01:48,949 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2025-02-07 23:01:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:01:48,950 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2025-02-07 23:01:48,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:01:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2025-02-07 23:01:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 23:01:48,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:01:48,951 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2025-02-07 23:01:48,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 23:01:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:49,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:01:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:01:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1230650871, now seen corresponding path program 4 times [2025-02-07 23:01:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:01:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58917948] [2025-02-07 23:01:49,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 23:01:49,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:01:49,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:01:49,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 23:01:49,248 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-07 23:01:49,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 23:01:49,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 23:01:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:01:49,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:01:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 23:01:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 23:01:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:01:49,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:01:49,526 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 23:01:49,526 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:01:49,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:01:49,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 23:01:49,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:01:49,733 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,764 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:01:49,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:01:49 BoogieIcfgContainer [2025-02-07 23:01:49,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:01:49,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:01:49,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:01:49,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:01:49,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:01:23" (3/4) ... [2025-02-07 23:01:49,792 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,801 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,802 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,802 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,802 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,802 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,802 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:01:49,865 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-02-07 23:01:49,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 23:01:49,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 23:01:49,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:01:49,918 INFO L158 Benchmark]: Toolchain (without parser) took 27499.19ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 90.0MB in the beginning and 249.5MB in the end (delta: -159.5MB). Peak memory consumption was 259.5MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,918 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:49,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.04ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 77.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.13ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,919 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:01:49,919 INFO L158 Benchmark]: IcfgBuilder took 402.59ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 58.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,919 INFO L158 Benchmark]: TraceAbstraction took 26543.86ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 57.7MB in the beginning and 266.3MB in the end (delta: -208.6MB). Peak memory consumption was 209.2MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,919 INFO L158 Benchmark]: Witness Printer took 127.19ms. Allocated memory is still 536.9MB. Free memory was 266.3MB in the beginning and 249.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:01:49,920 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.21ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.04ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 77.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.13ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 402.59ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 58.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26543.86ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 57.7MB in the beginning and 266.3MB in the end (delta: -208.6MB). Peak memory consumption was 209.2MB. Max. memory is 16.1GB. * Witness Printer took 127.19ms. Allocated memory is still 536.9MB. Free memory was 266.3MB in the beginning and 249.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 12 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 36 QuantifiedInterpolants, 29790 SizeOfPredicates, 18 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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 proved your program to be incorrect! [2025-02-07 23:01:49,948 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE